Abstract
This paper presents a research study on skyline path queries. Given a source s and a destination d on a road network and multiple path search criteria (e.g., short distance and short travel time), a skyline query returns a set of non-dominated paths from s to d. These non-dominated paths are called skyline paths. Efficient computation of skyline path queries is very challenging due to expensive network traversals and extensive path comparisons in dominance tests. In this paper, we explore the characteristics of skyline paths, based on which a novel skyline path search algorithm called SkyPath is proposed. To narrow down the search scope for result skyline paths, partial dominance test and full path dominance test are devised as two components of SkyPath. Evaluation results show the superiority of the SkyPath algorithm over the state-of-the-art approaches.
Sign-in/Register to access full text options 
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 call
