This Article 
 Bibliographic References 
 Add to: 
Hyperlog: A Graph-Based System for Database Browsing, Querying, and Update
March/April 2001 (vol. 13 no. 2)
pp. 316-333

Abstract—Hyperlog is a declarative, graph-based language that supports database querying and update. It visualizes schema information, data, and query output as sets of nested graphs, which can be stored, browsed, and queried in a uniform way. Thus, the user need only be familiar with a very small set of syntactic constructs. Hyperlog queries consist of a set of graphs that are matched against the database. Database updates are supported by means of programs consisting of a set of rules. This paper discusses the formulation, evaluation, expressiveness, and optimization of Hyperlog queries and programs. We also describe a prototype implementation of the language and we compare and contrast our approach with work in a number of related areas, including visual database languages, graph-based data models, database update languages, and production rule systems.

[1] S. Abiteboul and V. Vianu, "Procedural and Declarative Database Update Languages," Proc. ACM Symp. Principles Database Systems, pp. 240-251.New York: ACM, 1988.
[2] 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.
[3] P. Aczel, Non-Well-Founded Sets. Stanford, Calif.: Center for the Study of Language and Information (CSLI), Lecture Notes no. 14, 1988.
[4] M. Angelaccio, T. Catarci, and G. Santucci, “QBD*: A Graphical Query Language with Recursion,” IEEE Trans. Software Eng., vol. 16, no. 10, Oct. 1990.
[5] C. Beeri and R. Ramakrishnan, "On the Power of Magic," Proc. Sixth ACM PODS Symp. Principles of Database Systems, pp. 269-283, 1987.
[6] K. Benkerimi and A. Poulovassilis, “Semi-Naive Evaluation for Hyperlog, A Graph-Based Language for Complex Objects,” Proc. First Int'l Workshop Rules in Database Systems, pp. 251-267, 1993.
[7] T. Catarci and L. Tarantino, “A Hypergraph-Based Framework for Visual Interaction with Databases,” J. Visual Languages and Computing, vol. 6, no. 2, pp. 135-166, 1995.
[8] A.K. Chandra and D. Harel, “Computable Queries for Relational Data Bases,” J. Computer and System Sciences, vol. 21, pp. 156-178, 1980.
[9] 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.
[10] M. Consens and A. Mendelzon, "Hy+: A Hygraph-Based Query and Visualization System," Proc. ACM SIGMOD Conf., 1993.
[11] M.P. Consens, F.Ch. Eigler, M.Z. Hasan, A.O. Mendelzon, E.G. Noik, A.G. Ryman, and D. Vista, “Architecture and Applications of the Hy+Visualization System,” IBM Systems J., vol. 33, no. 3, pp. 458-476, 1994.
[12] I.F. Cruz, A.O. Mendelzon, and P.T. Wood, “G+: Recursive Queries Without Recursion,” Proc. Second Int'l Conf. Expert Database Systems, pp. 355-368, 1988.
[13] B. Czedo, R. Elmasri, and M. Rusinkiewicz, “A Graphical Data Manipulation Language for an Extented Entity-Relationship Model,” Computer, vol. 23, no. 3, pp. 26-36, 1990.
[14] 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.
[15] R.L. Griffith, “Three Principles of Representation for Semantic Networks,” ACM Trans. Database Systems, vol. 7, no. 3, pp. 417-442, 1982.
[16] M. Gyssens, J. Paradaens, and D. Van Gucht, "A Graph-Oriented Object Model for Database End-User Interfaces," Proc. ACM SIGMOD Conf., 1990.
[17] D. Harel, Algorithmics—The Spirit of Computing. Reading, Mass.: Addison-Wesley, 1987.
[18] D. Harel, "On Visual Formalisms," Comm. ACM, May 1988, pp. 514-530.
[19] S. Hild and A. Poulovassilis, “Implementing Hyperlog, A Graph-Based Database Language,” J. Visual Languages and Computing, vol. 7, no. 3, pp. 267-289, 1996.
[20] M. Levene and A. Poulovassilis, “The Hypernode Model and Its Associated Query Language,” Proc. Fifth Jerusalem Conf. Information Technology (JCIT-5), pp. 520-530, 1990.
[21] M. Levene and A. Poulovassilis, “An Object-Oriented Data Model Formalised through Hypergraphs,” Data and Knowledge Eng., vol. 6, no. 3, pp. 205-224, 1991.
[22] D.P. Miranker and B.J. Lofaso,"The organization and performance of a TREAT-based production system compiler," IEEE Trans. Knowledge and Data Engineering, vol. 3, no. 1, pp. 3-10, Mar. 1991.
[23] K. Morris, “An Algorithm for Reordering Subgoals in NAIL!” Proc. ACM Symp. Principles of Database Systems, pp. 82-88, 1988.
[24] A. Papantonakis and P.J.H. King, “Syntax and Semantics of Gql, A Graphical Query Language,” J. Visual Languages and Computing, vol. 6, no. 1, pp. 3-36, 1995.
[25] J. Paredaens, P. Peelman, and L. Tanca, “G-Log: A Declarative Graphical Query Language,” Proc. Second Int'l Conf. Deductive and Object-Oriented Databases (DOOD), pp. 108-128, 1991.
[26] A. Poulovassilis and C. Small, “A Functional Programming Approach to Deductive Databases,” Proc. 17th Very Large Data Base Conf., pp. 491-500, 1991.
[27] A. Poulovassilis and M. Levene, “A Nested-Graph Model for the Representation and Manipulation of Complex Objects,” ACM Trans. Information Systems, vol. 12, no. 1, pp. 35-68, 1994.
[28] F.W. Tompa, “A Data Model for Flexible Hypertext Database Systems,” ACM Trans. Information Systems, vol. 7, no. 1, pp. 85-100, 1989.
[29] C. Watters and M.A. Shepherd, “A Transient Hypergraph-Based Model for Data Access,” ACM Trans. Information Systems, vol. 8, no. 2, pp. 77-102, 1990.
[30] M.M. Zloof, “Query By Example: A Database Language,” IBM Systems J., vol. 4, pp. 324-343, 1977.

Index Terms:
Database browsing, database query languages, database update languages, graph-based models and languages, hypernodes, visual database languages.
Alexandra Poulovassilis, Stefan G. Hild, "Hyperlog: A Graph-Based System for Database Browsing, Querying, and Update," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 2, pp. 316-333, March-April 2001, doi:10.1109/69.917568
Usage of this product signifies your acceptance of the Terms of Use.