Database Paper Browser

Back to papers

Differentially Private Substring and Document Counting

Summary: DP for substring and document counting in document collections; epsilon-DP data structure yields additive error O(l polylog(n l |Sigma|)) for all patterns, optimal up to polylog. For epsilon-delta DP, bound improves to O(sqrt(l) polylog(n l |Sigma|)); space O(n l^2), preprocessing O(n^2 l^4), query O(|P|); introduces a tree-counting technique enabling private mining of frequent substrings and q-grams. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1966
Venue
PODS
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,346 | 28.03%
DOI
10.1145/3725232

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

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

Rank Cited Paper Year Venue Pagerank
136 Revealing Information while Preserving Privacy 2003 PODS 0.0004241101
453 Towards Practical Differential Privacy for SQL Queries 2018 VLDB 0.00022741848
568 Practical Privacy: The SuLQ Framework 2005 PODS 0.00019949368
1,520 PrivTree: A Differentially Private Algorithm for Hierarchical Decompositions 2016 SIGMOD 0.00011535148
2,685 On Differentially Private Frequent Itemset Mining 2013 VLDB 8.3070708e-05
Previous Page 1 / 1 Next

Semantically Similar Papers