Query Evaluation Over SLP-Represented Document Databases With Complex Document Editing
Summary: Bring dynamic updates to SLP-compressed document DBs: support complex editor-like edits (copy/paste, delete, concat) while retaining O(log |Di|)-delay enumeration of k regular spanners by maintaining SLP balancing. Each edit expression φ applied in O(k·|φ|·log d) time (d = max intermediate length), independent of SLP size, permitting updates that produce documents exponentially larger than the update time. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Markus L. Schmid (Humboldt University of Berlin)
- 2. Nicole Schweikardt (Humboldt University of Berlin)
BibTeX Citation
@inproceedings{schmid_pods22,
address = {New York, NY, USA},
series = {{PODS} '22},
title = {{Query Evaluation Over SLP-Represented Document Databases With Complex Document Editing}},
url = {https://dl.acm.org/doi/10.1145/3517804.3524158},
doi = {10.1145/3517804.3524158},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Schmid, Markus L. and Schweikardt, Nicole},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,909 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS | 5.3483178e-05 |
| 8,923 | Document Spanners — A Brief Overview of Concepts, Results, and Recent Developments | 2022 | PODS | 5.3483178e-05 |
| 10,636 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 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,528 | Joining Extractions of Regular Expressions | 2018 | PODS | 0.00010486718 |
| 2,348 | Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity | 2018 | PODS | 8.7135317e-05 |
| 4,690 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS | 6.5610882e-05 |
| 5,123 | Complexity Bounds for Relational Algebra over Document Spanners | 2019 | PODS | 6.3571407e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,182 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS |
| 2 | 8,528 | Aggregate Queries on Sparse Databases | 2020 | PODS |
| 3 | 5,041 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS |
| 4 | 9,819 | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration | 2021 | PODS |
| 5 | 3,136 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS |
| 6 | 13,683 | Efficient Evaluation for a Temporal Logic on Changing XML Documents | 2011 | PODS |
| 7 | 8,909 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS |
| 8 | 8,810 | Dynamic Data Structures for Document Collections and Graphs | 2015 | PODS |
| 9 | 6,732 | Insert-Only versus Insert-Delete in Dynamic Query Evaluation | 2024 | PODS |
| 10 | 4,690 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS |