메뉴 건너뛰기




Volumn 20, Issue , 2004, Pages 116-127

Improving Hash join performance through prefetching

Author keywords

[No Author keywords available]

Indexed keywords

CENTRAL PROCESSING UNIT (CPU); DATA DEPENDENCIES; HASH JOIN ALGORITHMS; RANDOM ACCESS PATTERNS;

EID: 2442618099     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2004.1319989     Document Type: Conference Paper
Times cited : (83)

References (30)
  • 1
    • 0000695168 scopus 로고    scopus 로고
    • DBMSs on a modern processor: Where does time go?
    • Sept.
    • A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. DBMSs on a Modern Processor: Where Does Time Go? In the 25th VLDB, pages 266-277, Sept. 1999.
    • (1999) 25th VLDB , pp. 266-277
    • Ailamaki, A.1    Dewitt, D.J.2    Hill, M.D.3    Wood, D.A.4
  • 2
    • 0026267802 scopus 로고
    • An effective on-chip preloading scheme to reduce data access penalty
    • J.-L. Baer and T.-F. Chen. An effective on-chip preloading scheme to reduce data access penalty. In Proceedings of Supercomputing '91, 1991.
    • (1991) Proceedings of Supercomputing '91
    • Baer, J.-L.1    Chen, T.-F.2
  • 3
    • 0031594023 scopus 로고    scopus 로고
    • Memory system characterization of commercial workloads
    • June
    • L. A. Barroso, K. Gharachorloo, and E. D. Bugnion. Memory System Characterization of Commercial Workloads. In the 25th ISCA, pages 3-14, June 1998.
    • (1998) 25th ISCA , pp. 3-14
    • Barroso, L.A.1    Gharachorloo, K.2    Bugnion, E.D.3
  • 4
    • 0039193666 scopus 로고    scopus 로고
    • Improving main-memory index performance with partial key information
    • May
    • P. Bohannon, P. McIlroy, and R. Rastogi. Improving Main-Memory Index Performance with Partial Key Information. In the SIGMOD Conference, May 2001.
    • (2001) SIGMOD Conference
    • Bohannon, P.1    McIlroy, P.2    Rastogi, R.3
  • 5
    • 0003075199 scopus 로고    scopus 로고
    • Database architecture optimized for the new bottleneck: Memory access
    • Sept.
    • P. A. Boncz, S. Manegold, and M. Kersten. Database Architecture Optimized for the New Bottleneck: Memory Access. In the 25th VLDB, pages 54-65, Sept. 1999.
    • (1999) 25th VLDB , pp. 54-65
    • Boncz, P.A.1    Manegold, S.2    Kersten, M.3
  • 6
    • 26144451124 scopus 로고    scopus 로고
    • Improving hash join performance through prefetching
    • School of Computer Science, Carnegie Mellon University, Oct.
    • S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry. Improving Hash Join Performance through Prefetching. Technical Report CMU-CS-03-157, School of Computer Science, Carnegie Mellon University, Oct. 2003.
    • (2003) Technical Report , vol.CMU-CS-03-157
    • Chen, S.1    Ailamaki, A.2    Gibbons, P.B.3    Mowry, T.C.4
  • 7
    • 0038969985 scopus 로고    scopus 로고
    • Improving index performance through prefetching
    • May
    • S. Chen, P. B. Gibbons, and T. C. Mowry. Improving Index Performance through Prefetching. In the SIGMOD Conference, pages 235-246, May 2001.
    • (2001) SIGMOD Conference , pp. 235-246
    • Chen, S.1    Gibbons, P.B.2    Mowry, T.C.3
  • 9
    • 0033716466 scopus 로고    scopus 로고
    • Performance analysis of the alpha 21264-based compaq ES40 system
    • June
    • Z. Cvetanovic and R. E. Kessler. Performance Analysis of the Alpha 21264-Based Compaq ES40 System. In the 27th ISCA, pages 192-202, June 2000.
    • (2000) 27th ISCA , pp. 192-202
    • Cvetanovic, Z.1    Kessler, R.E.2
  • 11
    • 0027608375 scopus 로고
    • Query evaluation techniques for large databases
    • G. Graefe. Query Evaluation Techniques for Large Databases. ACM Computing Surveys, 25(2):73-170, 1993.
    • (1993) ACM Computing Surveys , vol.25 , Issue.2 , pp. 73-170
    • Graefe, G.1
  • 13
    • 0031594019 scopus 로고    scopus 로고
    • Performance characterization of a quad pentium Pro SMP using OLTP workloads
    • June
    • K. Keeton, D. A. Patterson, Y. Q. He, R. C. Raphael, and W. E. Baker. Performance Characterization of a Quad Pentium Pro SMP using OLTP Workloads. In the 25th ISCA, pages 15-26, June 1998.
    • (1998) 25th ISCA , pp. 15-26
    • Keeton, K.1    Patterson, D.A.2    He, Y.Q.3    Raphael, R.C.4    Baker, W.E.5
  • 14
    • 0025550566 scopus 로고    scopus 로고
    • Loop distribution with arbitrary control flow
    • K. Kennedy and K. McKinley. Loop Distribution With Arbitrary Control Flow. In Supercomputing'90, pages 407-416.
    • Supercomputing'90 , pp. 407-416
    • Kennedy, K.1    McKinley, K.2
  • 15
    • 65749311706 scopus 로고
    • Application of hash to data base machine and its architecture
    • M. Kitsuregawa, H. Tanaka, and T. Moto-Oka. Application of Hash to Data Base Machine and its Architecture. New Generation Computing, 1(1):63-74, 1983.
    • (1983) New Generation Computing , vol.1 , Issue.1 , pp. 63-74
    • Kitsuregawa, M.1    Tanaka, H.2    Moto-Oka, T.3
  • 17
    • 2442613728 scopus 로고    scopus 로고
    • Hash joins in DB2 UDB: The inside story
    • Mar
    • B. Lindsay. Hash Joins in DB2 UDB: the Inside Story. Carnegie Mellon DB Seminar, Mar 2002.
    • (2002) Carnegie Mellon DB Seminar
    • Lindsay, B.1
  • 18
    • 0030259355 scopus 로고    scopus 로고
    • Compiler-based prefetching for recursive data structures
    • Oct.
    • C.-K. Luk and T. C. Mowry, Compiler-Based Prefetching for Recursive Data Structures. In the 7th ASPLOS, pages 222-233, Oct. 1996.
    • (1996) 7th ASPLOS , pp. 222-233
    • Luk, C.-K.1    Mowry, T.C.2
  • 19
    • 0033075284 scopus 로고    scopus 로고
    • Automatic compiler-inserted prefetching for pointer-based applications
    • Feb.
    • C.-K. Luk and T. C. Mowry. Automatic Compiler-Inserted Prefetching for Pointer-Based Applications. IEEE Transactions on Computers, 48(2):134-141, Feb. 1999.
    • (1999) IEEE Transactions on Computers , vol.48 , Issue.2 , pp. 134-141
    • Luk, C.-K.1    Mowry, T.C.2
  • 20
    • 0001146294 scopus 로고    scopus 로고
    • What happens during a join? Dissecting CPU and memory optimization effects
    • Sept.
    • S. Manegold, P. A. Boncz, and M. L. Kersten. What Happens During a Join? Dissecting CPU and Memory Optimization Effects. In the 26th VLDB, Sept. 2000.
    • (2000) 26th VLDB
    • Manegold, S.1    Boncz, P.A.2    Kersten, M.L.3
  • 21
    • 0003506711 scopus 로고
    • Combining branch predictors
    • Digital Equipment Corporation, June
    • S. McFarling. Combining Branch Predictors. Technical Report WRL Technical Note TN-36, Digital Equipment Corporation, June 1993.
    • (1993) Technical Report WRL Technical Note , vol.TN-36
    • McFarling, S.1
  • 23
    • 0026918402 scopus 로고
    • Design and evaluation of a compiler algorithm for prefetching
    • Oct.
    • T. C. Mowry, M. S. Lam, and A. Gupta. Design and Evaluation of a Compiler Algorithm for Prefetching. In the 5th ASPLOS, pages 62-73, Oct. 1992.
    • (1992) 5th ASPLOS , pp. 62-73
    • Mowry, T.C.1    Lam, M.S.2    Gupta, A.3
  • 24
    • 0006754799 scopus 로고
    • Hash-partitioned join method using dynamic destaging strategy
    • Aug.
    • M. Nakayama, M. Kitsuregawa, and M. Takagi. Hash-Partitioned Join Method Using Dynamic Destaging Strategy. In the 14th VLDB, pages 468-478, Aug. 1988.
    • (1988) 14th VLDB , pp. 468-478
    • Nakayama, M.1    Kitsuregawa, M.2    Takagi, M.3
  • 26
    • 0039785294 scopus 로고    scopus 로고
    • +-trees cache conscious in main memory
    • May
    • +-Trees Cache Conscious in Main Memory. In the SIGMOD Conference, pages 475-486, May 2000.
    • (2000) SIGMOD Conference , pp. 475-486
    • Rao, J.1    Ross, K.A.2
  • 28
    • 84976660052 scopus 로고
    • Join processing in database systems with large main memories
    • L. D. Shapiro. Join Processing in Database Systems with Large Main Memories. TODS, 11(3):239-264, 1986.
    • (1986) TODS , vol.11 , Issue.3 , pp. 239-264
    • Shapiro, L.D.1
  • 29
    • 0002725788 scopus 로고
    • Cache conscious algorithms for relational query processing
    • Sept.
    • A. Shatdal, C. Kant, and J. F. Naughton. Cache Conscious Algorithms for Relational Query Processing. In the 20th VLDB, pages 510-521, Sept. 1994.
    • (1994) 20th VLDB , pp. 510-521
    • Shatdal, A.1    Kant, C.2    Naughton, J.F.3
  • 30
    • 0042908314 scopus 로고
    • An adaptive hash join algorithm for multiuser environments
    • Aug.
    • H. Zeller and J. Gray. An Adaptive Hash Join Algorithm for Multiuser Environments. In the 16th VLDB, pages 186-197, Aug. 1990.
    • (1990) 16th VLDB , pp. 186-197
    • Zeller, H.1    Gray, J.2


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