skip to main content
article
Free Access

A recursive algebra and query optimization for nested relations

Published:01 June 1989Publication History
Skip Abstract Section

Abstract

The nested relational model provides a better way to represent complex objects than the (flat) relational model, by allowing relations to have relation-valued attributes. A recursive algebra for nested relations that allows tuples at all levels of nesting in a nested relation to be accessed and modified without any special navigational operators and without having to flatten the nested relation has been developed. In this algebra, the operators of the nested relational algebra are extended with recursive definitions so that they can be applied not only to relations but also to subrelations of a relation. In this paper, we show that queries are more efficient and succinct when expressed in the recursive algebra than in languages that require restructuring in order to access subrelations of relations. We also show that most of the query optimization techniques that have been developed for the relational algebra can be easily extended for the recursive algebra and that queries are more easily optimizable when expressed in the recursive algebra than when they are expressed in languages like the non-recursive algebra.

References

  1. 1 Abiteboul, S., and Bidoit, N., "Non First Normal Form Relations to Represent Hierarchically Organized Data," Proc. 3rd PODS, 1984, pp. 191-200. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Bancilhon, F., Richard, P., and Scholl, M., "On Line Processing of Compacted Relations," Proc. 8th VLDB, Mexico City, 1982, pp. 21-37. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Bidoit, N., "The Verso Algebra or How to Answer Queries with Fewer Joins," Journal of Computer and System Sciences, 1987, pp. 321-364 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Codd, E.F., "A Relational Model for Large Shared Data Banks, " Communications ACM Vol. 6, No. 13, June 1970, pp. 377-387. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Colby, L.S., "A Recursive Algebra for Nested Relations," Technical Report, No. 259, August 1988, University of IndianaGoogle ScholarGoogle Scholar
  6. 6 Dadam, P., Kuespert, F., Andersen, F., Blanken, H., Erbe, R., Guenauer, J., Lure, V., Pistor, P., and Walch,G., "A DBMS Prototype to Support Extended NF2 Relations: An Integrated View on Flat Tables and Hierarchies," Proc. Annual SIGMOD Conf., Austin, 1986, pp. 356-366. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Deppisch, U., Paul, H.B., and Schek, H.J., "A Storage System for Complex Objects," Proc. Int. Workshop on Object- Oriented Database Systems, Pacific Grove, 1986, pp. 183-195. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Deshpande, V., and Larson, P.A., "An Algebra for Nested Relations," Tech. Report, CS-87-65, 1987, University of Waterloo.Google ScholarGoogle Scholar
  9. 9 Deshpande, A., and Van Gucht, D., "A Storage Structure for Unnormalized Relations," Proc. (71 Conf. on Database Systems for Office Automation, Engineering and Scientific Applications, Darmstadt, April 1987, pp. 481-486.Google ScholarGoogle Scholar
  10. 10 Gyssens, M. and Van Gucht, D., "The Powerset Algebra as a Result of Adding Programming Constructs to the Nested Relational Algebra," Proc. Annual SIGMOD Conf., Chicago, IL, June 1988 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Jaeshke, G., and Schek, H.J., "Remarks on the Algebra on Non-First Normal Form Relations," Proc. 1st PODS, Los Angeles, 1982, pp. 124-138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 Linnemann, V., "Non First Normal Form Relations and Recursive Queries: An SQL-Based Approach," Proc. 3rd IEEE Int. Conf. on Data Engineering, Los Angeles, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Makinouchi, A., "A Consideration of Normal Form of Not- Necessarily-Normalized Relations in the Relational Data Model," Proc. 3rd. VLDB, Tokyo 1977, pp. 447-453.Google ScholarGoogle Scholar
  14. 14 Ozsoyoglu, G., Ozsoyoglu, Z.M., and Matos, V., "Extending Relational Algebra and Relational Calculus with Set-Valued Attributes and Aggregate Functions," A CM Transactions on Database Systems, Vol. 12, No. 4, December 1987, pp. 566-592. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 Paul, H.B., Schek, H.J., Scholl, M.H., Weikum, G., and Deppisch, U., "Architecture and Implementation of the Darmstadt Database Kernel System," Proc., Annual SIGMOD Conf., San Francisco, 1987, pp. 196-207. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 Pistor, P., and Andersen, F., "Designing a generalized NF2 model with an SQL-Type Language Interface," Proc. 12th VLDB, Kyoto, Japan, 1986, pp. 278-288. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 Pistor, P., and Traunmueller, R., "A Database Language for Sets, Lists and Tables," Information Sys. tems, Vol 11, No. 4, 1986, pp. 323-336. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 Roth, M.A., Korth, H.F., and Batory, D.S., "SQL/- NF: A Query Language for ~INF Relational Databases," Information Systems, Vol 12, No. 1, 1987, pp. 99-114. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19 Roth, M.A., Korth, H.F., and Silberschatz, A., "Theory of Non-First-Normal-Form Relational Databases," Tech. Report TR-84-36 (Revised January 1986), University of Texas at Austin, 1984.Google ScholarGoogle Scholar
  20. 20 Roth, M.A., Korth, H.F., and Silberschatz, A., "Extended Algebra and Calculus for -~INF Relational Databases," Tech. Report TR.85.19, University of Texas at Austin, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21 Roth, M.A., Korth, H.F., and Silberschatz, A., "Null Values in --1NF Relational Databases," Tech. Report TR-85-32, University of Texas at Austin, December, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22 Schek, H.J., and Scholl, M.H., "The Relational Model with Relation-Valued Attributes," Information Systems, Vol. 11, No. 2, 1986, pp. 137-147. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23 Scholl, M.H., "Theoretical Foundation of Algebraic Optimization Utilizing Unnormalized Relations," Proceedings of the International Conference on Database Theory, September, 1986, Rome, Italy, pp. 380-396 Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24 Scholl, M.tt., Paul, tt.B., and Schek, H.J., "Supporting Flat Relations by a Nested Relational Kernel," Proc. 13th VLDB, London, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25 Thomas, S.J., and Fischer, P.C., "Nested Relational Structures," Advances in Computing Research III, The Theory of Databases, P.C. Kanellakis, ed., JAIpress, 1986, pp. 269-307.Google ScholarGoogle Scholar
  26. 26 Van Gueht, D., "Theory of Unnormalized Relational Structures," Ph.D. Dissertation, Vanderbilt University, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27 Van Gucht, D., "On the Expressive Power of the Extended Relational Algebra for the Unnormalized Relational Model," Proc. 6th PODS, San Diego, CA, March 1987, pp. 302-312. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. 28 Van Gucht, D., and Fischer, P.C., "Multilevel Nested Relational Structures," Journal of Computer and System Sciences, Vol. 36, No. 1, February 1988, pp. 77-105 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A recursive algebra and query optimization for nested relations

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM SIGMOD Record
              ACM SIGMOD Record  Volume 18, Issue 2
              June 1989
              442 pages
              • cover image ACM Conferences
                SIGMOD '89: Proceedings of the 1989 ACM SIGMOD international conference on Management of data
                June 1989
                451 pages
                ISBN:0897913175
                DOI:10.1145/67544

              Copyright © 1989 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 June 1989

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader