Data schemata based on directed graphs |
| |
Authors: | C C Gotlieb A L Furtado |
| |
Affiliation: | (1) Department of Computer Science, University of Toronto, Ontario, Canada;(2) Present address: Pontificia Universidade Catolica do Rio de Janeiro, Brazil |
| |
Abstract: | Rooted, labeled, directed graphs (RLDs) are taken as the basis for describing data structures. A constructive formalism is set up to describe RLDs, generate them by means of grammars, and carry out operations such as accessing nodes, inserting and deleting data items, and recognizing graph patterns. It is shown how the formalism can be translated into languages for data definition and data manipulation, of the type associated with data-base systems. The availability of the formalism allows a systematic development of such languages, and provides a method of incorporating consistency preconditions to structural operations and proving the correctness of the data structures that arise in using such languages. |
| |
Keywords: | Data structures graphs digraphs directed graphs graph grammars data-base systems data manipulation languages data definition languages schema |
本文献已被 SpringerLink 等数据库收录! |
|