메뉴 건너뛰기




Volumn , Issue , 2010, Pages 432-437

Infobright- Analytic database engine using rough sets & granular computing

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE VALUES; CORE COMPONENTS; DATABASE ENGINE; FORCE DATA; QUERY EXECUTION; ROUGH SET;

EID: 77958606383     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GrC.2010.177     Document Type: Conference Paper
Times cited : (24)

References (18)
  • 2
    • 70849110770 scopus 로고    scopus 로고
    • Data warehouse technology by Infobright
    • D. Ślȩzak and V. Eastwood, "Data warehouse technology by Infobright, " in SIGMOD'2009, pp. 841-846.
    • SIGMOD'2009 , pp. 841-846
    • Ślȩzak, D.1    Eastwood, V.2
  • 3
    • 84867122299 scopus 로고    scopus 로고
    • Brighthouse: An analytic data warehouse for ad-hoc queries
    • D. Ślecedil;zak, J. Wróblewski, V. Eastwood, and P. Synak, "Brighthouse: an analytic data warehouse for ad-hoc queries, " Proc. VLDB Endow., vol. 1, no. 2, pp. 1337-1345, 2008.
    • (2008) Proc. VLDB Endow. , vol.1 , Issue.2 , pp. 1337-1345
    • Ślȩzak, D́.1    Wróblewski, J.2    Eastwood, V.3    Synak, P.4
  • 6
    • 33749680310 scopus 로고    scopus 로고
    • Rudiments of rough sets
    • Z. Pawlak and A. Skowron, "Rudiments of rough sets, " Information Sciences, vol. 177, no. 1, pp. 3-27, 2007.
    • (2007) Information Sciences , vol.177 , Issue.1 , pp. 3-27
    • Pawlak, Z.1    Skowron, A.2
  • 7
    • 35448936912 scopus 로고    scopus 로고
    • How to barter bits for chronons: Compression and bandwidth trade offs for database scans
    • A. L. Holloway, V. Raman, G. Swart, and D. J. DeWitt, "How to barter bits for chronons: compression and bandwidth trade offs for database scans, " in SIGMOD'2007, pp. 389-400.
    • SIGMOD'2007 , pp. 389-400
    • Holloway, A.L.1    Raman, V.2    Swart, G.3    Dewitt, D.J.4
  • 10
    • 4243061781 scopus 로고    scopus 로고
    • The knowledge grid
    • M. Cannataro and D. Talia, "The knowledge grid, " Commun. ACM, vol. 46, no. 1, pp. 89-93, 2003.
    • (2003) Commun. ACM , vol.46 , Issue.1 , pp. 89-93
    • Cannataro, M.1    Talia, D.2
  • 11
    • 0036877036 scopus 로고    scopus 로고
    • Data page layouts for relational databases on deep memory hierarchies
    • A. Ailamaki, D. J. DeWitt, and M. D. Hill, "Data page layouts for relational databases on deep memory hierarchies, " VLDB J., vol. 11, no. 3, pp. 198-215, 2002.
    • (2002) VLDB J. , vol.11 , Issue.3 , pp. 198-215
    • Ailamaki, A.1    Dewitt, D.J.2    Hill, M.D.3
  • 15
    • 34548714108 scopus 로고    scopus 로고
    • Materialization strategies in a column-oriented DBMS
    • D. J. Abadi, D. S. Myers, D. J. DeWitt, and S. Madden, "Materialization strategies in a column-oriented DBMS, " in ICDE'2007, pp. 466-475.
    • ICDE'2007 , pp. 466-475
    • Abadi, D.J.1    Myers, D.S.2    Dewitt, D.J.3    Madden, S.4
  • 16
    • 67649641448 scopus 로고    scopus 로고
    • Space-constrained grambased indexing for efficient approximate string search
    • A. Behm, S. Ji, C. Li, and J. Lu, "Space-constrained grambased indexing for efficient approximate string search, " in ICDE'2009, pp. 604-615.
    • ICDE'2009 , pp. 604-615
    • Behm, A.1    Ji, S.2    Li, C.3    Lu, J.4
  • 17
    • 85012195470 scopus 로고    scopus 로고
    • The history of histograms (abridged)
    • Y. Ioannidis, "The history of histograms (abridged), " in VLDB'2003, pp. 19-30.
    • VLDB'2003 , pp. 19-30
    • Ioannidis, Y.1
  • 18
    • 79956276000 scopus 로고    scopus 로고
    • Towards approximate SQL-Infobright's approach
    • D. Ślȩzak and M. Kowalski, "Towards approximate SQL- Infobright's approach, " in RSCTC'2010, pp. 630-639.
    • RSCTC'2010 , pp. 630-639
    • Ślȩzak, D.1    Kowalski, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.