메뉴 건너뛰기




Volumn 4254 LNCS, Issue , 2006, Pages 589-600

A foundation for the replacement of pipelined physical join operators in adaptive query processing

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; COMPUTATIONAL METHODS; DATA REDUCTION; DECISION THEORY; MATHEMATICAL OPERATORS; PROGRAM PROCESSORS;

EID: 33845235413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11896548_44     Document Type: Conference Paper
Times cited : (8)

References (16)
  • 1
    • 0039253775 scopus 로고    scopus 로고
    • Eddies: Continuously adaptive query processing
    • R. Avnur and J.M. Hellerstein. Eddies: Continuously Adaptive Query Processing. In ACM SIGMOD, pages 261-272, 2000.
    • (2000) ACM SIGMOD , pp. 261-272
    • Avnur, R.1    Hellerstein, J.M.2
  • 2
    • 33745461690 scopus 로고    scopus 로고
    • Adaptive query processing in the looking glass
    • S. Babu and P. Bizarro. Adaptive Query Processing in the Looking Glass. In CIDR, pages 238-249, 2005.
    • (2005) CIDR , pp. 238-249
    • Babu, S.1    Bizarro, P.2
  • 6
    • 0025444574 scopus 로고
    • Encapsulation of parallelism in the volcano query processing system
    • G. Graefe. Encapsulation of Parallelism in the Volcano Query Processing System. In Proc. SIGMOD, pages 102-111, 1990.
    • (1990) Proc. SIGMOD , pp. 102-111
    • Graefe, G.1
  • 7
    • 0027608375 scopus 로고
    • Query evaluation techniques for large databases
    • G. Graefe. Query Evaluation Techniques for Large Databases. ACM Comput. Surv., 25(2):73-170, 1993.
    • (1993) ACM Comput. Surv. , vol.25 , Issue.2 , pp. 73-170
    • Graefe, G.1
  • 9
    • 0032093823 scopus 로고    scopus 로고
    • Efficient mid-query re-optimization of sub-optimal query execution plans
    • N. Kabra and D. J. DeWitt. Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans. In SIGMOD Conference, pages 106-117, 1998.
    • (1998) SIGMOD Conference , pp. 106-117
    • Kabra, N.1    DeWitt, D.J.2
  • 11
    • 0026826969 scopus 로고
    • Join processing in relational databases
    • P. Mishra and M. H. Eich. Join Processing in Relational Databases. ACM Comput. Surv., 24(1):63-113, 1992.
    • (1992) ACM Comput. Surv. , vol.24 , Issue.1 , pp. 63-113
    • Mishra, P.1    Eich, M.H.2
  • 14
    • 0041414949 scopus 로고    scopus 로고
    • Flux: An adaptive partitioning operator for continuous query systems
    • M. A. Shah, J. M. Hellerstein, S. Chandrasekaran, and M. J. Franklin. Flux: An Adaptive Partitioning Operator for Continuous Query Systems. In ICDE, pages 25-36, 2003.
    • (2003) ICDE , pp. 25-36
    • Shah, M.A.1    Hellerstein, J.M.2    Chandrasekaran, S.3    Franklin, M.J.4
  • 15
    • 0032093705 scopus 로고    scopus 로고
    • Cost based query scrambling for initial delays
    • Tolga Urhan, Michael J. Franklin, and Laurent Amsaleg. Cost Based Query Scrambling for Initial Delays. In SIGMOD Conference, pages 130-141, 1998.
    • (1998) SIGMOD Conference , pp. 130-141
    • Urhan, T.1    Franklin, M.J.2    Amsaleg, L.3
  • 16
    • 0027206285 scopus 로고
    • Dataflow query execution in a parallel main-memory environment
    • A. N. Wilschut and P. M. G. Apers. Dataflow Query Execution in a Parallel Main-memory Environment. Distributed and Parallel Databases, 1(1):103-128, 1993.
    • (1993) Distributed and Parallel Databases , vol.1 , Issue.1 , pp. 103-128
    • Wilschut, A.N.1    Apers, P.M.G.2


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