메뉴 건너뛰기




Volumn 5691 LNCS, Issue , 2009, Pages 111-124

Fast loads and fast queries

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX INDICES; FAST QUERY; INDEX MAINTENANCE; LOAD SEQUENCES; QUERY PERFORMANCE; QUERY PREDICATES; RELATIONAL TABLES; SEARCH PERFORMANCE; SIDE EFFECT;

EID: 70349437239     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03730-6_10     Document Type: Conference Paper
Times cited : (16)

References (12)
  • 3
    • 84865588615 scopus 로고
    • Organization and maintenance of large ordered indexes
    • Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indexes. In: SIGFIDET Workshop 1970, pp. 107-141 (1970)
    • (1970) SIGFIDET Workshop 1970 , pp. 107-141
    • Bayer, R.1    McCreight, E.M.2
  • 4
    • 67650212777 scopus 로고    scopus 로고
    • Sorting and indexing with partitioned B-trees
    • Graefe, G.: Sorting and indexing with partitioned B-trees. In: CIDR 2003(2003)
    • (2003) CIDR 2003
    • Graefe, G.1
  • 5
    • 34247329565 scopus 로고    scopus 로고
    • Graefe, G.: B-tree indexes, interpolation search, and skew. In: DaMoN 2006, p. 5 (2006)
    • Graefe, G.: B-tree indexes, interpolation search, and skew. In: DaMoN 2006, p. 5 (2006)
  • 6
    • 0034999146 scopus 로고    scopus 로고
    • Efficient bulk deletes in relational databases
    • Gärtner, A., Kemper, A., Kossmann, D., Zeller, B.: Efficient bulk deletes in relational databases. In: ICDE 2001, pp. 183-192 (2001)
    • (2001) ICDE 2001 , pp. 183-192
    • Gärtner, A.1    Kemper, A.2    Kossmann, D.3    Zeller, B.4
  • 7
    • 0035023841 scopus 로고    scopus 로고
    • B-Tree indexes and CPU caches
    • Graefe, G., Larson, P.-Å.: B-Tree indexes and CPU caches. In: ICDE 2001, pp. 349-358 (2001)
    • (2001) ICDE 2001 , pp. 349-358
    • Graefe, G.1    Larson, P.A.2
  • 8
    • 0038845233 scopus 로고    scopus 로고
    • The evolution of effective B-tree page organization and techniques: A personal account
    • Lomet, D.B.: The evolution of effective B-tree page organization and techniques: A personal account. SIGMOD Record 30(3), 64-69 (2001)
    • (2001) SIGMOD Record , vol.30 , Issue.3 , pp. 64-69
    • Lomet, D.B.1
  • 9
    • 0022821544 scopus 로고
    • A study of index structures for main memory database management systems
    • Lehman, T.J., Carey, M.J.: A study of index structures for main memory database management systems. In: VLDB 1986, pp. 294-303 (1986)
    • (1986) VLDB 1986 , pp. 294-303
    • Lehman, T.J.1    Carey, M.J.2
  • 10
    • 34547491766 scopus 로고
    • Efficient search of multidimensional B-trees
    • Leslie, H., Jain, R., Birdsall, D., Yaghmai, H.: Efficient search of multidimensional B-trees. In: VLDB 1995, pp. 710-719 (1995)
    • (1995) VLDB 1995 , pp. 710-719
    • Leslie, H.1    Jain, R.2    Birdsall, D.3    Yaghmai, H.4
  • 11
    • 70349467125 scopus 로고    scopus 로고
    • Small materialized aggregates: A light weight index structure for data warehousing
    • Moerkotte, G.: Small materialized aggregates: A light weight index structure for data warehousing. In: VLDB 1998, pp. 476-487 (1998)
    • (1998) VLDB 1998 , pp. 476-487
    • Moerkotte, G.1
  • 12
    • 0039785294 scopus 로고    scopus 로고
    • Making B+-trees cache conscious in main memory
    • Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. In: SIGMOD 2000, pp. 475-486 (2000)
    • (2000) SIGMOD 2000 , pp. 475-486
    • Rao, J.1    Ross, K.A.2


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