First order paths in ordered trees

DOI10.1007/978-3-540-30570-5_8MaRDI QIDQ5316620zbMATH OpenOpenAlexFDO

Authors Maarten Marx

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104421

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20)

Recommendations

• Limiting Until in ordered tree query languages
• First-order aspects of tree paths
• Structural characterizations of the navigational expressiveness of relation algebras on a tree
• On regular paths with counting and data tests
• Definability for downward and vertical XPath on data trees

Cited in

(11)

• Applying model-checking to solve queries on semistructured data
• Querying linguistic trees
• Tight lower bounds for query processing on streaming and external memory data
• Ordered trees and the inorder traversal
• PDL for ordered trees
• Regular languages with variables on graphs
• First-order aspects of tree paths
• One-Dimensional Logic over Trees
• Limiting Until in ordered tree query languages
• Automata for XML -- a survey
• Structural characterizations of the navigational expressiveness of relation algebras on a tree

This page was built for publication: First order paths in ordered trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316620)