Stackless Processing of Streamed Trees
Document type :
Communication dans un congrès avec actes
DOI :
Title :
Stackless Processing of Streamed Trees
Author(s) :
Barloy, Corentin [Auteur]
Linking Dynamic Data [LINKS]
Murlak, Filip [Auteur]
University of Warsaw [UW]
Paperman, Charles [Auteur]
Linking Dynamic Data [LINKS]
Linking Dynamic Data [LINKS]
Murlak, Filip [Auteur]
University of Warsaw [UW]
Paperman, Charles [Auteur]
Linking Dynamic Data [LINKS]
Conference title :
PODS 2021 - Symposium on Principles of Database Systems
City :
Xi'an, Shaanx
Country :
Chine
Start date of the conference :
2021-06-20
Journal title :
Proceedings of the Symposium on Principles of Database Systems, PODS 2021
English keyword(s) :
weak validation
automata
JSON
XML
querying
streaming
phrases streaming
automata
JSON
XML
querying
streaming
phrases streaming
HAL domain(s) :
Informatique [cs]/Base de données [cs.DB]
Informatique [cs]/Théorie et langage formel [cs.FL]
Informatique [cs]/Traitement du texte et du document
Informatique [cs]/Logique en informatique [cs.LO]
Informatique [cs]/Théorie et langage formel [cs.FL]
Informatique [cs]/Traitement du texte et du document
Informatique [cs]/Logique en informatique [cs.LO]
English abstract : [en]
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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-03021960/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-03021960/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-03021960/document
- Open access
- Access the document
- document
- Open access
- Access the document
- main_single.pdf
- Open access
- Access the document