Query evaluation on compressed trees

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 188-197

  Frick, Markus ^a   Grohe, Martin ^a   Koch, Christoph ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BOOLEAN FUNCTIONS; DATABASE SYSTEMS; XML; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; FORESTRY; HYPERTEXT SYSTEMS; POLYNOMIALS; QUERY PROCESSING; RELATIONAL DATABASE SYSTEMS; SOLIDS; STRUCTURE (COMPOSITION); TREES (MATHEMATICS);

MONADIC DATALOG QUERIES;

QUERY LANGUAGES;

ALGORITHMS AND COMPLEXITY; AUTOMATA; DATABASE LANGUAGE; NATURAL STRUCTURES; QUERY EVALUATION; RELATIONAL DATABASE; STYLE SHEETS; XML (EXTENSIBLE MARKUP LANGUAGE);

EID: 0042969210     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web. Morgan Kaufmann Publishers, 2000.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
3. A. Brüggemann-Klein, M. Murata, and D. Wood. "Regular Tree and Regular Hedge Languages over Non-ranked Alphabets: Version 1, April 3, 2001". Technical Report HKUST-TCSC-2001-05, Hong Kong University of Science and Technology, Hong Kong SAR, China, 2001.
4. A. Brüggemann-Klein and D. Wood. "Caterpillars: A Context Specification Technique". Markup Languages, 2(1):81-106, 2000.
5. R. E. Bryant. "Graph-Based Algorithms for Boolean Function Manipulation". IEEE Transactions on Computers, C35(8):677-691, Aug. 1986.
6. P. Buneman, M. Grohe, and C. Koch. "Path Queries on Compressed XML", 2003. Submitted for publication.
7. 20 States and Beyond". In Proceedings of the Annual IEEE Symposium on Logic in Computer Science (LICS'90), 1990.
8. E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
9. R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
10. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1999. Second edition.
11. J. Flum, M. Frick, and M. Grohe. "Query Evaluation via Tree-Decompositions". In J. Van den Bussche and V. Vianu, editors, Proc. of the 8th International Conference on Database Theory (ICDT'01), volume 1973 of Lecture Notes in Computer Science, pages 22-38, London, UK, Jan. 2001. Springer.
12. M. Frick and M. Grohe. 'The Complexity of First-order and Monadic Second-order Logic Revisited". In Proceedings of the 17th IEEE Symposium on Logic in Computer Science, pages 215-224, 2002.
13. G. Gottlob and C. Koch. "Monadic Datalog and the Expressive Power of Web Information Extraction Languages", Nov. 2002. Extended version of PODS'02 paper, submitted. Available as CoRR report arXiv:cs.DB/0211020.
14. G. Gottlob and C. Koch. "Monadic Queries over Tree-Structured Data". In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS 2002), pages 189-202, Copenhagen, Denmark, July 2002.
15. G. Gottlob, C. Koch, and R. Pichler. "Efficient Algorithms for Processing XPath Queries". In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB'02), Hong Kong, China, 2002.
16. G. Gottlob, C. Koch, and R. Pichler. "The Complexity of XPath Query Processing". In Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), San Diego, California, USA, June 2003. To appear.
17. T. J. Green, G. Miklau, M. Onizuka, and D. Suciu. "Processing XML Streams with Deterministic Automata". In Proc. of the 9th International Conference on Database Theory (ICDT'03), 2003.
18. M. Grohe. "Parameterized Complexity for the Database Theorist". SIGMOD Record, 31(4), 2002.
19. H. Hosoya and B. C. Pierce. "Regular Expression Pattern Matching for XML". In Proceedings of 28th Symposium on Principles of Programming Languages (POPL'01), pages 67-80. ACM Press, 2001.
20. T. Milo, D. Suciu, and V. Vianu. "Typechecking for XML Transformers". In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'00), pages 11-22, 2000.
21. M. Minoux. "LTUR: A Simplified Linear-time Unit Resolution Algorithm for Horn Formulae and Computer Implementation". Information Processing Letters, 29(1):1-12, 1988.
22. F. Neven. Design and Analysis of Query Languages for Structured Documents - A Formal and Logical Approach. PhD thesis, Limburgs Universitair Centrum, 1999.
23. F. Neven. "Automata Theory for XML Researchers". SIGMOD Record, 31(3), Sept. 2002.
24. F. Neven and T. Schwentick. "Expressive and Efficient Pattern Languages for Tree-Structured Data". In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'00), pages 145-156, Dallas, Texas, USA, 2000. ACM Press.
25. F. Neven and T. Schwentick. "Query Automata on Finite Trees". Theoretical Computer Science, 275:633-674, 2002.
26. L. Stockmeyer and A. Meyer. "Word Problems Requiring Exponential Time". In Proceedings of the 5th ACM Symposium on Theory of Computing, pages 1-9, 1973.
27. World Wide Web Consortium. XML Path Language (XPath) Recommendation. http://www.w3c.org/TR/xpatn/, Nov. 1999.