Database Theory - ICDT 2005

DOI10.1007/B104421zbMATH Open1112.68370OpenAlexW4232873349MaRDI QIDQ5316620FDOQ5316620

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

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

Mathematics Subject Classification ID

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

Cited In (9)

• Limiting Until in Ordered Tree Query Languages
• Regular languages with variables on graphs
• Applying model-checking to solve queries on semistructured data
• Tight lower bounds for query processing on streaming and external memory data
• PDL for ordered trees
• Automata for XML -- a survey
• Ordered trees and the inorder traversal
• Querying linguistic trees
• One-Dimensional Logic over Trees

This page was built for publication: Database Theory - ICDT 2005

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