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.
Preview
Unable to display preview. Download preview PDF.
References
M. P. Atkinson & O. P. Buneman, "Types and Persistence in Database Programming Languages", ACM Computing Surveys, Vol. 19, No. 2, 1987, 105–190.
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.
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights 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