메뉴 건너뛰기




Volumn , Issue , 2007, Pages 773-784

Lazy, adaptive rid-list intersection, and its application to index anding

Author keywords

AND tree; Intersection; Lazy; Sorting; Star join

Indexed keywords

ADAPTIVE ALGORITHMS; DATABASE SYSTEMS; INFORMATION RETRIEVAL; LOGIC GATES; SEARCH ENGINES; SORTING;

EID: 35448938489     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247566     Document Type: Conference Paper
Times cited : (28)

References (15)
  • 1
    • 0039253775 scopus 로고    scopus 로고
    • Eddies: Continuously adaptive query processing
    • R. Avnur and J. Hellerstein. Eddies: Continuously adaptive query processing. In SIGMOD, 2000.
    • (2000) SIGMOD
    • Avnur, R.1    Hellerstein, J.2
  • 3
    • 35448944267 scopus 로고    scopus 로고
    • Adaptive intersection and t-threshold problems
    • J. Barbay and C. Kenyon. Adaptive intersection and t-threshold problems. In SODA, 2002.
    • (2002) SODA
    • Barbay, J.1    Kenyon, C.2
  • 5
    • 0036367943 scopus 로고    scopus 로고
    • Holistic twig joins: Optimal xml pattern matching
    • N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: optimal xml pattern matching. In SIGMOD, 2002.
    • (2002) SIGMOD
    • Bruno, N.1    Koudas, N.2    Srivastava, D.3
  • 6
    • 0033899322 scopus 로고    scopus 로고
    • Adaptive set intersections, unions, and differences
    • E. Demaine, A. López-Ortiz, and J. Munro. Adaptive set intersections, unions, and differences. In SODA, 2000.
    • (2000) SODA
    • Demaine, E.1    López-Ortiz, A.2    Munro, J.3
  • 7
    • 84976724904 scopus 로고
    • On the propagation of errors in the size of join results
    • Y. Ioannidis and S. Christodoulakis. On the propagation of errors in the size of join results. In SIGMOD, 1991.
    • (1991) SIGMOD
    • Ioannidis, Y.1    Christodoulakis, S.2
  • 8
    • 35448987986 scopus 로고    scopus 로고
    • Bucket skip merge join: A scalable algorithm for join processing in very large databases using indexes
    • Technical Report UM-CS-1996-020, University of Massachusetts at Amherst
    • M. Kamath and K. Ramamritham. Bucket skip merge join: A scalable algorithm for join processing in very large databases using indexes. Technical Report UM-CS-1996-020, University of Massachusetts at Amherst, 1996.
    • (1996)
    • Kamath, M.1    Ramamritham, K.2
  • 11
    • 0031165870 scopus 로고    scopus 로고
    • Improved query performance with variant indexes
    • P. O'Neil and D. Quass. Improved query performance with variant indexes. In SIGMOD, 1997.
    • (1997) SIGMOD
    • O'Neil, P.1    Quass, D.2
  • 13
    • 35449003957 scopus 로고    scopus 로고
    • SAP. SAP Business Information Warehouse Benchmark
    • SAP. SAP Business Information Warehouse Benchmark.
  • 15
    • 33745618477 scopus 로고    scopus 로고
    • Mike Stonebraker, Daniel Abadi, Adam. Batkin, Xuedong Chen, Mitch Chemiack, Miguel Ferreira, Edmond Lau, Amerson Lin, Sam Madden, Elizabeth O'Neil, Pat O'Neil, Alex Rasin, Nga Tran, and Stan Zdonik. C-Store: A Column-oriented DBMS. In VLDB, 2005.
    • Mike Stonebraker, Daniel Abadi, Adam. Batkin, Xuedong Chen, Mitch Chemiack, Miguel Ferreira, Edmond Lau, Amerson Lin, Sam Madden, Elizabeth O'Neil, Pat O'Neil, Alex Rasin, Nga Tran, and Stan Zdonik. C-Store: A Column-oriented DBMS. In VLDB, 2005.


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