Conjunctive queries over trees

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

Volumn 23, Issue , 2004, Pages 189-200

  Gottlob, Georg ^a   Koch, Christoph ^a   Schulz, Klaus U ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DATABASE SYSTEMS; EVALUATION; HTML; NATURAL LANGUAGE PROCESSING SYSTEMS; POLYNOMIALS; XML;

CONJUNCTIVE QUERIES; TREE STRUCTURES; XPATH AXIS;

TREES (MATHEMATICS);

EID: 3142712950     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1055558.1055585     Document Type: Conference Paper

References (29)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. R. Baumgartner, S. Flesca, and G. Gottlob. "Visual Web Information Extraction with Lixto". In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB'01), 2001.
3. M. Benedikt, W. Fan, and G. Kuper. "Structural Properties of XPath Fragments". In Proc. of the 9th International Conference on Database Theory (ICDT'03), 2003.
4. M. Bodirsky, D. Duchier, J. Niehren, and S. Miele. "A New Algorithm for Normal Dominance Constraints". In Proc. SODA, 2004.
5. A. K. Chandra and P. M. Merlin. "Optimal Implementation of Conjunctive Queries in Relational Data Bases". In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing (STOC'77), pages 77-90, Boulder, CO USA, May 1977.
6. C. Chekuri and A. Rajaraman. Conjunctive Query Containment Revisited". In Proc. of the 6th International Conference on Database Theory (ICDT'97), pages 56-70, 1997.
7. R. Dechter. "Constraint Processing". Morgan Kaufmann, May 2003.
8. A. Deutsch and V. Tannen. "MARS: A System for Publishing XML from Mixed and Redundant Storage". In Proceedings of the 29th International Conference on Very Large Data Bases (VLDB'03), pages 201-212, 2003.
9. A. Deutsch and V. Tannen. "Reformulation of XML Queries and Constraints". In Proc. of the 9th International Conference on Database Theory (ICDT'03), pages 225-241, 2003.
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. 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), pages 189-202, Copenhagen, Denmark, July 2002.
13. G. Gottlob and C. Koch. "Monadic Datalog and the Expressive Power of Web Information Extraction Languages". Journal of the ACM, 51(1):74-113, 2004.
14. 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.
15. 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'03), 2003.
16. J. Hidders. "Satisfiability of XPath Expressions". In Proc. DBPL, 2003.
17. LDC. "The Penn Treebank Project", 1999. http://www.cis.upenn. edu/~treebank/home.html.
18. D. Maier. The Theory of Relational Databases. Computer Science Press, 1983.
19. M. P. Marcus, D. Hindle, and M. M. Fleck. "D-Theory: Talking about Talking about Trees". In Proc. ACL, pages 129-136, 1983.
20. H. Meuss and K. U. Schulz. "Complete Answer Aggregates for Tree-like Databases: A Novel Approach to Combine Querying and Navigation". ACM Transactions on Information Systems, 19(2):161-215, 2001.
21. H. Meuss, K. U. Schulz, and F. Bry. "Towards Aggregated Answers for Semistructured Data". In Proc. of the 8th International Conference on Database Theory (ICDT'01), pages 346-360, 2001.
22. M. Minoux. "LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation". Information Processing Letters, 29(1):1-12, 1988.
23. D. Olteanu, H. Meuss, T. Furche, and F. Bry. "Symmetry in XPath". In Proc. EDBT Workshop on XML Data Management, 2002.
24. T. Schaefer. "The Complexity of Satisfiability Problems". In Proc. 10th Ann. ACM Symp. on Theory of Computing (STOC), pages 216-226, 1978.
25. M. Schmidt-Schauss and K. U. Schulz. "On the Exponent of Periodicity of Minimal Solutions of Context Equations". In Proc. 9th Int. Conf. on Rewriting Techniques and Applications, pages 61-75, 1998.
26. M. Schmidt-Schauß and J. Stuber. "On the Complexity of Linear and Stratified Context Matching Problems", 2001. Unpublished manuscript.
27. T. Schwentick. "On Diving in Trees". In Proc. MFCS, pages 660-669, 2000.
28. World Wide Web Consortium. XML Path Language (XPath) Recommendation. http://www.w3c.org/TR/xpath/, Nov. 1999.
29. M. Yannakakis. "Algorithms for Acyclic Database Schemes". In Proceedings of the 7th International Conference on Very Large Data Bases (VLDB'81), 1981.