G-Log: a graph-based query language

Author

Paredaens, J. ; Peelman, Peter ; Tanca, Letizia

Author_Institution

Antwerp Univ., Belgium

Volume

7

Issue

3

fYear

1995

fDate

6/1/1995 12:00:00 AM

Firstpage

436

Lastpage

453

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

Keywords

database theory; deductive databases; query languages; G-Log; complex objects; computationally complete language; declarative query language; deductive database languages; flexible graph-based formalism; graph-based query language; modeling power; nondeterministic complete query language; Computer aided software engineering; Computer languages; Data models; Database languages; Deductive databases; Knowledge representation; Logic programming; Object oriented databases; Object oriented modeling; Relational databases;

fLanguage

English

Journal_Title

Knowledge and Data Engineering, IEEE Transactions on

Publisher

ieee

ISSN

1041-4347

Type

jour

DOI

10.1109/69.390249

Filename

390249