G-Log: a graph-based query language
- 1 June 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 7 (3) , 436-453
- https://doi.org/10.1109/69.390249
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
This publication has 27 references indexed in Scilit:
- Datalog extensions for database queries and updatesJournal of Computer and System Sciences, 1991
- Non-determinism in logic-based languagesAnnals of Mathematics and Artificial Intelligence, 1991
- G-Log: A declarative graphical query languagePublished by Springer Nature ,1991
- A formal approach to object-oriented databasesData & Knowledge Engineering, 1990
- Integration of functions in logic database systemsData & Knowledge Engineering, 1990
- PICASSO: A graphical query languageSoftware: Practice and Experience, 1988
- A semantics of multiple inheritanceInformation and Computation, 1988
- Col: A logic-based language for complex objectsPublished by Springer Nature ,1988
- Design overview of the NAIL! SystemPublished by Springer Nature ,1986
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980