DBScholar

Back to papers

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)

Paper ID
1746
Venue
PODS
Year
2018
Pagerank
0.00010486718
Overall Rank
1,528 | 89.52%
DOI
10.1145/3196959.3196967

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers