Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Graph data model and its data language
Kunii H., Springer-Verlag New York, Inc., New York, NY, 1990. Type: Book (9780387700588)
Date Reviewed: Dec 1 1991

The graph data model (GDM) is so called because its basic schema, consisting of record types and binary link types, constitutes a directed graph. GDM combines features and inherits advantages of many of the earlier models. As in network and hierarchical systems, navigation and efficiency are provided for. GDM also, like the relational model, offers flexibility, set-at-a-time queries, and the possibility of complex relationships; in fact, GDM’s Data Manipulation Language, allowing transitive closure and numerical quantification, goes beyond the expressive power of relationally complete systems. Finally, one can translate the high-level semantics found in semantic models, especially the popular entity-relationship model, into GDM.

The author began her work on this subject as a Ph.D. student at the University of Texas in 1979. Since then she has overseen two implementations of GDM in the DBMS laboratory of Ricoh’s Software Research Center, of which she is now general manager. In fact, one of the remarkable aspects of this book is the breadth of its development of GDM, ranging from an axiomatic exposition to a treatment of such practical ideas as access path strategies and a cost model for query evaluation.

Given this wide coverage, various groups will find this book of substantial interest. Theoreticians and members of the database research community will appreciate the formal exposition, while practitioners will be interested in issues of implementation.

Seven chapters and two appendices make up this monograph:

  • Introduction

  • Graph Data Model

  • Data Definition Language

  • Data Manipulation Language

  • Implementation of GDL [Graph Data Language]

  • A Comparison of Access Path Strategies

  • Conclusions

Appendix A is “A BNF Grammar of GDL,” and Appendix B gives the “Specification of Run-time System.”

The author develops all of these topics carefully and formally, even the implementation issues of chapters 5 and 6 and appendix B. The metric for the cost of query evaluation algorithms presented in chapter 6 is Yao’s model [1]. The depth and breadth of Kunii’s treatment are appropriately thorough throughout, but I would have appreciated a detailed discussion of GDM as a data model against the background of general models described in the classic book by Tsichritzis and Lochovsky [2]. The index is good, the bibliography is excellent, and the foreword is by Gio Wiederhold.

Reviewer:  D. Goelman Review #: CR115222
1) Yao, S. B. Optimization of query evaluation algorithms. ACM Trans. Database Syst. 4, 2 (June 1979), 133–155.
2) Tsichritzis, D. C. and Lochovsky, F. H. Data models. Prentice-Hall, Englewood Cliffs, NJ, 1981.
Bookmark and Share
 
Data Models (H.2.1 ... )
 
 
Graphs And Networks (E.1 ... )
 
 
Query Processing (H.2.4 ... )
 
 
Languages (H.2.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Data Models": Date
A transient hypergraph-based model for data access
Watters C., Shepherd M. ACM Transactions on Information Systems 8(2): 77-102, 2001. Type: Article
Jun 1 1991
Toward a unified framework for version modeling in engineering databases
Katz R. ACM Computing Surveys 22(4): 375-409, 2001. Type: Article
Feb 1 1993
Data theory
Jones P., Paul E. J., Prentice-Hall, Inc., Upper Saddle River, NJ, 1991. Type: Book (9780131997042)
Jun 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy