Top-K possible shortest path query over a large uncertain graph

Authors:
Lei Zou;Peng Peng;Dongyan Zhao
Affiliations:
Peking University, Beijing, China;Peking University, Beijing, China;Peking University, Beijing, China
Venue:
WISE'11 Proceedings of the 12th international conference on Web information system engineering
Year:
2011

Citing 9
Cited 0

Introduction to Algorithms

Introduction to Algorithms
Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation

IEEE Transactions on Knowledge and Data Engineering
Reachability and Distance Queries via 2-Hop Labels

SIAM Journal on Computing
Yago: a core of semantic knowledge

Proceedings of the 16th international conference on World Wide Web
Optimization and evaluation of shortest path queries

The VLDB Journal — The International Journal on Very Large Data Bases
Scalable network distance browsing in spatial databases

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Monte-Carlo algorithms for enumeration and reliability problems

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
NAGA: Searching and Ranking Knowledge

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficiently answering probability threshold-based shortest path queries over uncertain graphs

DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the top-k possible shortest path (kSP) queries in a large uncertain graph, specifically, given two vertices S and T, a kSP query reports the top-k possible shortest paths from S to T. Different from existing solutions for uncertain graph problems, we adopt the possible worlds semantics. Although possible worlds semantics have been studied widely in relational databases, the graph structure leads to more complexity in computational model. The main contribution of this paper lies in developing lower and upper bounds for the probability that one path is the shortest path in an uncertain graph, based on which, a filter-and-refine framework is proposed to answer kSP queries. We demonstrate the superiority of our method by extensive experiments.