Route skyline queries: A multi-preference path planning approach

— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects being optimal w.r.t. an arbitrary linear weighting of the underlying criteria. The most prominent example query is to find a reasonable set of hotels which are cheap but close to the beach. In this paper, we propose an new approach for computing skylines on routes (paths) in a road network considering multiple preferences like distance, driving time, the number of traffic lights, gas consumption, etc. Since the consideration of different preferences usually involves different routes, a skyline-fashioned answer with relevant route candidates is highly useful. In our work, we employ graph embedding techniques to enable a bestfirst based graph exploration considering route preferences based on arbitrary road attributes. The core of our skyline query processor is a route iterator which iteratively computes the top...

• Type: Conference
• Year: 2010
• Where: ICDE
• Authors: Hans-Peter Kriegel, Matthias Renz, Matthias Schubert
• Keywords: Database, Graph Exploration, ICDE 2010, Relevant Route Candidates, Route Candidates