DBScholar

Back to papers

Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates

Summary: For every MSO query on strings, builds a linear-time index supporting relabeling and single-symbol insertions/deletions in logarithmic time. Enumeration retains constant delay, avoiding the linear-time reconstruction required by prior dynamic indexes. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
1740
Venue
PODS
Year
2018
Pagerank
6.9038261e-05
Overall Rank
4,097 | 71.90%
DOI
10.1145/3196959.3196961

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{niewerth_pods18,
        address = {New York, NY, USA},
        series = {{PODS} '18},
        title = {{Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates}},
        url = {https://dl.acm.org/doi/10.1145/3196959.3196961},
        doi = {10.1145/3196959.3196961},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Niewerth, Matthias and Segoufin, Luc},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers