Showing papers on "Graph database published in 1978"
TL;DR: This paper treats the problem of fuzzy query translation using the concept of database skeleton, and formulated as a problem of converting a partially specified querygraph into a completely specified query graph.
Abstract: This paper treats the problem of fuzzy query translation using the concept of database skeleton. An imprecise, or fuzzy, query is represented by a query graph, which can be analyzed for translatability with respect to a given database skeleton. The fuzzy query translation problem is formulated as a problem of converting a partially specified query graph into a completely specified query graph. This graph is then translated into a sequence of data manipulation commands, such as commands in relational algebra. Approaches to optimal fuzzy query translation are also described.
45 citations
IBM1
TL;DR: Concepts on data structure, storage structure, and access methods for bubble implementation of relational database, which are capable of set-oriented processing and associative addressing architecture are presented.
Abstract: The mechanical disk storage is limited by long initial delay, few inputs/outputs, and serial access, thus necessitating large complex programs in existing database systems in order to map the user's view into the physical storage and to provide different access paths in response to different queries. Bubble devices are capable of set-oriented processing and associative addressing architecture. This paper presents concepts on data structure, storage structure, and access methods for bubble implementation of relational database.
5 citations
TL;DR: The implementation of a data definition facility based on graph transformations is discussed, and the theory of graph grammars allows a precise characterization of these transformations, facilitating proofs of correctness.
3 citations