Abstract
A Graph Data Model (GDM) is proposed as a practical solution to the problems from which other data models suffer. The basic concepts developed in GDM are:
-
— Directed graphs as the formalizable basis for data representation structuring and operations
-
— Logical representation of access paths in terms of links (arcs)
-
— Algebraic definitions of operations on a graph including powerful link operators (operations on links)
-
— Concept of record lists to allow the unified manipulation of records and links during query processing
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Tokyo
About this chapter
Cite this chapter
Kunii, H.S. (1990). Conclusions. In: Graph Data Model. Springer, Tokyo. https://doi.org/10.1007/978-4-431-68114-4_7
Download citation
DOI: https://doi.org/10.1007/978-4-431-68114-4_7
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-68116-8
Online ISBN: 978-4-431-68114-4
eBook Packages: Springer Book Archive