메뉴 건너뛰기




Volumn 4, Issue 9, 2011, Pages 585-597

Merging what'S cracked, cracking what'S merged: Adaptive indexing in main-memory column-stores

Author keywords

[No Author keywords available]

Indexed keywords

COLUMN-STORE; COLUMN-STORES; COSTS AND BENEFITS; FINAL STATE; HYBRID ALGORITHMS; HYBRID TECHNIQUES; INDEX CONSTRUCTION; INDEX STRUCTURE; INDEXING TECHNIQUES; LOOKUPS; MAIN-MEMORY; QUERY EXECUTION; SIDE EFFECT;

EID: 84857184772     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: None     Document Type: Article
Times cited : (121)

References (15)
  • 1
    • 36949041072 scopus 로고    scopus 로고
    • Physical design refinement: the 'merge-reduce' approach
    • N. Bruno and S. Chaudhuri. Physical design refinement: the 'merge-reduce' approach. ACM TODS, 32(4):28:1-28:41, 2007.
    • (2007) ACM TODS , vol.32 , Issue.4
    • Bruno, N.1    Chaudhuri, S.2
  • 2
    • 85011016189 scopus 로고    scopus 로고
    • Self-tuning database systems: A decade of progress
    • S. Chaudhuri and V. R. Narasayya. Self-tuning database systems: A decade of progress. VLDB, pages 3-14, 2007.
    • (2007) VLDB , pp. 3-14
    • Chaudhuri, S.1    Narasayya, V.R.2
  • 3
    • 0023980306 scopus 로고
    • Physical database design for relational databases
    • S. J. Finkelstein, M. Schkolnick, and P. Tiberio. Physical database design for relational databases. ACM TODS, 13(1):91-128, 1988.
    • (1988) ACM TODS , vol.13 , Issue.1 , pp. 91-128
    • Finkelstein, S.J.1    Schkolnick, M.2    Tiberio, P.3
  • 4
    • 77955207233 scopus 로고    scopus 로고
    • A Survey of B-tree Locking Techniques
    • G. Graefe. A Survey of B-tree Locking Techniques. ACM TODS, 35(2):16:1-16:26, 2010.
    • (2010) ACM TODS , vol.35 , Issue.2
    • Graefe, G.1
  • 6
    • 77952600921 scopus 로고    scopus 로고
    • Adaptive indexing for relational keys
    • G. Graefe and H. Kuno. Adaptive indexing for relational keys. SMDB, pages 69-74, 2010.
    • (2010) SMDB , pp. 69-74
    • Graefe, G.1    Kuno, H.2
  • 7
    • 77952279358 scopus 로고    scopus 로고
    • Self-selecting, self-tuning, incrementally optimized indexes
    • G. Graefe and H. Kuno. Self-selecting, self-tuning, incrementally optimized indexes. EDBT, pages 371-381, 2010.
    • (2010) EDBT , pp. 371-381
    • Graefe, G.1    Kuno, H.2
  • 8
    • 77952249892 scopus 로고
    • Selecting an optimal set of secondary indices
    • T. Ḧarder. Selecting an optimal set of secondary indices. Lecture Notes in Computer Science, 44:146-160, 1976.
    • (1976) Lecture Notes in Computer Science , vol.44 , pp. 146-160
    • Ḧarder, T.1
  • 9
    • 84869061183 scopus 로고
    • Algorithm 64: Quicksort
    • C. A. R. Hoare. Algorithm 64: Quicksort. Comm. ACM, 4(7):321, 1961.
    • (1961) Comm. ACM , vol.4 , Issue.7 , pp. 321
    • Hoare, C.A.R.1
  • 11
  • 12
    • 70749162031 scopus 로고    scopus 로고
    • Self-organizing tuple reconstruction in column stores
    • S. Idreos, M. L. Kersten, and S. Manegold. Self-organizing tuple reconstruction in column stores. SIGMOD, pages 297-308, 2009.
    • (2009) SIGMOD , pp. 297-308
    • Idreos, S.1    Kersten, M.L.2    Manegold, S.3
  • 14
    • 0029222709 scopus 로고
    • Generalized partial indexes
    • A. N. S. Praveen Seshadri. Generalized partial indexes. ICDE, pages 420-427, 1995.
    • (1995) ICDE , pp. 420-427
    • Praveen Seshadri, A.N.S.1
  • 15
    • 84976655848 scopus 로고
    • The case for partial indexes
    • M. Stonebraker. The case for partial indexes. SIGMOD Record, 18(4):4-11, 1989.
    • (1989) SIGMOD Record , vol.18 , Issue.4 , pp. 4-11
    • Stonebraker, M.1


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