Typing and Querying XML Documents: Some Complexity Bounds

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

Volumn 22, Issue , 2003, Pages 167-178

  Segoufin, Luc ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA HANDLING; TREES (MATHEMATICS); WORLD WIDE WEB; XML;

COMPLEXITY BOUNDS; QUERY EVALUATION;

QUERY LANGUAGES;

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

References (40)

1. Document Object Model (DOM). Available at http://www.w3c.org/dom.
2. Simple API for XML (SAX). Available at http://www.saxproject.org/.
3. XML Path Language (XPath). Available at http://www.w3.org/TR/2002/WD-xpath20-20020816.
4. S. Abiteboul. Semistructured data: from practice to theory. In Proc. IEEE Conf. on Logic in Computer Science, 2001.
5. A. V. Aho and J. D. Ullman. Translations on a context-free grammar. Inform. and Control, 19:439-475, 1971.
6. E. Allender. The division breakthroughs. The Computational Complexity Column, EATCS Bulletin, 74:61-77, 2001.
7. D. A. M. Barrington and J. Corbett. On the relative complexity of some languages in NC1, Information Processing Letter, 32:251-256, 1989.
8. D. A. M. Barrington, N. Immerman, and H. Straubing. On Uniformity within NC1. Journal of Computer and System Sciences, 41(3):274-306, 1990.
9. C. Beeri and T. Milo. Schemas for integration and translation of structured and semi-structured data. In Proc. of Intl. Conf. on Database Theory, 1999.
10. A. Borodin, S. A. Cook, P. W. Dymond, W. L. Ruzzo, and M. Tompa. Inductive Counting for Complementation Problems. SIAM J. Comput., 18(3):559-578, 1989.
11. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular Tree and Regular Hedge Languages over Unranked Alphabets. Available at ftp://ftp11.informatik.tu-muenchen.de/pub/misc/caterpillars/, 2001.
12. A. Brüggemann-Klein and D. Wood. One-Unambiguous Regular Languages. Information and Computation, 142(2), 1998.
13. S. R. Buss. The Boolean formula value problem. In Proc. ACM SIGACT Symp. on the Theory of Computing, 1987.
14. S. Cluet, C. Delobel, J. Simeon, and K. Smaga. Your mediators need data conversion! In Proc. ACM SIGMOD Symp. on the Management of Data, 1998.
15. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available at http://www.grappa.univ-lille3.fr/tata, 1999.
16. S. A. Cook. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers. Journal of ACM, 18(1):4-18, 1971.
17. S. A. Cook and P. McKenzie. Problems Complete for Deterministic Logarithmic Space. Journal of Algorithms, 8:385-394, 1987.
18. J. Engelfriet, H. Hoogeboom, and J.-P. van Best. Trips on trees. Acta Cybernetica, 14:51-64, 1999.
19. J. Engelfriet and H. J. Hoogeboom. Tree-walking pebble automata. In J. Karhumäki, H. Maurer, G. Paun, and G.Rozenberg, editors, Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa, pages 72-83. Springer-Verlag, 1999.
20. K. Etessami. Counting quantifiers, successor relations, and logarithmic space. Journal of Computer and System Sciences, 54(3):400-411, 1997.
21. G. Gottlob, C. Koch, and R. Pichler. Efficient Algorithms for Processing XPath Queries. In Proc. of Intl. Conf. on Very Large Data Bases, 2002.
22. G. Gottlob, C. Koch, and R. Pichler. The complexity of XPath query evaluation. In Proc. ACM Symp. on Principles of Database Systems, 2003.
23. G. Gottlob, N. Leone, and F. Scarcello. The Complexity of Acyclic Conjunctive Queries. Journal of ACM, 43(3):431-498, 2001.
24. T. Jiang and B. Ravikumar. A note on the space complexity of some decision problems for finite automata. Information Processing Letters, 40:25-31, 1991.
25. N. D. Jones. Space-Bounded Reducibility among Combinatorial Problems. Journal of Computer and System Sciences, 11:68-85, 1975.
26. S. Lindell. A Logpsace Algorithm for Tree Canonization. In Proc. ACM SIGACT Symp. on the Theory of Computing, 1992.
27. M. Lohrey. On the Parallel Complexity of Tree Automata. In Rewriting Techniques and Applications (RTA'01), 2001.
28. R. McNaughton. Parenthesis Grammars. Journal of Computer and System Sciences, 1967.
29. F. Neven. Automata, Logic, and XML. In Proc. of Computer Science Logic, 2002.
30. D. Olteanu, H. Meuss, T. Furche, and F. Bry. XPath: Looking Forward. In Workshop on XML-Based Data Management, XMLDM 2002, 2002.
31. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proc. ACM Symp. on Principles of Database Systems, 2000.
32. Y. Papakonstantinou and V. Vianu. Incremental Validation of XML Documents. In Proc. of Intl. Conf. on Database Theory, 2003.
33. G. Rozenberg and A. Salomaa, editors. Handbook of formal language. Springer, 1997.
34. W. Ruzzo. Tree-size bounded alternation. Journal of Computer and System Sciences, 21:218-235, 1980.
35. L. Segoufin and V. Vianu. Validating streaming XML documents. In Proc. ACM Symp. on Principles of Database Systems, 2002.
36. D. Suciu. Typechecking for Semistructured Data. In Proc. workshop on Database Programming Language, 2001.
37. I. Sudborough. Time and tape bounded auxiliary pushdown automata. In Mathematical Foundations of Computer Science (MFCS), volume 53 of LNCS, pages 493-503. Springer-Verlag, 1977.
38. I. Sudborough. On the tape complexity of deterministic context-free languages. Journal of ACM, 25(3):405-414, 1978.
39. H. Venkateswaran. Properties that characterize LOGCFL. Journal of Computer and System Sciences, 43:380-404, 1991.
40. H. Vollmer. Introduction to circuit complexity. Springer, 1999.