Database Paper Browser

Back to papers

Towards Better Bounds for Finding Quasi-Identifiers *

Summary: Improves bounds for epsilon-separation keys (quasi-identifiers): Θ(m/√ε) uniform-sampling suffices, beating Motwani–Xu’s Θ(m/ε) baseline and speeding discovery. Provides tight uniform-sampling limits and sketching costs: strong failure requires Θ(√(m/ε)) samples; constant δ needs Ω(√(log m/ε)); coordinate-sketching uses Ω(mk log(1/ε)) space, vs Θ(mk/(αε^2)) with sampling. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1887
Venue
PODS
Year
2023
Pagerank
4.1945683e-05
Overall Rank
11,162 | 22.35%
DOI
10.1145/3584372.3588668

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 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
155 Robust and Efficient Fuzzy Match for Online Data Cleaning 2003 SIGMOD 0.00040637896
280 Eliminating Fuzzy Duplicates in Data Warehouses 2002 VLDB 0.00029113044
7,496 Subspace Exploration: Bounds on Projected Frequency Estimation 2021 PODS 4.7180617e-05
7,504 Space Lower Bounds for Itemset Frequency Sketches 2016 PODS 4.7180617e-05
Previous Page 1 / 1 Next

Semantically Similar Papers