DBScholar

Back to papers

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)

Paper ID
7356
Venue
SIGMOD
Year
2025
Pagerank
5.2685863e-05
Overall Rank
9,439 | 35.25%
DOI
10.1145/3725406

Incoming Non-self Citations Over Time

Authors

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 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,252 GraphRTX: Lighting the Way to Scalable Graph Analytics 2026 SIGMOD 5.093636e-05
10,409 TQEx: Tensor-based Query Engine Enhanced by Bridging the Gap 2026 SIGMOD 5.093636e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers