Skip to main content
SpringerLink
Log in

The power of languages for the manipulation of complex values

  • Regular Journal Articles
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Various models and languages for describing and manipulating hierarchically structured data have been proposed. Algebraic, calculus-based, and logic-programming oriented languages have all been considered. This article presents a general model for complex values (i.e., values with hierarchical structures), and languages for it based on the three paradigms. The algebraic language generalizes those presented in the literature; it is shown to be related to the functional, style of programming advocated by Backus (1978). The notion of domain independence (from relational databases) is defined, and syntactic restrictions (referred to as safety conditions) on calculus queries are formulated to guarantee domain independence. The main results are: The domain-independent calculus, the safe calculus, the algebra, and the logic-programming oriented language have equivalent expressive power. In particular, recursive queries, such as the transitive closure, can be expressed in each of the languages. For this result, the algebra needs the powerset operation. A more restricted version of safety is presented, such that the restricted safe calculus is equivalent to the algebra without the powerset. The results are extended to the case where arbitrary functions and predicates are used in the languages.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abiteboul, S. and Bidoit, N. Non first normal form relations: An algebra allowing data restructuringJCSS, 1986.

  • Abiteboul, S. and Beeri, C. On the power of languages for the manipulation of complex objects. INRIA TR 846, Rocquencourt, France, 1988.

  • Abiteboul, S. and Grumbach, S. A logical approach to the manipulation of complex objects.Proceedings of the EDBT, Venice, Italy, 1988.

  • Abiteboul, S. and Hillebrand, G. Space usage in functional query languages.Proceedings of the International Conference on Database Theory, Prague, 1994.

  • Abiteboul, S. and Hull, R. Object restructuring in semantic database models.Proceedings of the ICDT, Rome, 1986.

  • Abiteboul, S. and Hull, R. IFO: A formal semantic database model.TODS, 12(4):525–565, 1988.

    Google Scholar 

  • Abiteboul, S., Hull, R., and Vianu, V.Foundations of Databases, Reading, MA: Addison-Wesley, 1994.

    Google Scholar 

  • Abiteboul, S. and Kanellakis, P.C. Object identity as a query language primitive.Proceedings of the ACM Sigmod, Portland, OR, 1989.

  • Aho, A.V. and Ullman, J.D. Universality of data retrieval languages.Proceedings of POPL, San Antonio, TX, 1979.

  • Apt, K., Blair, H. and Walker, A. Toward a theory of declarative knowledge. In: Minker, J.., ed.Foundations of Deductive Databases and Logic Programming. San Francisco: Morgan Kaufmann, 1988.

    Google Scholar 

  • Backus, J. Can programming be liberated from the von Neuman style? A functional style of programming and its algebra of programs. 1977 Turing Award Lecture.CACM 21:8, 1978.

    Google Scholar 

  • Bancilhon, F., Cluet, S., and Delobel, C. Query languages for object-oriented database systems: The O2 proposal.Proceedings of the Second International Workshop on Data Base Programming Languages, Roscoff, France, 1989.

  • Beeri, C. Bulk types and their query languages.Proceedings of the NATO ASI Summer School on OODB's, Turkey, 1993.

  • Beeri, C. and Milo, T. Functional, and predicative database programming.Proceedings of the Eleventh PODS, San Diego, CA, 1992.

  • Beeri, C., Naqvi, S., Ramakrishnan, R., Shmueli, O., and Tsur, S. Sets and negation in a logic database language.Proceedings of the Sixth PODS, San Diego, CA, 1987.

  • Beeri, C., Naqvi, S., Shmueli, O., and Tsur, S. ??????? and negation in a logic database language.Journal of Logic Programming, 1987?

  • Breazu-Tannen, V., Buneman, P., and Wong, L. Naturally embedded query languages. To appear,ICDT, 1992.

  • Buneman, P., Libkin, L., Suciu, D., Tannen, V., and Wong, L. Comprehensions syntax.Sigmod Record, 23(1):87–96, March 1994.

    Google Scholar 

  • Chen, L. Extension of datalog with aggregation functions.Proceedings of the IV journees bases de Donnees Avancees, Rocquencourt, France, 1988.

  • Chandra, A.K. and Harel, D. Computable queries for relational database systems.JCSS, 21(2):156–178, 1980.

    Google Scholar 

  • Cluet, S., Delobel, C., Lecluse, C., and Richard, P. RELOOP, an algebra based query language for an object-oriented database system.Data and Knowledge Engineering, 5:333–352, 1990.

    Google Scholar 

  • Codd, E.F. A relational model for large shared data banks.CACM, 13(6), 1970.

  • Dalhaus E. and J. Makowski. Computable directory queries. Manuscript, the Technion, Haife, August, 1985.

  • DiPaola, R. A. The recursive unsolvability of the decision problem for a class of definite formulas.Journal of the Association of Computing Machinery, 16(2).:324–327, 1969.

    Google Scholar 

  • Fagin, R. Horn clauses and database dependencies.JACM, 29(4):952–985, 1982.

    Google Scholar 

  • Fischer, P. and Thomas, S. Operators for non-first-normal-form relations.Proceedings of the Seventh COMPSAC, Chicago, 1983.

  • Grey, P.Logic Algebra and Databases, Ellis Norwood Series on Computers and their Applications, 1984.

  • Grumbach, S. and Vianu, V. Tractable query languages for complex object databases,Proceedings of the ACM PODS, Denver, CO, 1991.

  • Gyssens, M. and Van Gucht, D. The powerset algebra as a result of adding programming constructs to the nested relational algebra.Proceedings of the ACM SIGMOD, Chicago, IL, 1988.

  • Hammer, M. and McLeod, D. Data description with SDM: A semantic database model.TODS, 6(3):351–386, 1981.

    Google Scholar 

  • Hillebrand, G., Kanellakis, P., and Mairson, H. Database query languages embedded in the typed lambda calculus.Proceedings of the LICS, Montreal, Canada, 1993.

  • Hillebrand, G., Kanellakis, P., and Mairson, H. Database query languages embedded in the typed lambda calculus.Proceedings of the LICS, Montreal, Canada, 1993.

  • Hull, R. A survey of theoretical research on typed complex database objects. Unpublished manuscript, USC, 1986.

  • Hull, R. and Su, J. On the expressive power of database queries with intermediate types.JCSS, 43:219–267, 1991.

    Google Scholar 

  • Hull, R. and Yap, C. The format model: A theory of database organization.JACM, 31:3, 1984.

    Google Scholar 

  • Jacobs, B. On database logic.JACM, 29:2, 1982.

    Google Scholar 

  • Jaeschke, B. and Schek, H.-J. Remarks on the algebra of non first normal form relations.Proceedings of the First PODS, Los Angeles, 1982.

  • Klug, A. Equivalence of relational algebra and calculus query languages having aggregate functions.JACM, 29:3, 1982.

    Google Scholar 

  • Kobayashi, I. An overview of database management technology. TR CS-4-1, Sanno College, Kanagawa 259-11, Japan, 1980.

    Google Scholar 

  • Korth, H.F., Roth, M. A., and Silberschatz, A. Extended algebra and calculus fornotNF relational databases.TODS, 13(4):389–417, 1988.

    Google Scholar 

  • Kuper, G.M. Logic programming with sets.Proceedings of the Sixth PODS, San Diego, CA, 1987.

  • Kuper, G.M. On the expressive power of logic programming languages with sets.Proceedings of the ACM PODS, Austin, TX, 1988.

  • Kuper, G.M. and Vardi, M.Y. A new approach to database logic.Proceedings of the Third PODS, Waterloo, Ontario, Canada, 1984.

  • Kuper, G. and Vardi, M. Y. On the complexity of queries in the logical data model.Theoretical Computer Science, 116:33–58, 1993.

    Google Scholar 

  • Libkin, L. and Wong, L. Some properties of query languages for bags.Proceedings of the DBPL, New York, NY, 1993a.

  • Libkin, L. and Wong, L. Aggregate functions, conservative extension, and linear orders.Proceedings of the ACM PODS, Washington, DC, 1993b.

  • Libkin, L. and Wong, L. New techniques for studying set languages, bags languages, and aggregate functions.Proceedings of the ACM PODS, Minneapolis, MN, 1994.

  • Macleod, I. A. A database management system for document retrieval applications.Information Systems, 6:(2):131–137, 1981.

    Google Scholar 

  • Makinouchi, A. A consideration on normal form of not-necessarily normalized relations in the relational model.Proceedings of the Third VLDB, 1977.

  • Naqvi, S. A. A logic for negation in database systems.Proceedings of the Foundations of Deductive Databases and Logic Programming, 1986.

  • Ozsoyoglu, G. and Ozsoyoglu, Z. An extension of relational algebra for summary tables.Proceedings of the Second International (LBL) Conference on Statistical Database Management, 1983.

  • Ozsoyoglu, G, Ozsoyoglu, Z., and Matos, V. Extending relational, algebra and relational calculus with set-valued attributes and aggregate functions.TODS, 12(4):566–592, 1987.

    Google Scholar 

  • Paredaens, J. and Van Gucht, D. Possibilities and limitations of using flat operators in nested algebra expressions.Proceedings of the ACM PODS, Austin, TX, 1988.

  • Peyton-Jones, S.L.The Implementation of Functional Programming Languages. Englewood Cliffs, NJ: Prentice Hall, 1987.

    Google Scholar 

  • Schek H.-J. and Scholl, M. An algebra for the relational model with relation-valued attributes.Information Systems, 11(2):137–147, 1986.

    Google Scholar 

  • Suciu, D. and Paredaens, J. Any algorithm in the complex algebra with powerset needs exponential space to compute transitive closure.Proceedings of the Thirteenth PODS, Minneapolis, MN, 1994.

  • Trinder, P.W. Comprehensions: A query notation for DBPLs.Proceedings of the Third DBPL Workshop, Napflion, Greece, 1991.

  • Ullman, J.D.Principles of Database Systems. Potomac, MD: Computer Science Press, 2nd ed., 1982.

    Google Scholar 

  • Van Gelder, A. Negation as failure using tight derivations for general logic programs. In: Minker, J., ed.Foundations of Deductive Databases and Logic Programming. San Francisco: Morgan Kaufmann, 1988.

    Google Scholar 

  • Van Gelder, A. and R. Topor. Safety and correct translation of relational calculus queries.Proceedings of the Sixth PODS, 1987.

  • Vardi, M.Y. The decision problem for database dependencies.Information Processing Letter, 12(5):251–254, 1981.

    Google Scholar 

  • Wadler, P. Comprehending monads.Proceedings of the Conference on Lisp and Functional Programming, 1990.

  • Wong, L. Normal forms and conservative properties for query languages over collection types.Proceedings of the Twelfth PODS, Washington, DC, 1993.

Download references

Author information

Authors and Affiliations

  1. INRIA Rocquencourt, Domaine de Voluceau, BP 105, F-78153, Le Chesnay Cedex, France

    Serge Abiteboul (Researcher)

  2. Department of Computer Science, The Hebrew University, Givat-Ram, 91904, Jerusalem, Israel

    Catriel Beeri (Full Professor)

Authors
  1. Serge Abiteboul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Catriel Beeri
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abiteboul, S., Beeri, C. The power of languages for the manipulation of complex values. VLDB Journal 4, 727–794 (1995). https://doi.org/10.1007/BF01354881

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01354881

Key Words

Search

Navigation