Survey of graph database models
ACM Computing SurveysPublished 1 February 2008
Renzo Angles, Claudio Gutiérrez
Citations1,698
SJR quartileQ1
SJR score5.80
SNIP11.03
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The main objective of this survey is to present the work that has been conducted in the area of graph database modeling, concentrating on data structures, query languages, and integrity constraints.
Abstract
Graph database models can be defined as those in which data structures for the schema and instances are modeled as graphs or generalizations of them, and data manipulation is expressed by graph-oriented operations and type constructors. These models took off in the eighties and early nineties alongside object-oriented models. Their influence gradually died out with the emergence of other database models, in particular geographical, spatial, semistructured, and XML. Recently, the need to manage information with graph-like nature has reestablished the relevance of this area. The main objective of this survey is to present the work that has been conducted in the area of graph database modeling, concentrating on data structures, query languages, and integrity constraints.
Keywords
Computer Science
Reviews of Modern PhysicsStatistical mechanics of complex networks
20,607 Citations2002Réka Albert, Albert-Ĺaszló Barabási
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.
SIAM ReviewThe Structure and Function of Complex Networks
18,742 Citations2003Michael Newman
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Communications of the ACMA relational model of data for large shared data banks
5,238 Citations1970E. F. Codd
A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
Communications of the ACMA relational model of data for large shared data banks
4,834 Citations1983E. F. Codd
ACM Transactions on Database SystemsThe entity-relationship model—toward a unified view of data
4,648 Citations1976Peter Pin-Shan Chen
Computer NetworksGraph structure in the Web
2,760 Citations2000Andrei Broder, Ravi Kumar +6 more
The study of the web as a graph yields valuable insight into web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution.
ComputerHypertext: An Introduction and Survey
2,708 Citations1987Conklin
A survey of existing hypertext systems, their applications, and their design is both an introduction to the world of hypertext and a survey of some of the most important design issues that go into fashioning a hypertext environment.
Storing and querying ordered XML using a relational database system
2,248 Citations2002Igor Tatarinov, Stratis D. Viglas +4 more
This paper shows that XML's ordered data model can indeed be efficiently supported by a relational database system, and proposes three order encoding methods that can be used to represent XML order in the relational data model, and also proposes algorithms for translating ordered XPath expressions into SQL using these encoding methods.
RePEc: Research Papers in EconomicsEvolution of networks from biological nets to the Internet and WWW
2,053 Citations2003S. N. Dorogovt︠s︡ev, J. F. F. Mendes
The aim of the text is to understand networks and the basic principles of their structural organization and evolution, so even students without a deep knowledge of mathematics and statistical physics will be able to rely on this as a reference.
The complexity of relational query languages (Extended Abstract)
1,189 Citations1982Moshe Y. Vardi
The pattern which will be shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity the authors show completeness in some complexity class.
A Relational Model of Data for Large Shared Data Banks
1,177 Citations2002E. F. Codd
Annual Review of SociologyComputer Networks as Social Networks: Collaborative Work, Telework, and Virtual Community
1,150 Citations1996Barry Wellman, Janet W. Salaff +4 more
CSSNs accomplish a wide variety of cooperative work, connecting workers within and between organizations who are often physically dispersed, and link teleworkers from their homes or remote work centers to main organi...
ACM Computing SurveysSemantic database modeling: survey, applications, and research issues
1,144 Citations1987Richard Hull, Roger King
This paper provides a tutorial introduction to the primary components of semantic models, which are the explicit representation of objects, attributes of and relationships among objects, type constructors for building complex types, ISA relationships, and derived schema components.
International Journal on Digital LibrariesThe Lorel query language for semistructured data
1,067 Citations1997Serge Abiteboul, Dallan Quass +3 more
The main novelties of the Lorel language are the extensive use of coercion to relieve the user from the strict typing of OQL, which is inappropriate for semistructured data; and powerful path expressions, which permit a flexible form of declarative navigational access and are particularly suitable when the details of the structure are not known to the user.
ACM Transactions on Database SystemsThe functional data model and the data languages DAPLEX
913 Citations1981David W. Shipman
This paper presents and motivates the DAPLEX language and the underlying data model on which it is based.
ScienceComputer Networks As Social Networks
912 Citations2001Barry Wellman
The proliferation of computer networks has facilitated a deemphasis on group solidarities at work and in the community and afforded a turn to networked societies that are loosely bounded and sparsely knit.
Object exchange across heterogeneous information sources
756 Citations2002Yannis Papakonstantinou, Héctor García-Molina +1 more
An object-based information exchange model and a corresponding query language are defined that are well suited for integration of diverse information sources and used to integrate heterogeneous bibliographic information sources.
ACM SIGMOD RecordDatabase techniques for the World-Wide Web
560 Citations1998Daniela Florescu, Alon Y. Levy +1 more
The primary goal of this survey is to classify the different tasks to which database concepts have been applied, and to emphasize the technical innovations that were required to do so.
ACM Computing SurveysSemantic data models
555 Citations1988Joan Peckham, Fred J. Maryanski
The generic properties of semantic data models are described and a representative selection of models that have been proposed since the mid-1970s are presented.
A query language and optimization techniques for unstructured data
535 Citations1996Peter Buneman, Susan B. Davidson +2 more
Here a simple language UnQL is proposed for querying data organized as a rooted, edge-labeled graph and it is shown that known optimization techniques for operators on flat relations apply to the "horizontal" dimension of UnQL.
Semistructured data
443 Citations1997Peter Buneman
A number of issues surrounding semi-structured data are covered: finding a concise formulation, building a sufficiently expressive language for querying and transformation, and opti-mizat,ion problems.
Algorithmics and applications of tree and graph searching
385 Citations2002Dennis Shasha, Jason T. L. Wang +1 more
This paper surveys both algorithms and applications for generalizing keyword search to keytree and keygraph searching, because trees and graphs have many applications in next-generation database systems.
IBM Journal of Research and DevelopmentConceptual Graphs for a Data Base Interface
359 Citations1976John F. Sowa
This paper defines a formalism, called conceptual graphs, that can describe data according to the user's view and access dataaccording to the system's view that can represent functional dependencies in the data base and support inferences and computations that are not explicit in the initial query.
IEEE Transactions on Knowledge and Data EngineeringObject-oriented databases: definition and research directions
323 Citations1990W. Kim
An object- oriented database is defined and justified on the basis of a small set of central object-oriented concepts and a number of common misconceptions are discussed.
RePEc: Research Papers in EconomicsEvolution of Networks: From Biological Nets to the Internet and WWW
310 Citations2003S. N. Dorogovt︠s︡ev, J. F. F. Mendes
The Web as a graph
288 Citations2000Ravi Kumar, Prabhakar Raghavan +4 more
A set of algorithms that operate on the Web graph are reviewed, addressing problems from Web search, automatic community discovery, and classification, and a new family of random graph models are proposed.
ACM SIGMOD RecordA survey of logical models for OLAP databases
286 Citations1999Panos Vassiliadis, Timos Sellis
This paper presents different proposals for multidimensional data cubes, which are the basic logical model for OLAP applications, and divides the work in the field in two categories: commercial tools and academic efforts.
Catching the boat with Strudel
278 Citations1998Mary Fernández, Daniela Florescu +3 more
This work addresses two main questions: when does a declarative specification of site structure provide significant benefits, and what are the main advantages provided by the semi-structured data model.
Querying object-oriented databases
276 Citations1992Michael Kifer, Won Kim +1 more
This paper presents a new query language, henceforth referred to as XSQL, that incorporates novelties not found in earlier languages and is easier to use and it has more expressive power than previous languages.
A graphical query language supporting recursion
255 Citations1987Isabel F. Cruz, Alberto O. Mendelzon +1 more
G is proposed as a complementary language in which recursive queries are simple to formulate, and it is hoped that this graphical query language can be able to exploit well-known graph algorithms in evaluating recursive queries efficiently, a topic which has received widespread attention recently.
Graph-theoretic methods in database theory
231 Citations1990Mihalis Yannakakis
This work will concentrate on a particular, basic type of problems that has attracted a great deal of attention in the database literature over the last few years and has come to play a central role: techniques for searching graphs and computing transitive closure, and some of the applications and related problems in query processing.
GraphGrep: A fast and universal method for querying graphs
222 Citations2003Rosalba Giugno, Dennis Shasha
The algorithm uses hash-based fingerprinting to represent the graphs in an abstract form and to filter the database, and has been tested on databases of size up to 16,000 molecules and performs well in this entire range.
The Journal of Logic ProgrammingA survey of deductive database systems
205 Citations1995Raghu Ramakrishnan, Jeffrey D. Ullman
An overview of the area of deductive databases, with a focus on implementation techniques, is provided, and a number of projects that have led to implemented systems are described.
GraphDB: Modeling and Querying Graphs in Databases
180 Citations1994Ralf Hartmut Güting
A data model and query language that integrates an explicit modeling and querying of graphs smoothly into a standard database environment and permits a natural representation and sophisticated querying of networks, in particular of spatially embedded networks like highways, public transport, etc.
Lecture notes in computer scienceTemporal query languages: A survey
171 Citations2005Jan Chomicki
This work defines formal notions of temporal domain and temporal database, and uses them to survey a wide spectrum of temporal query languages and addresses the issue of incomplete temporal information.
ACM Computing SurveysEvolution of Data-Base Management Systems
168 Citations1976James P. Fry, Edgar H. Sibley
IEEE Transactions on Knowledge and Data EngineeringA graph-oriented object database model
157 Citations1994Marc Gyssens, Jan Paredaens +2 more
A new approach to database logic
153 Citations1984Gabriel M. Kuper, Moshe Y. Vardi
A data model is proposed that generalizes the relational, hierarchical, and network models and is a directed graph, where leaves represent data and internal nodes represent connections between the data.
Journal of Database ManagementSemantic Association Identification and Knowledge Discovery for National Security Applications
149 Citations2005Amit Sheth, Boanerges Aleman-Meza +9 more
This paper discusses semantic approaches to support analytics on vast amounts of heterogeneous data and brings together novel academic research and commercialized Semantic Web technology for semantic metadata extraction.
ACM Transactions on Information SystemsA data model for flexible hypertext database systems
147 Citations1989Frank Wm. Tompa
This paper presents a hypergraph model for maintaining page-oriented databases in such a way that some of the functionality traditionally provided by database schemes can be available to hypertext databases.
Lecture notes in computer scienceQuerying RDF Data from a Graph Database Perspective
147 Citations2005Renzo Angles, Claudio Gutiérrez
This paper studies the RDF model from a database perspective, focuses on query languages, analyze current RDF trends, and proposes the incorporation to RDF query languages of primitives which are not present today, based on the experience and techniques of graph database research.
The semantic data model
145 Citations1978Michael Hammer, Dennis McLeod
The semantic data model (SDM) has been designed as a natural application modelling mechanism that can capture and express the structure of an application environment that corresponds to the principal intensional structures naturally occurring in contemporary data base applications.
ACM Computing SurveysCODASYL Data-Base Management Systems
142 Citations1976Robert W. Taylor, Randall L. Frank
This paper presents in tutorial fashion the concepts, notation, features, and examples of the data-base languages that were defined by the CODASYL Data Description Language and Programming Language Committees.
ACM SIGMOD RecordA query language and optimization techniques for unstructured data
134 Citations1996Peter Buneman, Susan B. Davidson +2 more
Expressing structural hypertext queries in graphlog
133 Citations1989Mariano P. Consens, Alberto O. Mendelzon
From a practical point of view, examples of GraphLog queries applied to several different hypertext systems are presented, providing evidence for the expressive power of the language, as well as for the convenience and naturalness of its graphical representation.
A graph-oriented object database model
129 Citations1990Marc Gyssens, Jan Paredaens +1 more
A simple, graph-oriented database model, supporting object-identity, is presented and it is shown that the transformation language supports both set-operations (except for the powerset operator) and recursive functions.
Lecture notes in computer scienceBipartite Graphs as Intermediate Model for RDF
127 Citations2004Jonathan Hayes, Claudio Gutiérrez
It is argued in this paper that there is need for an intermediate representation of RDF to enable the application of well-established methods from graph theory and its advantages as intermediate model between the abstract triple syntax and data structures used by applications are shown.
A Web Odyssey
127 Citations2001Victor Vianu
The Web presents the database area with vast opportunities and commensurate challenges, and database theory could retain its classical focus and turn in w ards or attempt to take heads-on the challenge of the Web and contribute to an important part of its formal foundations.
ACM Computing SurveysHierarchical Data-Base Management: A Survey
124 Citations1976D. Tsichritzis, Frederick H. Lochovsky
This survey paper discusses the facilities provided by hierarchical data-base management systems and a brief comparison is made between the hierarchical, the network, and the relational systems.
Communications of the ACMEvolution of data modeling for databases
118 Citations1992Shamkant B. Navathe
The scope of data modeling now extends far beyond what it was in the early days of file-oriented systems; many organizations are embarking on corporate data modeling as a part of the strategic planning activity.
Communications of the ACMData models in geographic information systems
115 Citations1997Shashi Shekhar, Mark Coyle +3 more
Data models in database management
114 Citations1980E. F. Codd
A model is a collection of rules that implicitly or explicitly define the set of consistent database states or changes of state or both and may sometimes be expressed as insert-update-delete rules.
Briefings in BioinformaticsAn overview of data models for the analysis of biochemical pathways
113 Citations2003Yves Deville
Theoretical Computer ScienceQueries and computation on the web
113 Citations2000Serge Abiteboul, Victor Vianu
A Survey of Research in Deductive Database Systems
112 Citations1995Raghu Ramakrishnan, Je rey D Ullman
An overview of the area of deductive databases is provided and a number of projects that have led to implemented systems are described.
Lecture notes in computer scienceA Spatial Logic for Querying Graphs
109 Citations2002Luca Cardelli, Philippa Gardner +1 more
This work introduces a spatial logic in order to reason locally about disjoint subgraphs and extends this logic to provide a query language which preserves the multiset semantics of the graph model.
Journal of Chemical Information and Computer SciencesA Graph-Based Toy Model of Chemistry
103 Citations2003Gil Benkö, Christoph Flamm +1 more
A Toy Model is presented that provides a consistent framework in which generic properties of extensive chemical reaction networks can be explored in detail and that at the same time preserves the "look-and-feel" of chemistry.
IEEE Transactions on Knowledge and Data EngineeringG-Log: a graph-based query language
98 Citations1995Jan Paredaens, P. Peelman +1 more
G-Log is introduced, a declarative query language based on graphs, which combines the expressive power of logic, the modeling power of complex objects with identity and the representation power of graphs, and is found to be the only nondeterministic and computationally complete language that does not suffer from the copy-elimination problem.
Hy+
95 Citations1993Mariano P. Consens, Alberto O. Mendelzon
This paper provides abrief overview of Hy+, ahygraphbased query and visualization system, which provides a user interface with extensive support for visualizing structural data as hygraphs (of which labelled graphs are a special case).
Path constraints on semistructured and structured data
92 Citations1998Peter Buneman, Wenfei Fan +1 more
The decidability of the implication problems for several fragments of the path constraint language are established, and it is demonstrated that these fragments are able to express important semantic information such as inverse relationships and local database constraints commonly found in object-oriented databases.
ACM Transactions on Information SystemsA nested-graph model for the representation and manipulation of complex objects
90 Citations1994Alexandra Poulovassilis, Mark Levene
The theoretical foundations of hypernodes and types are given, and it is shown that type checking is tractable, and also how conventional type-forming operators can be simulated by graph types, including cyclic types.
A graph-oriented object model for database end-user interfaces
90 Citations1990Marc Gyssens, Jan Paredaens +1 more
This work proposes a graph-based data model, which shares many features wrth exrstmg data models, but which better facrhtates the rigorous study of graphical database end-user interfaces.
ACM Transactions on Database SystemsReasoning about functional dependencies generalized for semantic data models
88 Citations1992Grant Weddell
The richer expressiveness of this more general functional dependency for semantic data models that derives from their common feature in which the separate notions of domain and relation in the relational model are combined into a single notion of class is proved.
A framework for schema updates in an object-oriented database system
87 Citations2002Roberto V. Zicari
A 'reasonable' minimal set of primitives for updating an object-oriented (O/sub 2/) database schema is defined and the problems which need to be solved in order to obtain a usable schema update mechanism are shown.
Using semantic networks for data base management
85 Citations1975N. Roussopoulos, John Mylopoulos
This paper presents a semantic model of data bases that assumes the availability of a semantic network storing knowledge about a data base and a set of attributes for the data base.
Information SystemsGras, a graph-oriented (software) engineering database system
74 Citations1995N. Kiesel, Andy Schuerr +1 more
The underlying data model and the functionality of GRAS, a database system which has been designed according to the requirements of software engineering, CAD, or office automation, are described.
ACM SIGMOD RecordDesign issues and challenges for RDF- and schema-based peer-to-peer systems
74 Citations2003Wolfgang Nejdl, Wolf Siberski +1 more
This discussion will be based on the design decisions employed in the Edutella infrastructure, a schema-based P2P network based on RDF and RDF schemas, and will also point out additional work addressing the issues discussed.
A graph query language and its query processing
72 Citations1999Lei Sheng, Z. Meral Özsoyoğlu +1 more
This work presents an object-oriented graph data model, and an OQL like graph query language, GOQL, and discusses the query processing techniques for GOQL into an operator-based language, called O-Algebra, extended with operators to deal with paths and sequences.
SIAM Journal on ComputingFinding Regular Simple Paths in Graph Databases
67 Citations1995Alberto O. Mendelzon, Peter T. Wood
It is shown that the problem is in general intractable, but an algorithm than runs in polynomial time in the size of the graph when the regular expression and the graph are free of conflicts is presented.
IEEE Transactions on Knowledge and Data EngineeringAlgorithms for searching massive graphs
64 Citations1994R. K. Agrawal, H. V. Jagadish
It is shown how a branch-and-bound search algorithm can use data structuring to prune the search space and, using these techniques, a search can be expedited significantly without incurring a large storage penalty.
ACM Transactions on Database SystemsThe logical data model
63 Citations1993Gabriel M. Kuper, Moshe Y. Vardi
An object-oriented data model is proposed that generalizes the relational, hierarchical, and network models and defines a logic for the model, and describes a nonprocedural query language that is based on the logic.
HAL (Le Centre pour la Communication Scientifique Directe)Gram : A Graph Data Model and Query Language
59 Citations1992Bernd Amann, Micheł Scholl
Very Large Data BasesA taxonomy of data models
58 Citations1976Larry Kerschberg, Anthony C. Klug +1 more
This paper classifies a collection of conceptual data models within a taxonomy framework consisting of the following parameters: graph theoretic versus set theoretic models, mathematical foundations, terminology, and semantic levels of abstraction.
IEEE Transactions on Knowledge and Data EngineeringA graph-based data model and its ramifications
56 Citations1995Mark Levene, George Loizou
This work demonstrates that the hypernode model is a natural candidate for formalising hypertext, and shows how to bridge the gap between graph based and set based data models, and at what computational cost this can be done.
IEEE Transactions on Knowledge and Data EngineeringA G-net model for knowledge representation and reasoning
54 Citations1990Y.-M. Deng, S.-K. Chang
Four reasoning algorithms for the G-net model are proposed: inheritance reasoning and recognition reasoning for semantic knowledge, event-driven reasoning for dynamic knowledge, and control table reasoning for coordination and control in a mixed-type knowledge hierarchy.
Lecture notes in computer scienceRDF Querying: Language Constructs and Evaluation Methods Compared
53 Citations2006Tim Furche, Benedikt Linse +3 more
This article is an introduction into query languages for the Semantic Web, and an in-depth comparison of the languages introduced, with a focus on few, but representative languages a necessary condition for a non-trivial comparison.
Data & Knowledge EngineeringAn object-oriented data model formalised through hypergraphs
52 Citations1991Mark Levene, Alexandra Poulovassilis
It is shown that the representation of object schemas by means of hypergraphs leads to a natural formalisation of the notions of sub-object sharing and structural inheritance while also providing a simple interface suitable for user interaction.
The hypernode model and its associated query language
46 Citations2002Mark Levene, Alexandra Poulovassilis
A declarative logic-based language for the hypernode model is introduced and it is shown that hypernodes can represent extensional functions, nested relations, and composite objects.
International Journal of Geographical Information SystemsModelling the network component of geographical information systems
45 Citations1995Michel Mainguenaud
A data model to manage networks with a Geographical Information System with some consideration of the path operator and the introduction of the Master_nodes allows definition of a node (with respect to an edge) as an abstraction of a sub-network.
IFO
44 Citations1984Serge Abiteboul, Richard Hull
A new, formally defined database model is introduced which combines fundamental principles of "semantic" database modeling in a coherent fashion and can serve as the foundation for a theoretical investigation into a wide variety of fundamental issues concerning the logical representation of data in databases.
Journal of Logic and ComputationA Modal Perspective on Path Constraints
44 Citations2003Natasha Alechina
Several classes of path constraints for semistructured data are analysed and a number of decidability and complexity results proved for such constraints.
IEEE Transactions on Knowledge and Data EngineeringExplicit graphs in a functional model for spatial databases
43 Citations1994Martin Erwig, Ralf Hartmut Güting
A new data model and query language that especially supports graph structures is defined, which leads to powerful modeling and querying capabilities for spatial databases, in particular for spatially embedded networks such as highways, rivers, public transport, and so forth.
Lecture notes in computer scienceTyping Graph-Manipulation Operations
41 Citations2002Jan Hidders
A graph-based data model called GDM is presented where database instances and database schemas are described by certain types of labeled graphs called instance graphs and schema graphs, and two graph-manipulation operations, an addition and a deletion, are introduced.
IEEE Transactions on Knowledge and Data EngineeringExtensions to query languages for graph traversal problems
39 Citations1990Michael V. Mannino
The results of the survey indicate the diversity of language extensions and the need to provide data-model and query-language features to address such problems.
Spatial data models and query processing
39 Citations1995Hanan Samet, Walid G. Aref
ACM Transactions on Information SystemsA transient hypergraph-based model for data access
38 Citations1990Carolyn Watters, Michael Shepherd
A model of data access has been developed that provides a framework for general data access that accommodates user-directed browsing and querying, as well as traditional models of information and data retrieval, such as the Boolean, vector space, and probabilistic models.
Materialization and incremental update of path information
37 Citations2003R. K. Agrawal, H. V. Jagadish
Performance simulations indicate that incremental algorithms are presented that enable the effects of updates to the underlying database to be reflected in the materialized information to significantly speed up the processing of path queries at an acceptable level of storage overhead.
ACM Computing SurveysData models
35 Citations1996Avi Silberschatz, Henry F. Korth +1 more
Future database systems can be expected to offer the high level of abstraction of object-orientation along with the relative efficiency and uniformity of the relational model.
Data & Knowledge EngineeringData models and query languages for spatial databases
35 Citations1998Jan Paredaens, Bart Kuijpers
An overview of some well-known data models and query languages of spatial database systems is given and the concept of genericity, as introduced by Chandra and Harel for classical databases, for spatial databases is investigated.
Journal of Visual Languages & ComputingA Hybrid Query Language for an Extended Entity-Relationship Model
35 Citations1996Marc Andries, Gregor Engels
This work presents the hybrid query language HQL/EER for an Extended Entity-Relationship model and demonstrates the look-and-feel of this query language, and shows how syntax and semantics of this language are formally defined using programmed graph rewriting systems.
Lecture notes in computer scienceData models and languages for databases
34 Citations1983Catriel Beeri
Extensions of the relational model that allow users to specify and manipulate structurally complex objects and their languages are discussed, including a formal model for objects with identity, and declarative languages for the model.
Lecture notes in computer scienceConcepts for graph-oriented object manipulation
32 Citations1992Marc Andries, Marc Gemis +3 more
This work represents different kinds of database interactions by means of a uniform graph-transformation framework based on pattern matching, and incorporates viewing and gives a formal definition of browsing.
Workshops in computingIntegrity Enforcement in Object-Oriented Databases
29 Citations1993Klaus‐Dieter Schewe, Bernhard Thalheim +2 more
In contrast to the relational model methods in OODBs, these methods must enforce structurally defined constraints such as inclusion and referential constraints for basic generic update operations that are determined by the schema.
ACM Transactions on Database SystemsThree principles of representation for semantic networks
29 Citations1982Robert L. Griffith
Three rules of representation are presented which achieve greater conceptual simplicity for users, simplifications in semantic net implementations and maintenance, and greater consistency across semantic net applications.
Informatik-FachberichtePrinciples of Object-Oriented Query Languages
28 Citations1991Andreas Heuer, Marc H. Scholl
The fundamental problems of designing general purpose, descriptive query languages for object-oriented database systems are surveyed and structural aspects of object models are investigated and their implications on the query language capabilities are analyzed and summarized.
O <sub>2</sub> an object-oriented data model
27 Citations1990Christophe Lécluse, Philippe Richard +1 more
…