This Article 
 Bibliographic References 
 Add to: 
G-Log: A Graph-Based Query Language
June 1995 (vol. 7 no. 3)
pp. 436-453

Abstract—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.

[1] E.F. Codd,“A relational model of data for large shared data banks,” Comm. ACM, vol. 13, no. 6, June 1970.
[2] A.V. Aho and J.D. Ullman,“Universality of data retrieval languages,” Proc. Sixth ACM Symp. Principles of Programming Languages, Jan. 1979.
[3] J.D. Ullman,“Principles of databases and knowledge-based systems,” vols. 1and 2, Rockville, Md: Computer Science Press, 1989.
[4] S. Ceri, G. Gottlob, and L. Tanca, "Logic Programming and Databases," Surveys in Computer Science. Springer-Verlag, 1990.
[5] S. Naqvi and S. Tsur, A Logical Language for Data and Knowledge Bases.New York: Computer Science Press, 1989.
[6] S. Abiteboul and S. Grumbach,“COL: A logic-based language for complex objects,” Proc. Int’l Conf. Extending Database Technology, LNCS 303, pp. 271-293, Mar. 1988.
[7] D. Saccà and C. Zaniolo, "Stable Models and Non-determinism for Logic Programs with Negation," ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 205-217, 1990.
[8] C. de Maindreville and E. Simon,“Modeling queries and updates in a deductive database,” Proc. 14th Int’l Conf. Very Large Data Bases, 1988.
[9] I.S. Mumick, H. Pirahesh, and R. Ramakrishnan, “The Magic of Duplicates and Aggregates,” Proc. Very Large Data Base Conf., pp. 264–277, 1990.
[10] E. Lambrichts,P. Nees,J. Paredaens,P. Peelman,, and L. Tanca,“Integration of functions in logic database systems,” Data and Knowledge Engineering, vol. 5, 1990.
[11] Y. Sheng,“IDLOG: Extending the expressive power of deductive database languages,” Proc. 1990 ACM SIGMOD Int’l Conf. Management of Data, SIGMOD Record, vol. 19, no. 2, pp. 54-63, June 1990.
[12] K. Morris,J.D. Ullman,, and A. Van Gelder,“Design overview of the NAIL! system,” Proc. Int’l Conf. Logic Programming, 1986.
[13] M. Atkinson,F. Bancilhon,D. De Witt,K. Dittrich,D. Maier,, and S. Zdonik,“The object-oriented database system manifesto,” Proc. First Int’l Conf. Deductive and Object-Oriented Databases, pp. 40-57, Dec. 1989.
[14] M. Kifer and J. Wu, "A Logic for Object-Oriented Logic Programming (Maier's O-Logic Revisited)," ACM Symp. Principles of Database Systems,Philadelphia, pp. 379-393, Mar. 1989.
[15] C. Lecluse, P. Richard, and F. Velez, “An Object-Oriented Data Model,” Proc. 1988 ACM SIGMOD Conf., pp. 424-433, 1988.
[16] K. Kim,W. Kim,, and A. Dale,“Cyclic query processing in object-oriented databases,” Proc. IEEE Int’l Conf. Data Engineering, 1989.
[17] C. Beeri,“Data models and languages for databases,” Proc. Second Int’l Conf. Database Theory, LNCS 326, pp. 19-40, Aug. 1988.
[18] F. Cacace,S. Ceri,S. Crespi-Reghizzi,L. Tanca,, and R. Zicari,“Interating object-oriented data modeling with a rule-based programmingparadigm,” Proc. 1990 ACM SIGMOD Int’l Conf. on Management of Data, SIGMOD Record, vol. 19 no. 2, pp. 225-237, June 1990.
[19] R. Hull and M. Yoshikawa,“ILOG: Declarative creation and manipulation of object identifiers,” Proc. 16th Int’l Conf. Very Large Data Bases, 1990.
[20] S. Abiteboul and P.C. Kanellakis,“Object identity as a query language primitive,” Proc. 1989 ACM SIGMOD Int’l Conf. the Management of Data, SIGMOD Record, vol. 18, no. 2, pp. 159-173, June 1989.
[21] L. Cardelli,“A semantics of multiple inheritance,” Information and Computation, vol. 76, pp. 138-164, 1988.
[22] J. Paredaens,P. Peelman,, and L. Tanca,“G-Log: A declarative graphical query specification language,” Tech. Report 91-16, Univ. of Antwerp, Mar. 1991.
[23] J. Paredaens,P. Peelman,, and L. Tanca,“Deductive languages: A graph-based approach,” Proc. Third Workshop Foundations of Models and Languages for Data andObjects, pp. 147-172, Sept. 1991.
[24] J. Paredaens,P. Peelman,, and L. Tanca,“G-Log: A declarative graphical query language,” Proc. Second Int’l Conf. Deductive and Object-Oriented Databases, pp. 108-128, Dec. 1991.
[25] J. Paredaens,P. Peelman,, and L. Tanca,“G-Log and first order predicate calculus,” Tech. Report 91-53, Univ.of Antwerp, Nov. 1991.
[26] M. Gyssens,J. Paredaens,, and D. Van Gucht,“A graph-oriented object database model,” Proc. Ninth ACM Symp. Principles of Database Systems, pp. 417-424, Apr. 1990.
[27] D.D. Roberts,The Existential Graphs of Charles S. Peirce.The Hague: Mouton, 1973.
[28] S.C. Shapiro,“A net structure for semantic information storage, deduction, andretrieval,” Proc. Second Int’l Conf. Artificial Intelligence, pp. 512-523, 1971.
[29] G.G. Hendrix,“Expanding the utility of semantic networks through partitioning,” Proc. Fourth Int’l Conf. Artificial Intelligence, pp. 115-121, 1975.
[30] H. Kim,H. Korth,, and A. Silberschatz,“Picasso: A graphical query language,” Software Practice and Experience, John Wiley&Sons, pp. 169-203, 1988.
[31] K. Goldman,S. Goldman,P. Kanellakis,, and S. Zdonik,“ISIS: Interface for a semantic information system,” Proc. ACM-SIGMOD 1985 Int’l Conf. Management of Data, SIGMOD Record, vol. 14, no. 4, pp. 328-342, May 1985.
[32] D. Bryce and R. Hull,“SNAP: A Graphics-based schema manager,” Proc. Int’l Conf. Data Engineering, 1986.
[33] F. Staes,L. Tarantino,, and A. Tiems,“A graphical query language for object oriented databases,” Proc. 1991 IEEE Workshop on Visual Languages, 1991.
[34] M.P. Consens and A.O. Mendelzon,“GraphLog: A visual formalism for real life recursion,” Proc. Ninth ACM Symp. Principles of Database Systems, pp. 404-416, Apr. 1990.
[35] J. Van den Bussche,D. Van Gucht,M. Andries,, and M. Gyssens,“On the completeness of object-creating query languages,” Proc. 33rd Symp. Foundations of Computer Science, IEEE CS Press, pp. 372-379, 1992.
[36] S. Abiteboul and E. Simon,“Fundamental properties of deterministic and nondeterministic extensions ofdatalog,” Journees Bases de Données Avancés, Sept. 1989.
[37] S. Abiteboul,E. Simon,, and V. Vianu,“Non-deterministic languages to express deterministictransformations,” Proc. Ninth ACM Symp. Principles of Database Systems, pp. 218-229, Apr. 1990.
[38] S. Abiteboul and V. Vianu,“Non-determinism in logic-based languages,” Tech. Report CS89-159, Univ. of California, 1989.
[39] S. Abiteboul and V. Vianu,“Datalog extensions for database queries and updates,” Tech. Report 900, INRIA, Sept. 1988.
[40] H.B. Enderton,A Mathematical Introduction to Logic. Academic Press, 1972.
[41] M. Gyssens,“The extended nested relational algebra,” Tech. Report 87-11, Univ. of Antwerp, 1987.
[42] C. Beeri, "A Formal Approach to Object-Oriented Databases," Data and Knowledge Eng., vol. 5, no. 4, pp. 353-382, 1990.
[43] A.K. Chandra and D. Harel,“Computable queries for relational database systems,” J. Computer Systems Science, vol. 21, no. 2, pp. 156-178, 1980.
[44] S. Abiteboul and V. Vianu,“Transaction languages for database update and specification,” Tech. Report 715, INRIA, 1987.
[45] R.A. Kowalski,Logic for Problem Solving.New York, 1979.
[46] D.C. Tsichritzis and F.H. Lochovsky,Data Models.Englewood Cliffs, N.J.: Prentice-Hall, 1982.
[47] Committee for Advanced DBMS function, Third Generation Data Base System Manifesto. 1990.

Index Terms:
Deductive databases, graph-based databases, database theory, database algorithms, complex objects, data models, database programming languages, first-order logic, completeness.
Jan Paredaens, Peter Peelman, Letizia Tanca, "G-Log: A Graph-Based Query Language," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 3, pp. 436-453, June 1995, doi:10.1109/69.390249
Usage of this product signifies your acceptance of the Terms of Use.