메뉴 건너뛰기




Volumn , Issue , 2008, Pages 754-763

Flow algorithms for parallel query optimization

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SERVICES; OPTIMIZATION; QUERY PROCESSING; RESPONSE TIME (COMPUTER SYSTEMS); TECHNOLOGY;

EID: 52649111582     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497484     Document Type: Conference Paper
Times cited : (19)

References (24)
  • 1
    • 0020496929 scopus 로고
    • Optimization algorithms for distributed queries
    • P. Apers, A. Hevner, and S. Yao. Optimization algorithms for distributed queries, IEEE Trans. Software Eng., 9(1), 1983.
    • (1983) IEEE Trans. Software Eng , vol.9 , Issue.1
    • Apers, P.1    Hevner, A.2    Yao, S.3
  • 2
    • 0039253775 scopus 로고    scopus 로고
    • Eddies: Continuously adaptive query processing
    • Ron Avnur and Joe Hellerstein. Eddies: Continuously adaptive query processing. In SIGMOD, 2000.
    • (2000) SIGMOD
    • Avnur, R.1    Hellerstein, J.2
  • 3
    • 0029183528 scopus 로고
    • Scheduling problems in parallel query optimization
    • C. Chekuri, W. Hasan, and R. Motwani. Scheduling problems in parallel query optimization. In PODS, 1995.
    • (1995) PODS
    • Chekuri, C.1    Hasan, W.2    Motwani, R.3
  • 4
    • 34250677320 scopus 로고    scopus 로고
    • Flow algorithms for two pipelined filter ordering problems
    • A. Condon, A. Deshpande, L. Hellerstein, and N. Wu. Flow algorithms for two pipelined filter ordering problems. In PODS, 2006.
    • (2006) PODS
    • Condon, A.1    Deshpande, A.2    Hellerstein, L.3    Wu, N.4
  • 6
    • 28444450448 scopus 로고    scopus 로고
    • Exploiting correlated attributes in acquisitional query processing
    • A. Deshpande, C. Guestrin, W. Hong, and S. Madden. Exploiting correlated attributes in acquisitional query processing, In ICDE, 2005.
    • (2005) ICDE
    • Deshpande, A.1    Guestrin, C.2    Hong, W.3    Madden, S.4
  • 7
    • 52649123553 scopus 로고    scopus 로고
    • Flow algorithms for parallel query optimization
    • Technical Report CS-TR-4873, Univ of Maryland
    • A. Deshpande and L. Hellerstein. Flow algorithms for parallel query optimization, Technical Report CS-TR-4873, Univ of Maryland, 2007.
    • (2007)
    • Deshpande, A.1    Hellerstein, L.2
  • 8
    • 0026870271 scopus 로고
    • Parallel database systems: The future of high performance database systems
    • D. DeWitt and J. Gray. Parallel database systems: the future of high performance database systems. CACM, 35(6), 1992.
    • (1992) CACM , vol.35 , Issue.6
    • DeWitt, D.1    Gray, J.2
  • 12
    • 0030157404 scopus 로고    scopus 로고
    • Multi-dimensional resource scheduling for parallel queries
    • M. Garofalakis and Y. Ioannidis, Multi-dimensional resource scheduling for parallel queries. In SIGMOD, 1996.
    • (1996) SIGMOD
    • Garofalakis, M.1    Ioannidis, Y.2
  • 13
    • 84994176242 scopus 로고    scopus 로고
    • Parallel query scheduling and optimization with time- and space-shared resources
    • M. Garofalakis and Y. Ioannidis, Parallel query scheduling and optimization with time- and space-shared resources. In VLDB, 1997.
    • (1997) VLDB
    • Garofalakis, M.1    Ioannidis, Y.2
  • 14
    • 0025444574 scopus 로고
    • Encapsulation of parallelism in the volcano query processing system
    • Goetz Graefe. Encapsulation of parallelism in the volcano query processing system. In SIGMOD, 1990.
    • (1990) SIGMOD
    • Graefe, G.1
  • 16
    • 0001556674 scopus 로고
    • Coloring away communication in parallel query optimization
    • W. Hasan and R. Motwani. Coloring away communication in parallel query optimization, In VLDB, 1995.
    • (1995) VLDB
    • Hasan, W.1    Motwani, R.2
  • 17
    • 0008753168 scopus 로고
    • Optimization of parallel query execution plans in xprs
    • Wei Hong and Michael Stonebraker. Optimization of parallel query execution plans in xprs. In PDIS, 1991.
    • (1991) PDIS
    • Hong, W.1    Stonebraker, M.2
  • 18
    • 0021497828 scopus 로고
    • On the optimal nesting order for computing n-relational joins
    • T. Ibaraki and T. Kameda. On the optimal nesting order for computing n-relational joins. ACM Trans. Database Syst., 9(3):482-502, 1984.
    • (1984) ACM Trans. Database Syst , vol.9 , Issue.3 , pp. 482-502
    • Ibaraki, T.1    Kameda, T.2
  • 20
    • 33745284682 scopus 로고    scopus 로고
    • Revisiting pipelined parallelism in multi-join query processing
    • Bin Liu and Elke A. Rundensteiner. Revisiting pipelined parallelism in multi-join query processing. In VLDB, 2005.
    • (2005) VLDB
    • Liu, B.1    Rundensteiner, E.A.2
  • 22
    • 77957862745 scopus 로고    scopus 로고
    • Tuple routing strategies for distributed eddies
    • Feng Tian and David J. DeWitt. Tuple routing strategies for distributed eddies. In VLDB, 2003.
    • (2003) VLDB
    • Tian, F.1    DeWitt, D.J.2
  • 23
    • 85012170387 scopus 로고    scopus 로고
    • Maximizing the output rate of multi-way join queries over streaming information sources
    • S. Viglas, J. Naughton, and J. Burger. Maximizing the output rate of multi-way join queries over streaming information sources, In VLDB, 2003.
    • (2003) VLDB
    • Viglas, S.1    Naughton, J.2    Burger, J.3


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