Database Paper Browser

Back to papers

Subspace Exploration: Bounds on Projected Frequency Estimation

Summary: Characterizes space for frequency/norm/heavy-hitter estimation under unknown column projections of n×d data, proving 2^Ω(d) lower bounds when subspaces are revealed post-data. Gives coding-theory constructions and combinatorial reductions achieving N^{c'}-approx in min(N^{c'},n) space, improving on naive 2^d. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1807
Venue
PODS
Year
2021
Pagerank
4.7180617e-05
Overall Rank
7,496 | 47.86%
DOI
10.1145/3452021.3458312

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
11,162 Towards Better Bounds for Finding Quasi-Identifiers * 2023 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
383 An Optimal Algorithm for the Distinct Elements Problem 2010 PODS 0.00024820873
2,884 BPTree: an ℓ2 Heavy Hitters Algorithm Using Constant Memory 2017 PODS 7.9620506e-05
Previous Page 1 / 1 Next

Semantically Similar Papers