On the complexity of nonrecursive XQuery and functional query languages on complex values

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

Volumn , Issue , 2005, Pages 84-97

  Koch, Christoph ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

MONAD ALGEBRA; XQUERY;

QUERY LANGUAGES;

EID: 33244479415     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1065167.1065179     Document Type: Conference Paper

References (43)

1. S. Abiteboul and C. Beeri. "The Power of Languages for the Manipulation of Complex Values". VLDB J., 4(4):727-794, 1995.
2. S. Abiteboul and G. G. Hillebrand. "Space Usage in Functional Query Languages". In Proc. of the 5th International Conference on Database Theory (ICDT), pages 439-454, 1995.
3. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
4. D. A. M. Barrington, N. Immerman, and H. Straubing. "On Uniformity within NC1". Journal of Computer and System Sciences, 41(3):274-306, 1990.
5. L. Berman. "The Complexity of Logical Theories". Theoretical Comput. Sci., 11:216-224, 1980.
6. P. Buneman, S. A. Naqvi, V. Tannen, and L. Wong. "Principles of Programming with Complex Objects and Collection Types". Theor. Comput. Sci., 149(1):3-48, 1095.
7. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. "Alternation" . Journal of the ACM, 28:114-133, 1981.
8. E. Dantsin, T. Eiter, G. Gottlob, and A. Vororikov. "Complexity and Expressive Power of Logic Programming". ACM Computing Surveys, 33(3);374-425, Sept. 2001.
9. E. Dantsin and A. Voronkov. "Complexity of Query Answering in Logic Databases with Complex Values". In Proc. LFCS'97, LNCS 1234, pages 56-66, 1997.
10. E. Dantsin and A. Voronkov. Expressive Power and Data Complexity of Query Languages for Trees and Lists. In Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'00), pages 157-165, Dallas, Texas, USA, 2000. ACM Press.
11. M. Fernandez, J. Simeon, and P. Wadler. An Algebra for XML Query. In Proc. FSTTCS 2000, LNCS 1974, pages 11-45. Springer-Verlag, 2000.
12. M. F. Fernandez and J. Siméon. "Building an Extensible XQuery Engine: Experiences with Galax (Extended Abstract)". In Proc. XSYM, pages 1-4, 2004.
13. J. Ferrante and C. Rackoff. "A Decision Procedure for the First Order Theory of Real Addition with Order". SIAM J. Comput., 4(1):69-76, 1975.
14. D. Florescu, C. Hillery, D. Kossmann, P. Lucas, F. Riccardi, T. Westmann, M. J. Carey, A. Sundararajan, and G. Agrawal. "The BEA/XQRL Streaming XQuery Processor". In Proceedings of the 29th International Conference on Very Large Data Bases (VLDB), pages 997-1008, 2003.
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), pages 95-106, Hong Kong, China, 2002.
16. G. Gottlob, C. Koch, and R. Pichler. "The Complexity of XPath Query Evaluation". In Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 179-190, San Diego, California, 2003.
17. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995.
18. S. Grumbach, L. Libkin, T. Milo, and L. Wong. "Query Languages for Bags - Expressive Power and Complexity", SICACT News, 27(2):30-44, 1996.
19. S. Grumbach and T. Milo. "Towards Tractable Algebras for Bags". In Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'93), pages 49-58, 1993.
20. S. Grumbach and V. Vianu, "Tractable Query Languages for Complex Object Databases". In Proceedings of the 10th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'91), pages 315-327, 1991.
21. J. Hartmanis, P. M. Lewis II, and R. E. Stearns. "Hierarchies of Memory Limited Computations". In Proc. Sixth Annual IEEE Symposium on Switching Circuit Theory and Logical Design, pages 179-190, 1965.
22. J. Hidders, J. Paredaens, R. Verkammen, and S. Demeyer. "A Light but Formal Introduction to XQuery", In Proc. XSYM, pages 5-20, 2004.
23. R. Hull and J. Su. "On Accessing Object-oriented Databases: Expressive Power, Complexity, and Restrictions". In Proceedings of the 1989 ACM SICMOD International Conference on Management of Data (SIGMOD'89), pages 147-158, 1989.
24. R. Hull and J. Su. "Algebraic and Calculus Query Languages for Recursively Typed Complex Objects". J. Comput. Syst. Sci., 47(1):121-156, 1993.
25. G. Jaeschke and H.-J. Schek. "Remarks on the Algebra of NOD First Normal Form Relations". In Proc. PODS'82, pnges 124-138, 1982.
26. 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.
27. C. Koch, S. Scherzinger, N. Schweikardt, and B. Stegmaier, "Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams". In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), Toronto, Canada, 2004.
28. G. Kuper and M. Y. Vardi. "A New Approach to Database Logic". In Proceedings of the 3rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'84), pages 86-96, 1984.
29. G. Kuper and M. Y. Vardi. "On the Complexity of Queries in the Logical Data Model". Theor. Comput. Sci., 116(1&2):33-57, 1993.
30. L. Libkin and L. Wong. "Query Languages for Bags and Aggregate Functions". Journal of Computer and System Sciences, 55(2):241-272, 1997.
31. B. Ludäscher, P. Mukhopadhyay, and Y. Papakonstantinou. "A Transducer-Based XML Query Processor". In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB), pages 227-238, 2002.
32. A. Marian and J. Siméon. "Projecting XML Documents". In Proceedings of the 29th International Conference on Very Large Data Bases (VLDB), pages 213-224, 2003.
33. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
34. J. Paredaens and D. Van Gucht. "Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions". In Proc. PODS, pages 29-38, 1988.
35. 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), pages 167-178, 2003.
36. D. Suciu and V. Tannen. "A Query Language for NC". In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'94), pages 167-178, 1994.
37. V. Tannen, P. Buneman, and L. Wong. "Naturally Embedded Query Languages". In Proc. of the 4th International Conference on Database Theory (ICDT), pages 140-154, 1992.
38. 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.
39. S. Vorobyov and A. Voronkov. "Complexity of Nonrecursive Logic Programs with Complex Values". In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'98), 1998.
40. A. Voronkov. Personal communication, 2004.
41. L. Wong. "Normal Forms and Conservative Extension Properties for Query Languages over Collection Types", Journal of Computer and System Sciences, 52(3):495-505, 1996.
42. 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/.
43. "XML Query Use Cases. W3C Working Draft 02 May 2003", 2003. http://www.w3.org/TR/xmlquery-use-cases/.