DBScholar

Back to papers

Constant Delay Algorithms for Regular Document Spanners

Summary: Presents practical constant-delay enumeration for regular document spanners after linear-time preprocessing, enabling rapid extraction despite large outputs. Analyzes applicability across automata, regex formulas, and spanner algebras, plus fine-grained output counting. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
1766
Venue
PODS
Year
2018
Pagerank
8.336529e-05
Overall Rank
2,619 | 82.04%
DOI
10.1145/3196959.3196987

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{florenzano_pods18,
        address = {New York, NY, USA},
        series = {{PODS} '18},
        title = {{Constant Delay Algorithms for Regular Document Spanners}},
        url = {https://dl.acm.org/doi/10.1145/3196959.3196987},
        doi = {10.1145/3196959.3196987},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Florenzano, Fernando and Riveros, Cristian and Ugarte, Martín and Vansummeren, Stijn and Vrgoč, Domagoj},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers