Privacy Preservation of Aggregates in Hidden Databases: Why and How?

Summary: Hidden databases with form-like interfaces; protecting sensitive aggregates from leakage through individual tuple results. Techniques to thwart bot sampling to infer aggregates; theoretical analysis plus extensive experiments demonstrate effectiveness. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4178
Venue: SIGMOD
Year: 2009
Pagerank: 5.093636e-05
Overall Rank: 12,495 | 14.28%
DOI: 10.1145/1559845.1559863

Incoming Non-self Citations Over Time

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

Authors

1. Arjun Dasgupta (University of Texas)
2. Nan Zhang (George Washington University)
3. Gautam Das (University of Texas)
4. Surajit Chaudhuri (Microsoft)

BibTeX Citation

@inproceedings{dasgupta_sigmod09,
        title = {{Privacy Preservation of Aggregates in Hidden Databases: Why and How?}},
        author = {Dasgupta, Arjun and Zhang, Nan and Das, Gautam and Chaudhuri, Surajit},
        series = {{SIGMOD} '09},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1559845.1559863},
        url = {https://dl.acm.org/doi/10.1145/1559845.1559863},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,671	Unbiased Estimation of Size and Other Aggregates Over Hidden Web Databases	2010	SIGMOD	5.3876663e-05
12,309	Aggregate Suppression for Enterprise Search Engines	2012	SIGMOD	5.093636e-05
12,384	Randomized Generalization for Aggregate Suppression Over Hidden Web Databases	2011	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
70	Privacy-Preserving Data Mining	2000	SIGMOD	0.0003804755
91	WebTables: Exploring the Power of Tables on the Web	2008	VLDB	0.00034838835
827	Minimal Probing: Supporting Expensive Predicates for Top-k Queries	2002	SIGMOD	0.00013769938
1,074	Privacy Preserving OLAP	2005	SIGMOD	0.0001230007
1,483	Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection	2002	VLDB	0.00010633832
1,554	Google’s Deep-Web Crawl	2008	VLDB	0.00010372108
1,820	Information Sharing Across Private Databases	2003	SIGMOD	9.6791131e-05
2,401	Simulatable Auditing	2005	PODS	8.6299652e-05
3,296	Towards Robustness in Query Auditing	2006	VLDB	7.5459953e-05
5,868	A Random Walk Approach to Sampling Hidden Databases	2007	SIGMOD	6.0613238e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,809	Privacy in Data Systems	2003	PODS
2	3,232	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB
3	1,310	A Privacy-Preserving Index for Range Queries	2004	VLDB
4	9,001	Dynamic Anonymization: Accurate Statistical Analysis with Privacy Preservation	2008	SIGMOD
5	9,650	Aggregate Estimation Over Dynamic Hidden Web Databases	2014	VLDB
6	9,683	Optimal Algorithms for Crawling a Hidden Database in the Web	2012	VLDB
7	7,320	Privacy Implications of Database Ranking	2015	VLDB
8	12,309	Aggregate Suppression for Enterprise Search Engines	2012	SIGMOD
9	8,671	Unbiased Estimation of Size and Other Aggregates Over Hidden Web Databases	2010	SIGMOD
10	12,384	Randomized Generalization for Aggregate Suppression Over Hidden Web Databases	2011	VLDB