Optimal Enumeration of Regular Pattern Matches
Summary: Studies enumeration of matches for regular patterns—fixed terminal strings separated by capture variables—equivalently ordered, non-overlapping occurrences in a text. Achieves optimal constant-delay enumeration after linear preprocessing in both text and query size, eliminating prior quadratic query dependence. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Paweł Gawrychowski (University of Wrocław)
- 2. Florin Manea (University of Göttingen)
- 3. Paul Sarnighausen-Cahn (University of Göttingen)
- 4. Stefan Siemer (University of Göttingen)
BibTeX Citation
@inproceedings{gawrychowski_pods26,
address = {New York, NY, USA},
series = {{PODS} '26},
title = {{Optimal Enumeration of Regular Pattern Matches}},
url = {https://dl.acm.org/doi/10.1145/3801908},
doi = {10.1145/3801908},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gawrychowski, Paweł and Manea, Florin and Sarnighausen-Cahn, Paul and Siemer, Stefan},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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,528 | Joining Extractions of Regular Expressions | 2018 | PODS | 0.00010486718 |
| 2,619 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS | 8.336529e-05 |
| 4,097 | Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates | 2018 | PODS | 6.9038261e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,986 | Querying Graph Patterns | 2011 | PODS |
| 2 | 5,579 | Enumeration on Trees with Tractable Combined Complexity and Efficient Updates | 2019 | PODS |
| 3 | 4,391 | Scalable Regular Expression Matching on Data Streams | 2008 | SIGMOD |
| 4 | 10,654 | The Complexity of Maximal Common Subsequence Enumeration | 2025 | PODS |
| 5 | 7,664 | Optimal Enumeration: Efficient Top-k Tree Matching | 2015 | VLDB |
| 6 | 8,924 | Efficient Enumeration for Annotated Grammars | 2022 | PODS |
| 7 | 1,528 | Joining Extractions of Regular Expressions | 2018 | PODS |
| 8 | 12,299 | Deterministic Regular Expressions in Linear Time | 2012 | PODS |
| 9 | 9,312 | REmatch: a novel regex engine for finding all matches | 2023 | VLDB |
| 10 | 2,619 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS |