G-Log : a graph-based query language

J. Paredaens; P. Peelman; L. Tanca

doi:10.1109/69.390249

G-Log : a graph-based query language

J. Paredaens, P. Peelman, L. Tanca

Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

51 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 language	English
Pages (from-to)	436-453
Journal	IEEE Transactions on Knowledge and Data Engineering
Volume	7
Issue number	3
DOIs	https://doi.org/10.1109/69.390249
Publication status	Published - 1995

Access to Document

10.1109/69.390249

Cite this

@article{65db8e717a4d4fc88340c733f7eb8625,

title = "G-Log : a graph-based query language",

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.",

author = "J. Paredaens and P. Peelman and L. Tanca",

year = "1995",

doi = "10.1109/69.390249",

language = "English",

volume = "7",

pages = "436--453",

journal = "IEEE Transactions on Knowledge and Data Engineering",

issn = "1041-4347",

publisher = "IEEE Computer Society",

number = "3",

}

TY - JOUR

T1 - G-Log : a graph-based query language

AU - Paredaens, J.

AU - Peelman, P.

AU - Tanca, L.

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

U2 - 10.1109/69.390249

DO - 10.1109/69.390249

M3 - Article

SN - 1041-4347

VL - 7

SP - 436

EP - 453

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

IS - 3

ER -

G-Log : a graph-based query language

Abstract

Access to Document

Fingerprint

Cite this