GPH: An Efficient and Effective Perfect Hashing Scheme for GPU Architectures
Summary: GPH is a GPU-based perfect-hashing hash table guaranteeing a single bucket probe per lookup, with a micro-benchmark and analytic model for uniform performance evaluation. It exploits vectorization and ILP for global-memory efficiency and adds an insert kernel for dynamic updates; achieves about 8500 MOPS on synthetic and real workloads. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jiaping Cao (Hong Kong Polytechnic University; Southern University of Science and Technology)
- 2. Le Xu (Hong Kong Polytechnic University; Southern University of Science and Technology)
- 3. Man Lung Yiu (Hong Kong Polytechnic University)
- 4. Jianbin Qin (Shenzhen University)
- 5. Bo Tang (Southern University of Science and Technology)
BibTeX Citation
@inproceedings{cao_sigmod25,
title = {{GPH: An Efficient and Effective Perfect Hashing Scheme for GPU Architectures}},
author = {Cao, Jiaping and Xu, Le and Yiu, Man Lung and Qin, Jianbin and Tang, Bo},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3725406},
url = {https://dl.acm.org/doi/10.1145/3725406},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,465 | GraphRTX: Lighting the Way to Scalable Graph Analytics | 2026 | SIGMOD | 4.9793485e-05 |
| 10,601 | TQEx: Tensor-based Query Engine Enhanced by Bridging the Gap | 2026 | SIGMOD | 4.9793485e-05 |
| 10,871 | Efficient GPU-Accelerated Adaptive Minimum Cost Seed Selection | 2026 | VLDB | 4.9793485e-05 |
| 10,882 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 251 | Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited | 2014 | VLDB | 0.00023143736 |
| 616 | Relational Joins on Graphics Processors | 2008 | SIGMOD | 0.00015561564 |
| 1,268 | A Study of the Fundamental Performance Characteristics of GPUs and CPUs for Database Analytics | 2020 | SIGMOD | 0.0001126007 |
| 2,202 | Mega-KV: A Case for GPUs to Maximize the Throughput of In-Memory Key-Value Stores | 2015 | VLDB | 8.8719608e-05 |
| 3,689 | RTIndex: Exploiting Hardware-Accelerated GPU Raytracing for Database Indexing | 2023 | VLDB | 7.0943075e-05 |
| 4,762 | TAOBench: An End-to-End Benchmark for Social Network Workloads | 2022 | VLDB | 6.4297943e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,454 | Fast Computation of Database Operations using Graphics Processors | 2004 | SIGMOD |
| 2 | 10,482 | Meep Hashing: Ultrafast and Compact Minimal Perfect Hashing for Practical Large-Scale Lookup Systems | 2026 | SIGMOD |
| 3 | 7,416 | Is Perfect Hashing Practical for OLAP Systems? | 2024 | CIDR |
| 4 | 11,567 | Accelerating Merkle Patricia Trie with GPU | 2024 | VLDB |
| 5 | 2,122 | Revisiting Co-Processing for Hash Joins on the Coupled CPU-GPU Architecture | 2013 | VLDB |
| 6 | 616 | Relational Joins on Graphics Processors | 2008 | SIGMOD |
| 7 | 7,814 | Analyzing Vectorized Hash Tables Across CPU Architectures | 2023 | VLDB |
| 8 | 6,151 | Efficiently Processing Joins and Grouped Aggregations on GPUs | 2025 | SIGMOD |
| 9 | 9,957 | Towards Sufficient GPU-accelerated Dynamic Graph Management: Survey and Experiment | 2025 | VLDB |
| 10 | 10,882 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB |