Abstract
Most existing studies on the expressive power of query languages have focused on what queries can be expressed and what queries cannot be expressed in a query language. They do not tell us much about whether a query can be implemented efficiently in a query language. Yet, paradoxically, efficiency is a key concern in computer science. In this paper, the efficiency of queries in \(\mathcal{NRC}(powerset)\), a nested relational calculus with a powerset operation, is discussed. A dichotomy in the efficiency of these queries on a large general class of structures—which include long chains, deep trees, etc.—is proved. In particular, it is shown that these queries are either already expressible in the usual nested relational calculus or require at least exponential space. This Dichotomy Theorem, when coupled with the bounded degree and locality properties of the usual nested relational calculus becomes a powerful general tool in studying the intensional expressive power of query languages. The bounded degree and locality properties make it easy to prove that a query is inexpressible in the usual nested relational calculus. Then, if the query is expressible in \(\mathcal{NRC}(powerset)\), subject to the conditions of the Dichotomy Theorem, the query must take at least exponential space.
Supported in part by a Singapore Ministry of Education grant MOE-T1-251RES1206.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Beeri, C.: The power of languages for the manipulation of complex values. The VLDB Journal 4(4), 727–794 (1995)
Abiteboul, S., Vianu, V.: Generic computation and its complexity. In: Proceedings of 23rd ACM Symposium on the Theory of Computing, pp. 209–219 (1991)
Breazu-Tannen, V., Buneman, P., Wong, L.: Naturally embedded query languages. In: Proceedings of 4th International Conference on Database Theory, Berlin, Germany, October 1992, pp. 140–154 (1992)
Buneman, P., Naqvi, S., Tannen, V., Wong, L.: Principles of programming with complex objects and collection types. Theoretical Computer Science 149(1), 3–48 (1995)
Colson, L.: About primitive recursive algorithms. Theoretical Computer Science 83, 57–69 (1991)
Dong, G., Libkin, L., Wong, L.: Local properties of query languages. In: Proceedings of 6th International Conference on Database Theory, pp. 140–154 (1997)
Dong, G., Libkin, L., Wong, L.: Local properties of query languages. Theoretical Computer Science 239, 277–308 (2000)
Gaifman, H.: On local and non-local properties. In: Proceedings of the Herbrand Symposium, Logic Colloquium ’81, pp. 105–135 (1982)
Hella, L., Libkin, L., Nurmonen, J., Wong, L.: Logics with aggregate operators. Journal of the ACM 48(4), 880–907 (2001)
Libkin, L., Wong, L.: Conservativity of nested relational calculi with internal generic functions. Information Processing Letters 49(6), 273–280 (1994)
Libkin, L., Wong, L.: New techniques for studying set languages, bag languages, and aggregate functions. In: Proceedings of 13th ACM Symposium on Principles of Database Systems, pp. 155–166 (1994)
Libkin, L., Wong, L.: Query languages for bags and aggregate functions. Journal of Computer and System Sciences 55(2), 241–272 (1997)
Suciu, D., Paredaens, J.: Any algorithm in the complex object algebra needs exponential space to compute transitive closure. In: Proceedings of 13th ACM Symposium on Principles of Database Systems, pp. 201–209 (1994)
Suciu, D., Paredaens, J.: The complexity of the evaluation of complex algebra expressions. Journal of Computer and Systems Sciences 55(2), 322–343 (1997)
Suciu, D., Wong, L.: On two forms of structural recursion. In: Proceedings of 5th International Conference on Database Theory, pp. 111–124 (1995)
Wong, L.: Normal forms and conservative properties for query languages over collection types. In: Proceedings of 12th ACM Symposium on Principles of Database Systems, pp. 26–36 (1993)
Wong, L.: Normal forms and conservative extension properties for query languages over collection types. Journal of Computer and System Sciences 52(3), 495–505 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wong, L. (2013). The Dichotomous Intensional Expressive Power of the Nested Relational Calculus with Powerset. In: Tannen, V., Wong, L., Libkin, L., Fan, W., Tan, WC., Fourman, M. (eds) In Search of Elegance in the Theory and Practice of Computation. Lecture Notes in Computer Science, vol 8000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41660-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-41660-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41659-0
Online ISBN: 978-3-642-41660-6
eBook Packages: Computer ScienceComputer Science (R0)