Skip to main content
SpringerLink
Log in
Book cover

Symposium on Mathematical Fundamentals of Database Systems

MFDBS 1991: MFDBS 91 pp 1–13Cite as

Complex object multi-level fixpoint queries

  • Complex Objects
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 495))

Abstract

Recent research in extending the standard algebra for nested relations of Thomas and Fischer goes along two orthogonal lines. One is concerned with expressing queries which involve deeply nested information in a flexible way, avoiding the need for explicit restructuring through nesting and unnesting. Another deals with extending the expressive power of the nested algebra, by providing iteration or recursion constructs, such as fixpoints. In this note we investigate how these two lines of extending the nested algebra can be combined.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul and N. Bidoit. Non first normal form relations: An algebra allowing data restructuring. Journal of Computer and System Sciences, 33(3):361–393, 1986.

    Article  Google Scholar 

  2. S. Abiteboul and C. Beeri. On the power of languages for the manipulation of complex objects. Technical Report 846, INRIA, 1988.

    Google Scholar 

  3. S. Abiteboul, C. Beeri, M. Gyssens, and D. Van Gucht. An introduction to the completeness of languages for complex objects and nested relations. In Abiteboul et al. [AFS89], pages 115–138.

    Google Scholar 

  4. Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM Press, 1988.

    Google Scholar 

  5. S. Abiteboul, P. Fischer, and H.-J. Schek, editors. Nested Relations and Complex Objects in Databases. Number 361 in Lecture Notes in Computer Science. Springer-Verlag, 1989.

    Google Scholar 

  6. N. Bidoit. The Verso algebra or how to answer queries with fewer joins. Journal of Computer and System Sciences, 35(3):321–364, 1987.

    Google Scholar 

  7. C. Beeri and Y. Kornatzky. The many faces of query monotonicity. In F. Bancilhon, C. Thanos, and D. Tsichritzis, editors, International Conference on Extending Database Technology, Proceedings, number 416 in Lecture Notes in Computer Science, pages 120–135. Springer-Verlag, 1990.

    Google Scholar 

  8. J. Clifford, B. Lindsay, and D. Maier, editors. Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data, number 18:2 in SIGMOD Record. ACM Press, 1989.

    Google Scholar 

  9. E. Codd. A relational model for large shared databanks. Communications of the ACM, 13(6):377–387, 1970.

    Article  Google Scholar 

  10. L. Colby. A recursive algebra for nested relations. Technical Report 259, Indiana University, Dept. Comp. Science, 1988.

    Google Scholar 

  11. L. Colby. A recursive algebra and query optimization for nested relations. In Clifford et al. [CLM89], pages 273–283.

    Google Scholar 

  12. P. Fischer, L. Saxton, S. Thomas, and D. Van Gucht. Interactions between dependencies and nested relational structures. Journal of Computer and System Sciences, 31(3):343–354, 1986.

    Google Scholar 

  13. M. Gyssens, J. Paredaens, and D. Van Gucht. A uniform aproach towards handling atomic and structured information in the nested relational database model. Journal of the ACM, 36(4):790–825, 1989.

    Google Scholar 

  14. M. Gyssens, J. Paredaens, and D. Van Gucht. On a hierarchy of classes for nested databases. Information Processing Letters, 36:259–266, 1990.

    Google Scholar 

  15. M. Gyssens and D. Van Gucht. The powerset operator as a result of adding programming constructs to the nested algebra. In H. Boral and P.A. Larson, editors, 1988 Proceedings SIGMOD International Conference on Management of Data, pages 225–232. ACM Press, 1988.

    Google Scholar 

  16. R. Hull and J. Su. On bulk data type constructors and manipulation primitives: a framework for analyzing expressive power and complexity. In R. Hull, R. Morrison, and D. Stemple, editors, Proceedings of the Second International Workshop on Database Programming Languages, The Morgan Kaufmann Series in Data Management Systems, pages 396–410. Morgan Kaufmann, 1990.

    Google Scholar 

  17. G. Jaeshke and H.-J. Schek. Remarks on the algebra on non-first normal form relations. In 1st ACM Symposium on Principles of Database Systems, pages 124–138. ACM Press, 1982.

    Google Scholar 

  18. J. Paredaens, P. De Bra, M. Gyssens, and D. Van Gucht. The Structure of the Relational Database Model. Number 17 in EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1989.

    Google Scholar 

  19. M. Roth, H. Korth, and A. Silberschatz. Extended algebra and calculus for nested relational databases. ACM Transactions on Database Systems, 13(4):389–417, 1988.

    Article  Google Scholar 

  20. H.-J. Schek and M.H. Scholl. The relational model with relation-valued attributes. Information Systems, 11(2):137–147, 1986.

    Article  Google Scholar 

  21. A. Tarski. A lattice theoretical fixpoint theorem and its applications. Pacific J. Math., 5(2):285–309, 1955.

    Google Scholar 

  22. S. Thomas and P. Fischer. Nested relational structures. In P. Kanellakis, editor, The Theory of Databases, pages 269–307. JAI Press, 1986.

    Google Scholar 

  23. J. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, 1988–1989.

    Google Scholar 

  24. D. Van Gucht and P. Fischer. Multilevel nested relational structures. Journal of Computer and System Sciences, 36(1):77–105, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Math. & Comp. Science, University of Antwerp (UIA), Universiteitsplein 1, B-2610, Antwerp, Belgium

    Jan Van den Bussche

Authors
  1. Jan Van den Bussche
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Thalheim János Demetrovics H. -D. Gerhardt

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van den Bussche, J. (1991). Complex object multi-level fixpoint queries. In: Thalheim, B., Demetrovics, J., Gerhardt, H.D. (eds) MFDBS 91. MFDBS 1991. Lecture Notes in Computer Science, vol 495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54009-1_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-54009-1_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54009-0

  • Online ISBN: 978-3-540-47348-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation