메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 841-852

Early hash join: A configurable algorithm for the efficient and early production of join results

Author keywords

[No Author keywords available]

Indexed keywords

HASH-BASED JOIN ALGORITHM; INTERACTIVE QUERYING; ONE-TO-MANY JOINS;

EID: 33745609297     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (42)

References (24)
  • 1
    • 33745633517 scopus 로고    scopus 로고
    • Reducing the braking distance of an SQL query engine
    • M. J. Carey and D. Kossmann. Reducing the Braking Distance of an SQL Query Engine. In VLDB, pages 158-169, 1998.
    • (1998) VLDB , pp. 158-169
    • Carey, M.J.1    Kossmann, D.2
  • 2
    • 0042418190 scopus 로고    scopus 로고
    • Streaming queries over streaming data
    • S. Chandrasekaran and M. J. Franklin. Streaming Queries over Streaming Data. In VLDB 2002, pages 203-214, 2002.
    • (2002) VLDB 2002 , pp. 203-214
    • Chandrasekaran, S.1    Franklin, M.J.2
  • 5
    • 33745594213 scopus 로고
    • Dynamic memory hybrid hash join
    • University of Wisconsin
    • D. DeWitt and J. Naughton. Dynamic Memory Hybrid Hash Join. Technical report, University of Wisconsin, 1995.
    • (1995) Technical Report
    • DeWitt, D.1    Naughton, J.2
  • 7
    • 29844443461 scopus 로고    scopus 로고
    • Progressive merge join: A generic and non-blocking sort-based join algorithm
    • J.-P. Dittrich, B. Seeger, D. Taylor, and P. Widmayer. Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm. In VLDB 2002, pages 299-310, 2002.
    • (2002) VLDB 2002 , pp. 299-310
    • Dittrich, J.-P.1    Seeger, B.2    Taylor, D.3    Widmayer, P.4
  • 8
    • 0346501106 scopus 로고    scopus 로고
    • Ripple joins for online aggregation
    • P. J. Haas and J. M. Hellerstein. Ripple joins for online aggregation. In SIGMOD 1999, pages 287-298, 1999.
    • (1999) SIGMOD 1999 , pp. 287-298
    • Haas, P.J.1    Hellerstein, J.M.2
  • 9
    • 0027224684 scopus 로고
    • Optimization of parallel query execution plans in XPRS
    • W. Hong and M. Stonebraker. Optimization of Parallel Query Execution Plans in XPRS. Distributed and Parallel Databases, 1(1):9-32, 1993.
    • (1993) Distributed and Parallel Databases , vol.1 , Issue.1 , pp. 9-32
    • Hong, W.1    Stonebraker, M.2
  • 10
    • 85012120419 scopus 로고    scopus 로고
    • Supporting top-k join queries in relational databases
    • I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting Top-k Join Queries in Relational Databases. In VLDB, pages 754-765, 2003.
    • (2003) VLDB , pp. 754-765
    • Ilyas, I.F.1    Aref, W.G.2    Elmagarmid, A.K.3
  • 12
    • 3142776431 scopus 로고    scopus 로고
    • Online maintenance of very large random samples
    • C. Jermaine, A. Pol, and S. Arumugam. Online maintenance of very large random samples. In SIGMOD, pages 299-310, 2004.
    • (2004) SIGMOD , pp. 299-310
    • Jermaine, C.1    Pol, A.2    Arumugam, S.3
  • 13
    • 85136066067 scopus 로고    scopus 로고
    • GridDB: A data-centric overlay for scientifi c grids
    • D. T. Liu and M. J. Franklin. GridDB: A Data-Centric Overlay for Scientifi c Grids. In VLDB, pages 600-611, 2004.
    • (2004) VLDB , pp. 600-611
    • Liu, D.T.1    Franklin, M.J.2
  • 14
  • 15
    • 3142710246 scopus 로고    scopus 로고
    • Toward a progress indicator for database queries
    • G. Luo, J. F. Naughton, C. Ellmann, and M. Watzke. Toward a progress indicator for database queries. In SIGMOD, pages 791-802, 2004.
    • (2004) SIGMOD , pp. 791-802
    • Luo, G.1    Naughton, J.F.2    Ellmann, C.3    Watzke, M.4
  • 16
    • 2442582306 scopus 로고    scopus 로고
    • Hash-merge join: A non-blocking join algorithm for producing fast and early join results
    • M. Mokbel, M. Lu, and W. Aref. Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results. In ICDE 2004, pages 251-263, 2004.
    • (2004) ICDE 2004 , pp. 251-263
    • Mokbel, M.1    Lu, M.2    Aref, W.3
  • 17
    • 0006754799 scopus 로고
    • Hash-partitioned join method using dynamic destaging strategy
    • M. Nakayama, M. Kitsuregawa, and M. Takagi. Hash-partitioned join method using dynamic destaging strategy. In VLDB 1988, pages 468-478, 1988.
    • (1988) VLDB 1988 , pp. 468-478
    • Nakayama, M.1    Kitsuregawa, M.2    Takagi, M.3
  • 18
    • 0344343634 scopus 로고    scopus 로고
    • Online dynamic reordering for interactive data processing
    • V. Raman, B. Raman, and J. M. Hellerstein. Online Dynamic Reordering for Interactive Data Processing. In VLDB 1999, pages 709-720, 1999.
    • (1999) VLDB 1999 , pp. 709-720
    • Raman, V.1    Raman, B.2    Hellerstein, J.M.3
  • 19
    • 79956142591 scopus 로고    scopus 로고
    • Lachesis: Robust database storage management based on device-specific performance characteristics
    • J. Schindler, A. Ailamaki, and G. R. Ganger. Lachesis: Robust Database Storage Management Based on Device-specific Performance Characteristics. In VLDB, pages 706-717, 2003.
    • (2003) VLDB , pp. 706-717
    • Schindler, J.1    Ailamaki, A.2    Ganger, G.R.3
  • 20
    • 0002520588 scopus 로고    scopus 로고
    • XJoin: A reactively scheduled pipelined join operator
    • T. Urban and M. Franklin. XJoin: A Reactively Scheduled Pipelined Join Operator. IEEE Data Engineering Bulletin, 23(2):7-18, 2000.
    • (2000) IEEE Data Engineering Bulletin , vol.23 , Issue.2 , pp. 7-18
    • Urban, T.1    Franklin, M.2
  • 21
    • 0032093705 scopus 로고    scopus 로고
    • Cost based query scrambling for initial delays
    • T. Urban, M. J. Franklin, and L. Amsaleg. Cost based query scrambling for initial delays. In SIGMOD, pages 130-141, 1998.
    • (1998) SIGMOD , pp. 130-141
    • Urban, T.1    Franklin, M.J.2    Amsaleg, L.3
  • 22
    • 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, pages 285-296, 2003.
    • (2003) VLDB 2003 , pp. 285-296
    • Viglas, S.1    Naughton, J.2    Burger, J.3
  • 23
    • 0036366397 scopus 로고    scopus 로고
    • Rate-based query optimization for streaming information sources
    • S. D. Viglas and J. F. Naughton. Rate-based query optimization for streaming information sources. In SIGMOD, pages 37-48, 2002.
    • (2002) SIGMOD , pp. 37-48
    • Viglas, S.D.1    Naughton, J.F.2
  • 24
    • 0002038363 scopus 로고
    • Datafbw query execution in a parallel main-memory environment
    • A. N. Wilschut and P. M. G. Apers. Datafbw Query Execution in a Parallel Main-Memory Environment. In PDIS, pages 68-77, 1991.
    • (1991) PDIS , pp. 68-77
    • Wilschut, A.N.1    Apers, P.M.G.2


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