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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
