Deterministic K-Set Structure

Summary: Deterministic k-set algorithm for insertion-deletion streams that outputs the exact (item,frequency) set when distinct items ≤ k and nil otherwise. Space matches the information-theoretic lower bound up to a logarithmic factor, yielding a deterministic near-optimal structure. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 1399
Venue: PODS
Year: 2006
Pagerank: 5.093636e-05
Overall Rank: 12,683 | 12.99%
DOI: 10.1145/1142351.1142392

Incoming Non-self Citations Over Time

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

Authors

1. Sumit Ganguly (Indian Institute of Technology Kanpur)
2. Anirban Majumder (Indian Institute of Technology Kanpur)

BibTeX Citation

@inproceedings{ganguly_pods06,
        address = {New York, NY, USA},
        series = {{PODS} '06},
        title = {{Deterministic K-Set Structure}},
        url = {https://dl.acm.org/doi/10.1145/1142351.1142392},
        doi = {10.1145/1142351.1142392},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ganguly, Sumit and Majumder, Anirban},
        year = {2006}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
838	What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically	2003	PODS	0.0001370404

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	885	Finding Frequent Items in Data Streams	2008	VLDB
2	122	Approximate Frequency Counts over Data Streams	2002	VLDB
3	11,528	Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size	2022	PODS
4	482	An Optimal Algorithm for the Distinct Elements Problem	2010	PODS
5	12,034	Streaming Algorithms for Robust Distinct Elements	2016	SIGMOD
6	2,808	A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows	2006	PODS
7	8,106	SpaceSaving±: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model	2022	VLDB
8	5,669	Data Streams with Bounded Deletions	2018	PODS
9	11,638	Frequent Elements with Witnesses in Data Streams	2021	PODS
10	2,716	Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over Data Streams	2006	PODS