Database Graph Views: A Practical Model to Manage Persistent Graphs

Advanced technical applications like routing systems or electrical network management systems introduce the need for complex manipulations of large size graphs. Efficiently supporting this requirement is now regarded as a key feature of future database systems. This paper proposes an abstraction mechanism, called Database Graph View, to define and manipulate various kinds of graphs stored in either relational, object oriented or file systems. A database graph view provides a functional definition of a graph which allows its manipulation independently of its physical organization. Derivation operators are proposed to define new graph views upon existing ones. These operators permit the composition, in a single graph view, of graphs having different node and edge types and different implementations. The graph view mechanism comes with an execution model where both set-oriented and pipelined execution of graph operators can be expressed. The graph view operators form a library which can be integrated in database systems or applications managing persistent data with no repercussion on the data organization.

[1]  Alberto O. Mendelzon,et al.  GraphLog: a visual formalism for real life recursion , 1990, PODS '90.

[2]  Raghu Ramakrishnan,et al.  Transitive closure algorithms based on graph traversal , 1993, TODS.

[3]  H. V. Jagadish,et al.  Optimization of generalized transitive closure queries , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[4]  Theodore S. Norvell,et al.  Aggregative closure: an extension of transitive closure , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[5]  Patrick Valduriez,et al.  Evaluation of Recursive Queries Using Join Indices , 1986, Expert Database Conf..

[6]  Michael V. Mannino,et al.  Extensions to Query Languages for Graph Traversal Problems , 1990, IEEE Trans. Knowl. Data Eng..

[7]  Patrick Valduriez,et al.  Efficient Main Memory Data Management Using the DBGraph Storage Model , 1990, VLDB.

[8]  Rakesh Agrawal,et al.  Extending SQL with Generalized Transitive Closure Functionality , 1993, IEEE Trans. Knowl. Data Eng..

[9]  Rakesh Agrawal Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries , 1988, IEEE Trans. Software Eng..

[10]  Hongjun Lu,et al.  New Strategies for Computing the Transitive Closure of a Database Relation , 1987, VLDB.

[11]  H. V. Jagadish,et al.  Direct Algorithms for Computing the Transitive Closure of Database Relations , 1987, VLDB.

[12]  Michel Scholl,et al.  Gram: a graph data model and query languages , 1992, ECHT '92.