DBScholar

Back to papers

Stackless Processing of Streamed Trees

Summary: Introduce a stackless streaming model: register automata with a single depth counter to validate and query streamed trees, sitting between finite-state and stack-based approaches. Characterize which RPQs are evaluable stacklessly (with or without registers) and confirm Segoufin–Vianu's conjecture for RPQ-defined DTD languages. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1847
Venue
PODS
Year
2021
Pagerank
5.5181056e-05
Overall Rank
7,919 | 45.67%
DOI
10.1145/3452021.3458320

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{barloy_pods21,
        address = {New York, NY, USA},
        series = {{PODS} '21},
        title = {{Stackless Processing of Streamed Trees}},
        url = {https://dl.acm.org/doi/10.1145/3452021.3458320},
        doi = {10.1145/3452021.3458320},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Barloy, Corentin and Murlak, Filip and Paperman, Charles},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,592 Streaming Validation of JSON Documents Against Schemas 2026 VLDB 5.093636e-05
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