Highly expressive query languages for unordered data trees
From MaRDI portal
Recommendations
- Tree-language based querying of hierarchically structured and semi-structured data
- scientific article; zbMATH DE number 4213431
- Structural recursion as a query language on lists and ordered trees
- Conjunctive queries over trees
- Rewriting Techniques and Applications
- Conjunctive query containment over trees
- Limiting Until in ordered tree query languages
- Logical definability and query languages over ranked and unranked trees
- Monadic datalog and regular tree pattern queries
Cites work
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Automata for XML -- a survey
- Computing with first-order logic
- Database Programming Languages
- Datalog extensions for database queries and updates
- Elements of finite model theory.
- Object identity as a query language primitive
- On the tree-transformation power of XSLT
Cited in
(7)- PDL for ordered trees
- Limiting Until in ordered tree query languages
- Structural recursion as a query language on lists and ordered trees
- Schemas for unordered XML on a DIME
- On deciding well-definedness for query languages on trees
- Distinct fringe subtrees in random trees
- Inferring deterministic regular expression with unorder
This page was built for publication: Highly expressive query languages for unordered data trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269323)
