Memory efficient hash joins

Proceedings of the VLDB Endowment

Volumn 8, Issue 4, 2014, Pages 353-364

  Barber, R ^a   Lohman, G ^a   Pandis, I ^a   Raman, V ^a   Sidle, R ^a   Attaluri, G ^b   Chainani, N ^b   Lightstone, S ^b   Sharpe, D ^b  

^a IBM RESEARCH   (United States)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

BIT MAPS; BLOOM FILTERS; COLLISION AVOID; COLLISION-FREE; FILL-FACTOR; HASH JOIN; HASH TABLE; LINEAR PROBING; MEMORY EFFICIENT; RANDOM ACCESS;

PROBES;

EID: 84938816922     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2735496.2735499     Document Type: Conference Paper

References (21)

1. Full experimental results. http://researcher.ibm.com/person/us-rafijay.
2. Understanding hash joins. Microsoft TechNet SQL Server.
3. D. J. Abadi, D. S. Myers, D. J. DeWitt, and S. R. Madden. Materialization strategies in a column-oriented DBMS. In ICDE, 2007.
4. M.-C. Albutiu, A. Kemper, and T. Neumann. Massively parallel sort-merge joins in main memory multi-core database systems. PVLDB, 5(10), 2012.
5. C. Balkesen, G. Alonso, J. Teubner, and T. Özsu. Multi-core, main-memory joins: Sort vs. hash revisited. PVLDB, 2014.
6. C. Balkesen, J. Teubner, G. Alonso, and T. Özsu. Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware. In ICDE, 2013.
7. S. K. Begley, Z. He, and Y.-P. P. Chen. Mcjoin: A memory-constrained join for column-store main-memory databases. In SIGMOD, 2012.
8. S. Blanas, Y. Li, and J. M. Patel. Design and evaluation of main memory hash join algorithms for multi-core cpus. In SIGMOD, 2011.
9. S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry. Improving hash join performance through prefetching. ACM Trans. Database Syst., 32(3), 2007.
10. D. J. DeWitt et al. Implementation techniques for main memory database systems. In SIGMOD, 1984.
11. C. Kim et al. Sort vs. hash revisited: Fast join implementation on modern multi-core CPUs. PLVDB, 2(2), 2009.
12. M. Kitsuregawa, H. Tanaka, and T. Moto-Oka. Application of hash to data base machine and its architecture. New Generation Computing, 1(1), 1983.
13. H. Lang et al. Massively parallel NUMA-aware hash joins. In IMDM, 2013.
14. V. Leis et al. Morsel-driven parallelism: A NUMA-aware query evaluation framework for the many-core age. In SIGMOD, 2014.
15. Y. Li et al. NUMA-aware algorithms: the case of data shuffling. In CIDR, 2013.
16. L. F. Mackert and G. M. Lohman. R* Optimizer Validation and Performance Evaluation for Distributed Queries. In VLDB, 1986.
17. S. Manegold, P. Boncz, and M. Kersten. Optimizing database architecture for the new bottleneck: memory access. VLDB Journal, 9(3), 2000.
18. S. Manegold, P. A. Boncz, and M. L. Kersten. What happens during a join? Dissecting CPU and memory optimization effects. In VLDB, 2000.
19. R. Pagh and F. F. Rodler. Cuckoo hashing. In ESA, 2001.
20. V. Raman et al. DB2 with BLU Acceleration: So much more than just a column store. PVLDB, 6, 2013.
21. K. A. Ross. Efficient hash probes on modern processors. In ICDE, 2007.