Monadic queries over tree-structured data

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 189-202

  Gottlob, Georg ^a   Koch, Christoph ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

MONADIC QUERY LANGUAGES;

COMPUTER PROGRAM LISTINGS; DATABASE SYSTEMS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS); XML;

QUERY LANGUAGES;

EID: 0036051123     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2002.1029828     Document Type: Conference Paper

References (37)

1. Regular path queries with constraints
2. Declarative information extraction, web crawling, and recursive wrapping with lixto
3. Visual web information extraction with lixto
4. A formal model for an expressive fragment of XSLT
5. Optimal implementation of conjunctive queries in relational data bases
6. Complexity and expressive power of logic programming
7. Containment and integrity constraints for XPath
8. Linear-time algorithms for testing the satisfiability of propositional horn formulae
9. Temporal and modal logic
10. Query evaluation via tree-decompositions
11. Datalog LITE: A deductive query language with linear-time model checking
12. Monadic datalog and the expressive power of web information extraction languages
13. Efficient algorithms for processing XPath queries
14. XWRAP: An XML-enabled wrapper construction system for web information sources
15. Containment and equivalence for an XPath fragment
16. Typechecking for XML transformers
17. LTUR: A simplified linear-time unit resolution algorithm for horn formulae and computer implementation
18. Expressive and efficient pattern languages for tree-structured data
19. Query automata on finite trees
20. Building intelligent web applications using lightweight wrappers
21. Automata on infinite objects
22. Languages, automata, and logic
23. On the equivalence of XML patterns