Database Paper Browser

Back to papers

Space-efficient Substring Occurrence Estimation

Summary: Space-optimal substring-occurrence estimators: for additive error l store Θ(|T| log σ / l) bits to answer Count≈_l(P), enabling compact selectivity estimation via compressed text indexing. Also a frequency-aware Count≥_l structure exact for counts ≥l with space scaling by number of frequent patterns. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1543
Venue
PODS
Year
2011
Pagerank
5.3170565e-05
Overall Rank
5,813 | 59.57%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
8,496 Dynamic Data Structures for Document Collections and Graphs 2015 PODS 4.4981899e-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
1,146 Estimating Alphanumeric Selectivity in the Presence of Wildcards 1996 SIGMOD 0.00013679782
1,379 Substring Selectivity Estimation 1999 PODS 0.00012286879
Previous Page 1 / 1 Next

Semantically Similar Papers