Algorithms for Searching Massive Graphs

Given a large graph, stored on disk, there is often a need to perform a search over this graph. Such a need could arise, for example, in the search component of a data-intensive expert system or to solve path problems in deductive database systems. In this paper, we present a novel data structuring technique and show how a branch-and-bound search algorithm can use this data structuring to prune the search space. Simulation results confirm that, using these techniques, a search can be expedited significantly without incurring a large storage penalty. As a side benefit, it is possible to organize the search to obtain successive approximations to the desired solution with considerable reduction in the total search. >

[1]  Michael Stonebraker,et al.  Heuristic search in database systems , 1986 .

[2]  H.V. Jagadish,et al.  Materialization and incremental update of path information , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[3]  Matthias Jarke,et al.  Query processing strategies in the PASCAL/R relational database management system , 1982, SIGMOD '82.

[4]  Antonin Guttman.  New features for a relational database system to support computer aided design , 1984 .

[5]  Paul R. Cohen,et al.  Handbook of AI , 1986 .

[6]  I. Anderson,et al.  Graphs and Networks , 1981, The Mathematical Gazette.

[7]  T H Merrett,et al.  Relational Information Systems , 1983 .

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

[9]  Alexander Borgida,et al.  Efficient management of transitive relationships in large data and knowledge bases , 1989, SIGMOD '89.

[10]  H. V. Jagadish,et al.  Hybrid Transitive Closure Algorithms , 1990, VLDB.

[11]  Rakesh Agrawal.  Alpha: An extension of relational algebra to express a class of recursive queries , 1987, 1987 IEEE Third International Conference on Data Engineering.

[12]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Umeshwar Dayal,et al.  Traversal recursion: a practical approach to supporting recursive applications , 1986, SIGMOD '86.

[15]  Frank Wm. Tompa,et al.  Efficiently updating materialized views , 1986, SIGMOD '86.

[16]  Georges Gardarin,et al.  Querying Real Time Relational Data Bases , 1984, ICC.

[17]  Antonin Guttman,et al.  New Features for Relational Database Systems to Support CAD Applications , 1984 .

[18]  Umeshwar Dayal,et al.  PROBE: A Knowledge-Oriented Database Management System , 1986, On Knowledge Base Management Systems.

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

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[22]  François Bancilhon,et al.  Naive Evaluation of Recursively Defined Relations , 1986, On Knowledge Base Management Systems.

[23]  Eric N. Hanson,et al.  A performance analysis of view materialization strategies , 1987, SIGMOD '87.

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

[25]  H. V. Jagadish,et al.  Direct transitive closure algorithms: design and performance evaluation , 1990, TODS.

[26]  Michael Stonebraker,et al.  Heuristic Search in Data Base Systems , 1984, Expert Database Workshop.

[27]  H. V. Jagadish,et al.  A Compressed Transitive Closure Technique for Efficient Fixed-Point Query Processing , 1988, Expert Database Conf..

[28]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[29]  Yannis E. Ioannidis,et al.  On the Computation of the Transitive Closure of Relational Operators , 1986, VLDB.

[30]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[31]  H. V. Jagadish,et al.  A compression technique to materialize transitive closure , 1990, TODS.