Rakesh Agrawal, Christopher Johnson, et al.
ICDE 2006
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 total search. © 1994 IEEE
Rakesh Agrawal, Christopher Johnson, et al.
ICDE 2006
Yao Qi, Raja Das, et al.
ISSTA 2009
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997