Graphical specification of recursive queries
Part of the Lecture Notes in Computer Science book series (LNCS, volume 497)
Databases And Information Systems
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.
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
© Springer-Verlag Berlin Heidelberg 1991