Top-K Nearest Keyword Search on Large Graphs
k-NK is not only useful as a stand-alone query but also as a building block for tackling complex graph pattern matching problems. The key to an accurate k-NK result is precise shortest distance estimation in a graph. Based on the latest distance oracle technique, the authors build a shortest path tree for a distance oracle and use the tree distance as a more accurate estimation. With such representation, the original k-NK query on a graph can be reduced to answering the query on a set of trees and then assembling the results obtained from the trees.
Provided by: Chinese University of Hong Kong
Topic: Big Data
Date Added: Aug 2013
Format: PDF