On the power of walking for querying tree-structured data

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2002, Pages 77-84

  Neven, Frank ^a  

^a HASSELT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; DATA STRUCTURES; FORMAL LANGUAGES; FORMAL LOGIC; QUERY LANGUAGES; RECURSIVE FUNCTIONS; TURING MACHINES;

BOOLEAN QUERIES; FIRST ORDER LOGIC; RELATIONAL STORAGE;

XML;

EID: 0036041125     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/543613.543624     Document Type: Conference Paper

References (23)

1. Temporal connectives versus explicit timestamps to query temporal databases
2. Translations on a context-free grammar
3. A formal model for an expressive fragment of XSLT
4. A comparison of tree transductions defined by monadic second order logic and by attribute grammars
5. Implicit temporal query languages: Towards completeness
6. Caterpillars: A context specification technique
7. XQuery 1.0: An XML query language
8. Tree-walking pebble automata
9. Trips on trees
10. Metafinite model theory
11. Algebraic and calculus query languages for recursively typed complex objects
12. Relational queries computable in polynomial time
13. Typechecking for XML transformers
14. Query automata
15. On the power of tree-walking automata
16. Towards regular languages over infinite alphabets
17. Expressiveness of structured document query languages based on attribute grammars
18. On tape-bounded complexity classes and multihead finite automata
19. The complexity of relational query languages