DBScholar

Back to papers

Is Perfect Hashing Practical for OLAP Systems?

Summary: Empirical guide to using perfect hash functions (PHFs) in OLAP: surveys applications/implementations and measures their impact on real queries. Shows PHFs give end-to-end 1.7× join and 3.1× aggregate speedups but expose build-time vs probe-throughput trade-offs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
524
Venue
CIDR
Year
2024
Pagerank
5.6544795e-05
Overall Rank
7,287 | 50.01%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gaffney_cidr24,
        address = {Amsterdam, Netherlands},
        series = {{CIDR} '24},
        title = {{Is Perfect Hashing Practical for OLAP Systems?}},
        booktitle = {Proceedings of the {Conference} on {Innovative} {Data} {Systems} {Research}},
        author = {Gaffney, Kevin P. and Patel, Jignesh M.},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 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