ACM Home Page
Please provide us with feedback. Feedback
GraphLog: a visual formalism for real life recursion
Full text PdfPdf (1.35 MB)
Source Symposium on Principles of Database Systems archive
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Nashville, Tennessee, United States
Pages: 404 - 416  
Year of Publication: 1990
ISBN:0-89791-352-3
Authors
Mariano P. Consens  Computer Systems Research Institute, University of Toronto, Toronto, Canada M5S 1A4
Alberto O. Mendelzon  Computer Systems Research Institute, University of Toronto, Toronto, Canada M5S 1A4
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 71,   Citation Count: 62
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/298514.298591
What is a DOI?

ABSTRACT

We present a query language called GraphLog, based on a graph representation of both data and queries. Queries are graph patterns. Edges in queries represent edges or paths in the database. Regular expressions are used to qualify these paths. We characterize the expressive power of the language and show that it is equivalent to stratified linear Datalog, first order logic with transitive closure, and non-deterministic logarithmic space (assuming ordering on the domain). The fact that the latter three classes coincide was not previously known. We show how GraphLog can be extended to incorporate aggregates and path summarization, and describe briefly our current prototype implementation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Ada87
Sam S. Adams. NodeGraph.80 Version 1.0. Knowledge Systems Corporation, 1987.
 
AK89
Serge Abiteboul and Paris C. Kanellakis. Object identity as a query language primitive. Technical Report 1022, INRIA, April 1989.
AU79
 
Bee88
 
CH82
A.K. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25(1):99- 128, 1982.
 
CH85
A.K. Chandra and D. Harel. Horn clause queries and generalizations. J. Logic Programming, 2(1):1-15, 1985.
CK86
CM89
 
CMW88
I.F. Cruz, A.O. Mendelzon, and P.T. Wood. G+: Recursive queries without recursion. In Larry Kerschberg, editor, Proceedings of the Second International Conference on Expert Database Systems, pages 355-368, 1988.
 
Con89
Mariano P. Consens. Graphlog: "real life" recursive queries using graphs. Master's thesis, Department of Computer Science, University of Toronto, 1989.
DS86
 
Imm87
 
Imm88a
Nail Immerman. Descriptive and computational complexity. Technical report, Department of Computer Science, Yale University, New Haven, 1988.
 
Imm88b
Nail Immerman. Nondeterministic space is closed under complementation. In Third Structure in Complexity Theory Conference, 1988.
JAN87
 
Kan87
Klu82
 
MW89
Nau87
Shm87
 
TZ86
 
Ull89
 
UvG86
J.D. Ullman and A. van Calder. Parallel complexity of logical query programs. Proc. 27th Ann. Symp. on Foundations of Computer Science, pages 438-454, 1986.

CITED BY  62

Collaborative Colleagues:
Mariano P. Consens: colleagues
Alberto O. Mendelzon: colleagues