HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Stackless Processing of Streamed Trees

Corentin Barloy 1 Filip Murlak 2 Charles Paperman 1
1 LINKS - Linking Dynamic Data
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189, Inria Lille - Nord Europe
Abstract : Processing tree-structured data in the streaming model is a challenge: capturing regular properties of streamed trees by means of a stack is costly in memory, but falling back to finite-state automata drastically limits the computational power. We propose an intermediate stackless model based on register automata equipped with a single counter, used to maintain the current depth in the tree. We explore the power of this model to validate and query streamed trees. Our main result is an effective characterization of regular path queries (RPQs) that can be evaluated stacklessly-with and without registers. In particular, we confirm the conjectured characterization of tree languages defined by DTDs that are recognizable without registers, by Segoufin and Vianu (2002), in the special case of tree languages defined by means of an RPQ.
Complete list of metadata

Contributor : Charles Paperman Connect in order to contact the contributor
Submitted on : Wednesday, November 25, 2020 - 9:42:51 AM
Last modification on : Thursday, March 24, 2022 - 3:43:47 AM
Long-term archiving on: : Friday, February 26, 2021 - 6:09:41 PM


Publisher files allowed on an open archive



Corentin Barloy, Filip Murlak, Charles Paperman. Stackless Processing of Streamed Trees. PODS 2021 - Symposium on Principles of Database Systems, Jun 2021, Xi'an, Shaanx, China. ⟨10.4230/LIPIcs⟩. ⟨hal-03021960⟩



Record views


Files downloads