IEEE Transactions on Knowledge and Data Engineering · 1995 · 98 citations · 30 references
ComputingComputer ScienceAlgorithmsDatabasesKnowledge RepresentationDatabase ManagementQuery ProcessingDeclarative SemanticsDeductive DatabasesQuery Language Design
We introduce G-Log, 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. G-Log is a nondeterministic complete query language, and thus allows the expression of a large variety of queries. We compare G-Log to well-known deductive database languages, and find that it is the only nondeterministic and computationally complete language that does not suffer from the copy-elimination problem. G-Log may be used in a totally declarative way, as well as in a "more procedural" way. Thus, it provides an intuitive, flexible graph-based formalism for nonexpert database users.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
30
A relational model of data for large shared data banks
E. F. Codd · Communications of the ACM · 1970 · 5.2K citations · Full text
Universality of data retrieval languages
Alfred V. Aho, Jeffrey D. Ullman · 1979 · 634 citations · Full text
Computing, Computer Science, Algebra +14
A semantics of multiple inheritance
Luca Cardelli · Information and Computation · 1988 · 627 citations
Language Studies, World Languages, Knowledge Representation +7
Object identity as a query language primitive
Serge Abiteboul, Paris C. Kanellakis · ACM SIGMOD Record · 1989 · 363 citations · Full text