G-Log : a graph-based query language

J. Paredaens, P. Peelman, L. Tanca

Research output: Contribution to journalArticleAcademicpeer-review

56 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)436-453
JournalIEEE Transactions on Knowledge and Data Engineering
Volume7
Issue number3
DOIs
Publication statusPublished - 1995

Fingerprint

Dive into the research topics of 'G-Log : a graph-based query language'. Together they form a unique fingerprint.

Cite this