Spanner Evaluation over SLP-Compressed Documents
Summary: Evaluates regular spanners directly on SLP-compressed documents (size s) without decompression, achieving O(s) model-checking/non-emptiness and O(s·|J_M(D)|) time to compute all span-tuples. Enumeration with O(s) preprocessing and O(depth(S)) delay (depth=O(log|D|)) gives logarithmic-in-|D| delay and can outperform uncompressed algorithms for highly compressible data. (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_pods21,
address = {New York, NY, USA},
series = {{PODS} '21},
title = {{Spanner Evaluation over SLP-Compressed Documents}},
url = {https://dl.acm.org/doi/10.1145/3452021.3458325},
doi = {10.1145/3452021.3458325},
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 = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,074 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS | 5.2283159e-05 |
| 9,083 | Query Evaluation Over SLP-Represented Document Databases With Complex Document Editing | 2022 | PODS | 5.2283159e-05 |
| 9,084 | Document Spanners — A Brief Overview of Concepts, Results, and Recent Developments | 2022 | PODS | 5.2283159e-05 |
| 11,080 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS | 4.9793485e-05 |
| 11,084 | Complex Event Recognition under Time Constraints: Towards a Formal Framework for Efficient Query Evaluation | 2025 | PODS | 4.9793485e-05 |
| 11,470 | Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC | 2024 | PODS | 4.9793485e-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,560 | Joining Extractions of Regular Expressions | 2018 | PODS | 0.00010251636 |
| 2,404 | Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity | 2018 | PODS | 8.5180234e-05 |
| 2,670 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS | 8.1505269e-05 |
| 3,906 | Split-Correctness in Information Extraction | 2019 | PODS | 6.9334414e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,538 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS |
| 2 | 5,489 | Compressed Representations of Conjunctive Query Results | 2018 | PODS |
| 3 | 8,959 | Dynamic Data Structures for Document Collections and Graphs | 2015 | PODS |
| 4 | 9,085 | Efficient Enumeration for Annotated Grammars | 2022 | PODS |
| 5 | 5,242 | Complexity Bounds for Relational Algebra over Document Spanners | 2019 | PODS |
| 6 | 5,164 | Enumeration of First-Order Queries on Classes of Structures With Bounded Expansion | 2013 | PODS |
| 7 | 2,670 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS |
| 8 | 4,405 | Efficient Document Analytics on Compressed Data: Method, Challenges, Algorithms, Insights | 2018 | VLDB |
| 9 | 9,074 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS |
| 10 | 9,083 | Query Evaluation Over SLP-Represented Document Databases With Complex Document Editing | 2022 | PODS |