Challenges of Navigational Queries: Finding Best Paths in Graphs
Challenges of Navigational Queries: Finding Best Paths in Graphs
Files
Publication or External Link
Date
2005-10-06T16:30:25Z
Authors
Raschid, Louiqa
Vidal, Maria-Esther
Wu, Yao
Cardenas, Marelis
Marquez, Natalia
Advisor
Citation
DRUM DOI
Abstract
Life science sources are characterized by a complex graph of overlapping sources, and multiple alternate links between sources.
A (navigational) query may be answered by traversing multiple alternate paths between an origin and target source. Paths may be characterized by several metrics, including the cardinality of objects of the target source(TOC), the cost of query evaluation of a plan for the path, and the user's preference for specific paths. Our challenge is finding the best paths among the set of
all solutions, AllPaths, that meet some user specified ranking criteria. If the user ranking criteria is strict, then the problem
is to find the Top K paths. If the user wants a trade-off of several metrics, then the problem is to find the Skyline paths that are not dominated by other paths. {\em NSearch} is a naive solution. {\em BFSrchOpt} is a heuristic best-first search strategy. It uses a metric to rank partial solutions (subpaths) and (local) metrics to guide graph traversal, and produces BFPaths. We compare the precision and recall of BFPaths compared to the Top K\% or Skyline of AllPaths.
We study the impact of graph properties on the behavior of {\em BFSrchOpt}. {\em BFSrchOpt} can be orders of magnitude faster than {\em NSearch}.