Skip to main content
SpringerLink
Log in

Graphical specification of recursive queries

  • Databases And Information Systems
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '91 (ICCI 1991)

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

Included in the following conference series:

  • 117 Accesses

Abstract

We describe an OR database model and transformation operators on this model. A graphical query language based on these operators allows the user to specify conveniently a subclass of recursive queries.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. P. Atkinson & O. P. Buneman, "Types and Persistence in Database Programming Languages", ACM Computing Surveys, Vol. 19, No. 2, 1987, 105–190.

    Article  Google Scholar 

  2. R. Agrawal, "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries", IEEE Transactions on Software Engineering, Volume 14, Number 7, July 1988, 879–885.

    Article  Google Scholar 

  3. D. M. Campbell, D. W. Embley & B. Czejdo, "Graphical Query Formulation for an Entity-Relationship Model", Data & Knowledge Engineering, Volume 2, Number 1, June 1987, 89–121.

    Google Scholar 

  4. P. P. Chen, "The Entity-Relationship Model: Toward a Unified View of Data", ACM Transaction on Database Systems, Volume 1, Number 1, January 1976, 9–36.

    Article  Google Scholar 

  5. B. Czejdo & D. W. Embley, "An Approach to Computation Specification for an Entity-Relationship Query Language", Proceedings of the Sixth International Conference on Entity-Relationship Approach, New York, New York, November 1987, 307–321.

    Google Scholar 

  6. B. Czejdo, R. Elmasri, M. Rusinkiewicz & D. W. Embley, "An Algebraic Language for Graphical Query Formulation Using an Extended Entity-Relationship Model", ACM Fifteenth Annual Computer Science Conference, February 1987, 154–161.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Loyola University, 70118, New Orleans, Louisiana

    Bogdan D. Czejdo & Ralph P. Tucci

  2. Department of Computer Science, Brigham Young University, 84602, Provo, Utah

    David W. Embley

Authors
  1. Bogdan D. Czejdo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ralph P. Tucci
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David W. Embley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Frantisek Fiala Waldemar W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Czejdo, B.D., Tucci, R.P., Embley, D.W. (1991). Graphical specification of recursive queries. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_174

Download citation

  • DOI: https://doi.org/10.1007/3-540-54029-6_174

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54029-8

  • Online ISBN: 978-3-540-47359-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation