Joining Extractions of Regular Expressions
Summary: Shows CQ/UCQ evaluation over regex formulas inherits NP- and W[1]-hardness, with even acyclic queries hard due to exponentially large implicit span relations. Establishes polynomial-delay evaluation for bounded-atom UCQs and FPT-delay parameterized by UCQ size. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dominik D. Freydenberger (Loughborough University)
- 2. Benny Kimelfeld (Israel Institute of Technology)
- 3. Liat Peterfreund (Israel Institute of Technology)
BibTeX Citation
@inproceedings{freydenberger_pods18,
address = {New York, NY, USA},
series = {{PODS} '18},
title = {{Joining Extractions of Regular Expressions}},
url = {https://dl.acm.org/doi/10.1145/3196959.3196967},
doi = {10.1145/3196959.3196967},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Freydenberger, Dominik D. and Kimelfeld, Benny and Peterfreund, Liat},
year = {2018}
}
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 300 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00022046803 |
| 319 | Declarative Information Extraction Using Datalog with Embedded Extraction Predicates | 2007 | VLDB | 0.00021377065 |
| 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS | 0.00018893507 |
| 579 | Incremental Knowledge Base Construction Using DeepDive | 2015 | VLDB | 0.00016217563 |
| 673 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00015095061 |
| 4,752 | Automatic Rule Refinement for Information Extraction | 2010 | VLDB | 6.5235308e-05 |
| 5,698 | Improving Regular-Expression Matching on Strings Using Negative Factors | 2013 | SIGMOD | 6.1170269e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,066 | Rewriting of Regular Expressions and Regular Path Queries | 1999 | PODS |
| 2 | 7,289 | Conjunctive Regular Path Queries with String Variables | 2020 | PODS |
| 3 | 2,468 | On the Enumeration Complexity of Unions of Conjunctive Queries | 2019 | PODS |
| 4 | 11,440 | Autonomously Computable Information Extraction | 2023 | VLDB |
| 5 | 9,921 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS |
| 6 | 2,348 | Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity | 2018 | PODS |
| 7 | 5,635 | Algebras for Querying Text Regions (Extended Abstract) | 1995 | PODS |
| 8 | 6,718 | Minimizing Conjunctive Regular Path Queries | 2025 | PODS |
| 9 | 2,619 | Constant Delay Algorithms for Regular Document Spanners | 2018 | PODS |
| 10 | 5,123 | Complexity Bounds for Relational Algebra over Document Spanners | 2019 | PODS |