Complex object multi-level fixpoint queries | Annals of Mathematics and Artificial Intelligence Skip to main content
Springer Nature Link
Log in

Complex object multi-level fixpoint queries

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Recent research in extending the standard algebra for nested relations of Thomas and Fischer follows two 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. These two lines are studied and combined in a natural and general framework.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

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

  2. S. Abiteboul, C. Beeri, M. Gyssens and D. Van Gucht, An introduction to the completeness of languages for complex objects and nested relations, in: ref. [4] pp. 115–138.

  3. S. Abiteboul and N. Bidoit, Non first normal relations: An algebra allowing data restructuring, J. Comput. Syst. Sci. 33(1986)361–393.

    Google Scholar 

  4. S. Abiteboul, P. Fischer and H.-J. Schek (eds.),Nested Relations and Complex Objects in Databases, Lecture Notes in Computer Science 361 (Springer, 1989).

  5. F. Bancilhon and S. Khoshafian, A calculus for complex objects, J. Comput. Syst. Sci., 38(1989)326.

    Google Scholar 

  6. N. Bidoit, The Vero algebra or how to answer queries with fewer joins, J. Comput. Syst. Sci. 35(1987)321–364.

    Google Scholar 

  7. H. Boral and P.A. Larson (eds.),1988 Proc. SIGMOD Int. Conf. on the Management of Data (ACM Press, 1988).

  8. E. Codd, A relational model for large shared databanks, Commun. ACM 13(1970)377–387.

    Google Scholar 

  9. L.S. Colby, A recursive algebra and query optimization for nested relations, in:Proc. 1989 ACM SIGMOD Int. Conf. on the Management of Data, ed. J. Clifford, B. Lindsay and D. Maier (ACM Press, 1989) pp. 273–283.

  10. L.S. Colby, A recursive algebra for nested relations, Inf. Syst. 15(1990)567–582.

    Google Scholar 

  11. P. Fischer, L. Saxton, S. Thomas and D. Van Gucht, Interactions between dependencies and nested relational structures, J. Comput. Syst. Sci. 31(1986)343–354.

    Google Scholar 

  12. M. Gyssens, J. Paredaens and D. Van Gucht, A uniform approach towards handling atomic and structured information in the nested relational database model, J. ACM 36(1989)790–825.

    Google Scholar 

  13. M. Gyssens and D. Van Gucht, The powerset operator as a natural tool to handle nested database relations, J. Comput. Syst, Sci., to appear. An extended abstract appeared under a different title in ref. [7] pp. 225–232.

  14. R. Hull and J. Su, On bulk data type constructors and manipulation primitives: a framework for analyzing expressive power and complexity, in:Proc. 2nd Int. Workshop on Database Programming Languages, ed. R. Hull, R. Morrison and D. Stemple, The Morgan Kaufmann Series in Data Management Systems (Morgan Kaufmann, 1989) pp. 396–410.

  15. G. Jaeshke and H.-J. Schek, Remarks on the algebra of non-first normal form relations, in:1st ACM Sym. on Principles of Database Systems (ACM Press, 1982) pp. 124–138.

  16. J. Paredaens, P. De Bra, M. Gyssens and D. Van Gucht,The Structure of the Relational Database Model, EATCS Monographs on Theoretical Computer Science 17 (Springer, 1989).

  17. M. Roth, H. Korth and A. Silberschatz, Extended algebra and calculus for nested relational databases, ACM Trans. Database Systems 13(1988)389–417.

    Google Scholar 

  18. H.-J. Schek and M.H. Scholl, The relational model with relation-valued attributes, Inf. Syst. 11(1986)137–147.

    Google Scholar 

  19. M.H. Scholl, Theoretical foundations of algebraic optimization utilizing unnormalized relations, in:Proc. Int. Conf. on Database Theory, Lecture Notes in Computer Science 243 (Springer, 1986) pp. 408–420.

  20. S. Thomas and P. Fischer, Nested relational structures, in:The Theory of Databases, ed. P. Kanellakis (JAI Press, 1986) pp. 269–307.

  21. J. Ullman,Principles of Database and Knowledge-Base Systems, Vol. 1 (Computer Science Press, 1988).

  22. J. Ullman,Principles of Database and Knowledge-Base Systems, Vol. 2 (Computer Science Press, 1989).

  23. J. Van den Bussche, Complex object multi-level fixpoint queries, in:Proc. 3rd Symp. on Mathematical Fundamentals of Database and Knowledge Base Systems, Lecture Notes in Computer Science 495 (Springer, 1991) pp. 1–13.

  24. J. Van den Bussche, Evaluation and optimization of complex object selections, in:Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, Lecture Notes in Computer Science 566 (Springer, 1991) pp. 226–243.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer 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 inPubMed Google Scholar

Additional information

A preliminary version of this article appeared as [23]. The work reported in this article was supported by the IWONL and the NFWO.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Van den Bussche, J. Complex object multi-level fixpoint queries. Ann Math Artif Intell 7, 41–62 (1993). https://doi.org/10.1007/BF01556349

Download citation

  • Issue Date:

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

Keywords