Database Paper Browser

Back to papers

No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing

Summary: Tabulation-1Permutation hashing enables fast, reliable sampling without repetition. With equal space, it achieves high-probability bounds directly, outperforms repetition-based methods and hashes like MurmurHash3/BLAKE3 in tight error regimes, validated empirically. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12909
Venue
VLDB
Year
2022
Pagerank
4.1905499e-05
Overall Rank
11,417 | 20.66%
DOI
10.14778/3565838.3565851

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
737 On Synopses for Distinct-Value Estimation Under Multiset Operations 2007 SIGMOD 0.00017377393
1,683 Cardinality Estimation: An Experimental Survey 2018 VLDB 0.0001091276
3,930 Tighter Estimation using Bottom-k Sketches 2008 VLDB 6.6195837e-05
Previous Page 1 / 1 Next

Semantically Similar Papers