Issue No. 02 - April (1994 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.277767
<p>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.</p>
graph theory; search problems; deductive databases; data structures; query processing; very large databases; approximation theory; database theory; massive graphs; simulation; disk storage; data-intensive expert system; path problems; deductive database systems; data structuring technique; branch and bound search algorithm; search space pruning; successive approximations; path queries; query processing; shortest distance
H. Jagadish and R. Agrawal, "Algorithms for Searching Massive Graphs," in IEEE Transactions on Knowledge & Data Engineering, vol. 6, no. , pp. 225-238, 1994.