Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity

Summary: Entropy-Learned Hashing models input entropy to build data-specific hash functions, cutting unnecessary randomness extraction and computation while preserving uniform output. Evaluations on hash tables, Bloom filters, and partitioning show 3.7–14x throughput gains over best-in-class implementations. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6408
Venue: SIGMOD
Year: 2022
Pagerank: 5.3524255e-05
Overall Rank: 8,880 | 39.08%
DOI: 10.1145/3514221.3517894

Incoming Non-self Citations Over Time

Authors

1. Brian Hentschel (Harvard University)
2. Utku Sirin (Harvard University)
3. Stratos Idreos (Harvard University)

BibTeX Citation

@inproceedings{hentschel_sigmod22,
        title = {{Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity}},
        author = {Hentschel, Brian and Sirin, Utku and Idreos, Stratos},
        series = {{SIGMOD} '22},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3514221.3517894},
        url = {https://dl.acm.org/doi/10.1145/3514221.3517894},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,025	VIP Hashing - Adapting to Skew in Popularity of Data on the Fly	2022	VLDB	5.1757914e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
43	The Case for Learned Index Structures	2018	SIGMOD	0.00046060254
252	Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited	2014	VLDB	0.00023242719
446	Monkey: Optimal Navigable Key-Value Store	2017	SIGMOD	0.00018332392
831	Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging	2018	SIGMOD	0.00013748512
1,177	A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort	2014	SIGMOD	0.00011808761
1,278	A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing	2016	VLDB	0.00011362007
1,954	Chucky: A Succinct Cuckoo Filter for LSM-Tree	2021	SIGMOD	9.4208165e-05
2,202	Quantifying TPC-H Choke Points and Their Optimizations	2020	VLDB	8.9639459e-05
2,649	Asynchronous Memory Access Chaining	2016	VLDB	8.2926258e-05
3,510	Performance-Optimal Filtering: Bloom Overtakes Cuckoo at High Throughput	2019	VLDB	7.3561488e-05
4,532	Stacked Filters: Learning to Filter by Structure	2021	VLDB	6.6436681e-05
4,993	Key-Value Storage Engines	2020	SIGMOD	6.4096682e-05
7,991	Micro-architectural Analysis of OLAP: Limitations and Opportunities	2020	VLDB	5.5107319e-05
8,995	Hashing in Practice, Analysis of Hashing and Universal Hashing	1988	SIGMOD	5.336928e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,995	Hashing in Practice, Analysis of Hashing and Universal Hashing	1988	SIGMOD
2	2,801	Concurrency and Linear Hashing	1985	PODS
3	9,084	Sketching via Hashing: From Heavy Hitters to Compressive Sensing to Sparse Fourier Transform	2013	PODS
4	6,583	Distance-Sensitive Hashing	2018	PODS
5	11,572	New Wine in an Old Bottle: Data-Aware Hash Functions for Bloom Filters	2022	VLDB
6	4,927	Neighbor-Sensitive Hashing	2016	VLDB
7	10,255	HotHash: Hotness-Aware Consistent Hashing for Cloud Databases	2026	SIGMOD
8	10,624	Learned Static Function Data Structures	2026	VLDB
9	1,278	A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing	2016	VLDB
10	4,780	Can Learned Models Replace Hash Functions?	2023	VLDB