Database Paper Browser

Back to papers

Dynamic Data Structures for Document Collections and Graphs

Summary: Presents a framework to dynamize static compressed data structures, circumventing the Fredman–Saks rank lower bound that stymied prior compressed dynamic text indexes and nearly closing the static/dynamic indexing gap. Framework also yields compressed dynamic representations for graphs and binary relations supporting updates and pattern queries with near-static bounds. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1663
Venue
PODS
Year
2015
Pagerank
4.4981899e-05
Overall Rank
8,496 | 40.90%
DOI
10.1145/2745754.2745778

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
5,493 Worst-Case Optimal Graph Joins in Almost No Space 2021 SIGMOD 5.4771449e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 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
5,813 Space-efficient Substring Occurrence Estimation 2011 PODS 5.3170565e-05
Previous Page 1 / 1 Next

Semantically Similar Papers