Generalized Hash Teams for Join and Group-by
Summary: Proposes generalized hash teams for one-pass evaluation of multi-way joins and join+group-by, avoiding repartitioning. Indirect partitioning via bitmaps enables hashing on attributes, extending Graefe's hash teams to key-FK chains and yielding speedups in DSS. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alfons Kemper (University of Passau)
- 2. Donald Kossmann (University of Passau)
- 3. Christian Wiesner (University of Passau)
BibTeX Citation
@article{kemper_vldb99,
title = {{Generalized Hash Teams for Join and Group-by}},
author = {Kemper, Alfons and Kossmann, Donald and Wiesner, Christian},
journal = {PVLDB},
series = {{VLDB} '99},
year = {1999}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,109 | Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources | 2003 | VLDB | 0.00011949421 |
| 1,603 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 0.00010090639 |
| 5,034 | Free Join: Unifying Worst-Case Optimal and Traditional Joins | 2023 | SIGMOD | 6.2921115e-05 |
| 5,787 | Database Technology for the Masses: Sub-Operators as First-Class Entities | 2021 | VLDB | 5.9768075e-05 |
| 13,156 | Estimating the Output Cardinality of Partial Preaggregation with a Measure of Clusteredness | 2003 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 73 | Including Group-By in Query Optimization | 1994 | VLDB | 0.00037420958 |
| 83 | Hashing Methods and Relational Algebra Operations | 1984 | VLDB | 0.00035942723 |
| 106 | Quickly Generating Billion-Record Synthetic Databases | 1994 | SIGMOD | 0.00033563032 |
| 107 | Improved Query Performance with Variant Indexes | 1997 | SIGMOD | 0.00033376274 |
| 776 | Bitmap Index Design and Evaluation | 1998 | SIGMOD | 0.0001406101 |
| 1,598 | Evaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates | 1997 | VLDB | 0.00010096339 |
| 1,811 | Hash joins and hash teams in Microsoft SQL Server | 1998 | VLDB | 9.5759277e-05 |
| 6,706 | Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships | 1998 | VLDB | 5.6860841e-05 |
| 6,966 | A Signature Access Method for the Starburst Database System | 1989 | VLDB | 5.6166415e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,594 | Global Hash Tables Strike Back! An Analysis of Parallel GROUP BY Aggregation | 2026 | VLDB |
| 2 | 5,473 | Early Hash Join: A Configurable Algorithm for the Efficient and Early Production of Join Results | 2005 | VLDB |
| 3 | 360 | Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs | 2011 | SIGMOD |
| 4 | 2,515 | Hash-Based Join Algorithms for Multiprocessor Computers with Shared Memory | 1990 | VLDB |
| 5 | 1,808 | An Adaptive Hash Join Algorithm for Multiuser Environments | 1990 | VLDB |
| 6 | 921 | Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines | 1990 | VLDB |
| 7 | 5,169 | The 3D Hash Join: Building On Non-Unique Join Attributes | 2022 | CIDR |
| 8 | 855 | Hash-Partitioned Join Method Using Dynamic Destaging Strategy | 1988 | VLDB |
| 9 | 3,072 | Design and Evaluation of Parallel Pipelined Join Algorithms | 1987 | SIGMOD |
| 10 | 1,811 | Hash joins and hash teams in Microsoft SQL Server | 1998 | VLDB |