Efficient Enumeration for Annotated Grammars
Summary: Defines annotated grammars—CFGs with terminal annotations—that extend regular spanners and strictly generalize Peterfreund's extraction grammars; formulates enumeration of all annotations yielding derivable words for a fixed grammar and input string. Main results: unambiguous grammars enumerated with O(n^3) preprocessing and output-linear delay (improves prior quintic); subclasses with single derivation shape admit O(n^2) preprocessing, and spanner-like classes admit O(n) preprocessing, all preserving output-linear delay. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Antoine Amarilli (Institut Polytechnique de Paris; Télécom Paris)
- 2. Louis Jachiet (Institut Polytechnique de Paris; Télécom Paris)
- 3. Martín Muñoz (Pontifical Catholic University of Chile)
- 4. Cristian Riveros (Pontifical Catholic University of Chile)
BibTeX Citation
@inproceedings{amarilli_pods22,
address = {New York, NY, USA},
series = {{PODS} '22},
title = {{Efficient Enumeration for Annotated Grammars}},
url = {https://dl.acm.org/doi/10.1145/3517804.3526232},
doi = {10.1145/3517804.3526232},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Amarilli, Antoine and Jachiet, Louis and Muñoz, Martín and Riveros, Cristian},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,184 | Complex Event Recognition meets Hierarchical Conjunctive Queries | 2024 | PODS | 5.3058708e-05 |
| 9,312 | REmatch: a novel regex engine for finding all matches | 2023 | VLDB | 5.289545e-05 |
| 10,636 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS | 5.093636e-05 |
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 |
|---|---|---|---|---|
| 636 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001551856 |
| 816 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.00013827772 |
| 2,619 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS | 8.336529e-05 |
| 3,136 | Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries | 2020 | PODS | 7.7210541e-05 |
| 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS | 6.1637419e-05 |
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,168 | Marrying Words and Trees | 2007 | PODS |
| 2 | 4,690 | Spanner Evaluation over SLP-Compressed Documents | 2021 | PODS |
| 3 | 13,124 | Factoring Augmented Regular Chain Programs | 1990 | VLDB |
| 4 | 12,299 | Deterministic Regular Expressions in Linear Time | 2012 | PODS |
| 5 | 8,909 | Enumeration for MSO-Queries on Compressed Trees | 2024 | PODS |
| 6 | 10,163 | Optimal Enumeration of Regular Pattern Matches | 2026 | PODS |
| 7 | 10,636 | A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity | 2025 | PODS |
| 8 | 3,472 | Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 2019 | PODS |
| 9 | 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS |
| 10 | 2,619 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS |