Name
Abstract | ||
|---|---|---|
It is quite common for networks emerging nowadays to have labels or textual contents on the nodes. On such networks, we study the problem of top-k nearest keyword (k-NK) search. In a network G modeled as an undirected graph, each node is attached with zero or more keywords, and each edge is assigned with a weight measuring its length. Given a query node q in G and a keyword λ, a k-NK query seeks k nodes which contain λ and are nearest to q. 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 a precise shortest distance estimation in a graph. Based on the latest distance oracle technique, we 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. We propose two efficient algorithms to report the exact k-NK result on a tree. One is query time optimized for a scenario when a small number of result nodes are of interest to users. The other handles k-NK queries for an arbitrarily large k efficiently. In obtaining a k-NK result on a graph from that on trees, a global storage technique is proposed to further reduce the index size and the query time. Extensive experimental results conform with our theoretical findings, and demonstrate the effectiveness and efficiency of our k-NK algorithms on large real graphs. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.14778/2536206.2536217 | PVLDB |
Keywords | Field | DocType |
stand-alone query,k-nk query,keyword search,accurate k-nk result,complex graph pattern,k-nk result,query node q,query time,k-nk algorithm,exact k-nk result,original k-nk query,large graph | Query optimization,Block graph,Data mining,Trémaux tree,Tree (graph theory),Graph power,Computer science,Sargable,Oracle,Theoretical computer science,Shortest-path tree,Database | Journal |
Volume | Issue | ISSN |
6 | 10 | 2150-8097 |
Citations | PageRank | References |
21 | 0.67 | 24 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miao Qiao | 1 | 90 | 5.04 |
| Lu Qin | 2 | 1430 | 95.44 |
| Hong Cheng | 3 | 3694 | 148.72 |
| Jeffrey Xu Yu | 4 | 7018 | 464.96 |
| Wentao Tian | 5 | 146 | 4.23 |