Issue No. 03 - June (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.390249
<p><it>Abstract</it>—In this paper 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.</p>
Deductive databases, graph-based databases, database theory, database algorithms, complex objects, data models, database programming languages, first-order logic, completeness.
Jan Paredaens, Peter Peelman, Letizia Tanca, "G-Log: A Graph-Based Query Language", IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 436-453, June 1995, doi:10.1109/69.390249