A graph-oriented object database model
Published 2 April 1990Open access
Marc Gyssens, Jan Paredaens, Dirk Van Gucht
Citations129
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
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.
Abstract
A simple, graph-oriented database model, supporting object-identity, is presented. For this model, a transformation language based on elementary graph operations is defined. This transformation language is suitable for both querying and updates. It is shown that the transformation language supports both set-operations (except for the powerset operator) and recursive functions.
Keywords
Computer Science
Choice Reviews OnlinePrinciples of database and knowledge-base systems
2,701 Citations1989
This book goes into the details of database conception and use, it tells you everything on relational databases from theory to the actual used algorithms.
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.
Elsevier eBooksTowards a Theory of Declarative Knowledge
1,134 Citations1988Krzysztof R. Apt, Howard A. Blair +1 more
This work proves the consistency of Clark's completion for stratified programs and attempts to clarify the sources of some previously reported difficulties with negation in logic programming.
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.
ACM eBooksObject-oriented concepts, databases, and applications
587 Citations1989
A growing interest in the object-oriented programming paradigm prompted the editors to compile a wide-ranging introduction to the subject, beginning with basic concepts and then covering a variety of applications in databases and other areas.
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.
ACM SIGMOD RecordObject identity as a query language primitive
363 Citations1989Serge Abiteboul, Paris C. Kanellakis
ACM SIGMOD RecordF-logic: a higher-order language for reasoning about objects, inheritance, and scheme
359 Citations1989Michael Kifer, Georg Lausen
Readings in Database Systems
308 Citations1988Michael Stonebraker
Readings in Database Systems, 3rd Edition is a compilation of papers exploring DBMS applications, including relational implementation, transaction management, distributed database, parallel database, objects and databases, data analysis, and benchmarking.
Object-oriented database systems
269 Citations1988François Banciihon
This paper describes the vision of the current state of object-oriented database research, and describes what it considers to be the main characteristics of an object oriented system: encapsulation, object identity, classes or types, inheritance, overriding and late binding.
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.
Object identity as a query language primitive
236 Citations1989Serge Abiteboul, Paris C. Kanellakis
An object-based data model, whose structural part generalizes most of the known complex-object data models: cyclicity is allowed in both its schemas and instances and the model can be extended to incorporate type inheritance without changes to IQL.
On the power of languages for the manipulation of complex objects
204 Citations1987Serge Abiteboul, Catriel Beeri
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.
F-logic: a higher-order language for reasoning about objects, inheritance, and scheme
143 Citations1989Michael Kifer, Georg Lausen
A database logic which accounts in a clean declarative fashion for most of the “object-oriented” features such as object identity, complex objects, inheritance, methods, etc is proposed.
Lecture notes in computer scienceCol: A logic-based language for complex objects
115 Citations1988Serge Abiteboul, Stéphane Grumbach
A logic-based language for manipulating complex objects constructed using set and tuple constructors is introduced and applications of the language to procedural data, semantic database models, heterogeneous databases integration, and datalog query evaluation are presented.
Procedural and declarative database update languages
107 Citations1988Serge Abiteboul, Victor Vianu
This paper mtmduce a determuusnc counterpart of TL, as well as non-detemumsnc and detenmmsuc declaranve update languages, and show that these languages are computationally complete wtih respect to database updates.
Database Programming LanguagesA query language for the O 2 object-oriented databases
59 Citations1989François Bancilhon, Sophie Cluet +1 more
ACM SIGMOD RecordThe powerset algebra as a result of adding programming constructs to the nested relational algebra
48 Citations1988Marc Gyssens, Dirk Van Gucht
The powerset algebra as a result of adding programming constructs to the nested relational algebra
25 Citations1988Marc Gyssens, Dirk Van Gucht
It is shown that the algebras obtained in this way are equivalent to a slight extension of the powerset algebra, thus emphasizing both the strength and the naturalness of thepowerset algebra as a tool to manipulate nested relations, and indicating more direct ways to implement this algebra.
ACM SIGMOD RecordOn accessing object-oriented databases: expressive power, complexity, and restrictions
25 Citations1989Richard Hull, Jianwen Su
On accessing object-oriented databases: expressive power, complexity, and restrictions
12 Citations1989Richard Hull, Jianwen Su
A formal framework for studying the expressive power and complexity of OODB queries is developed, and a new relational query language, called algebra + pointwise recursion, is introduced, which can compute generalized transitive closure.