Highly expressive query languages for unordered data trees

DOI10.1007/s00224-015-9617-5zbMath1352.68075OpenAlexW2007482449MaRDI QIDQ269323

Serge Abiteboul, Pierre Bourhis, Victor Vianu

Publication date: 18 April 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://escholarship.org/uc/item/8qm5g2qs

zbMATH Keywords

XMLexpressivenessquery languagesdata trees

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (4)

Schemas for unordered XML on a DIME ⋮ Inferring Deterministic Regular Expression with Unorder ⋮ Grammar-based compression of unranked trees ⋮ Distinct fringe subtrees in random trees

Cites Work

• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• On the tree-transformation power of XSLT
• Automata for XML -- a survey
• Datalog extensions for database queries and updates
• Computing with first-order logic
• Object identity as a query language primitive
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Database Programming Languages

This page was built for publication: Highly expressive query languages for unordered data trees