The Complexity of XPath Query Evaluation

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

Volumn 22, Issue , 2003, Pages 179-190

  Gottlob, Georg ^a   Koch, Christoph ^b   Pichler, Reinhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA HANDLING; POLYNOMIALS; PROBLEM SOLVING; SEARCH ENGINES; STANDARDS; XML;

DATA COMPLEXITY; QUERY EVALUATION;

QUERY LANGUAGES;

EID: 1142275475     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773171     Document Type: Conference Paper

References (14)

1. A. Borodin, S. A. Cook, P. W. Dymond, W. L. Ruzzo, and M. Tompa. "Two Applications of Inductive Counting for Complementation Problems". SIAM Journal of Computing, 18:559-578, 1989.
2. S. A. Cook and P. McKenzie. "Problems Complete for Deterministic Logarithmic Space". J. Algorithms, 8:385-394, 1987.
3. 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, Aug. 2002.
4. G. Gottlob, C. Koch, and R. Pichler. "XPath Query Evaluation: Improving Time and Space Efficiency". In Proceedings of the 19th IEEE International Conference on Data Engineering (ICDE'03), pages 379-390, Bangalore, India, Mar. 2003.
5. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995.
6. D. S. Johnson. "A Catalog of Complexity Classes". In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume 1, chapter 2, pages 67-161. Elsevier Science Publishers B.V., 1990.
7. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
8. L. Segoufin. "Typing and Querying XML Documents: Some Complexity Bounds". In Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), San Diego, CA, 2003.
9. I. Sudborough. "Time and Tape Bounded Auxiliary Pushdown Automata". In Mathematical Foundations of Computer Science (MFCS'77), pages 493-503. Springer Verlag, LNCS 53, 1977.
10. M. Y. Vardi. "The Complexity of Relational Query Languages". In Proc. 14th Annual ACM Symposium on Theory of Computing (STOC'82), pages 137-146, San Francisco, CA USA, May 1982.
11. H. Venkateswaran. "Properties that Characterize LOGCFL". Journal of Computer and System Sciences, 43:380-404, 1991.
12. P. Wadler. "Two Semantics for XPath", 2000. Draft paper available at http://www.research.avayalabs.com/user/wadler/.
13. World Wide Web Consortium. XML Path Language (XPath) Recommendation., Nov. 1999. http://www.w3c.org/TR/xpath/.
14. World Wide Web Consortium. "XQuery 1.0 and XPath 2.0 Formal Semantics. W3C Working Draft (Aug. 16th 2002), 2002. http://www.w3.org/TR/query-algebra/.