Abstract
We define a class of graphs that represent object-oriented databases. Queries, updates and restructurings in such databases are performed by transformations of these graphs. We therefore first define five transformation-operations on this graph-class. Then we define generic transformations as a natural generalization of the concept of BP-completeness, originally defined for the relational database model. Our main result states that the language consisting of the five transformation-operations expresses exactly the generic transformations.
The work of this author was supported by the I.W.O.N.L.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Mariano Consens and Alberto Mendelzon. GraphLog: a visual formalism for real life recursion. In Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 404–416, April 1990.
C. Beeri. A formal approach to object-oriented databases. Data & Knowledge Engineering, 5(4):353–382, 1990.
Marc Gyssens, Jan Paredaens, and Dirk Van Gucht. A graph-oriented object database model. In Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 417–424, April 1990.
Marc Gyssens, Jan Paredaens, and Dirk Van Gucht. A graph-oriented object model for end-user interfaces. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pages 24–33, May 1990.
Jan Paredaens. On the expressive power of the relational algebra. Information Processing Letters, 7(2):107–111, february 1978.
Francois Bancilhon. On the completeness of query languages for relational data bases. In Proceedings of the 7th Symposium on Mathematical Foundations of Computer Science, volume 64 of Lecture Notes in Computer Science, pages 112–123, Berlin, 1978. Springer-Verlag.
Ashok K. Chandra and David Harel. Computable queries for relational databases. Journal of Computer and System Sciences, 21:156–178, 1980.
Marc Andries and Jan Paredaens. An algebraic characterization for the GOOD-transformation language. Technical Report 91-11, University of Antwerp (U.I.A.), 1991.
Béla Bollobás. Graph Theory (An Introductory Course). Number 63 in Graduate Texts in Mathematics. Springer Verlag, New York Heidelberg Berlin, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andries, M., Paredaens, J. (1992). A language for generic graph-transformations. In: Schmidt, G., Berghammer, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 1991. Lecture Notes in Computer Science, vol 570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55121-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-55121-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55121-8
Online ISBN: 978-3-540-46735-9
eBook Packages: Springer Book Archive