.png){kind=icon}
Return
G-LOG - A GRAPH-BASED QUERY LANGUAGE
.png){kind=icon}
PRE
AI
DOI：10.1109/69.390249.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
DEDUCTIVE DATABASES
GRAPH-BASED DATABASES
DATABASE THEORY
DATABASE ALGORITHMS
COMPLEX OBJECTS
DATA MODELS
DATABASE PROGRAMMING LANGUAGES
FIRST-ORDER LOGIC
COMPLETENESS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more