ParetoPrep: Efficient Lower Bounds for Path Skylines and Fast Path Computation
Computing cost-optimal paths in network data is an important task in many application areas like transportation networks, computer networks, or social graphs. In many cases, the cost of an edge can be described by various cost criteria. For example, in a road network possible cost criteria are distance, time, ascent, energy consumption or toll fees. In such a multicriteria network, path optimality can be defined in various ways. In particular, optimality might be defined as a combination of the given cost factors. To avoid finding a suitable combination function, methods like path skyline queries return all potentially optimal paths. To compute alternative paths in larger networks, most efficient algorithms rely on lower bound cost estimations to approximate the remaining costs from an arbitrary node to the specified target. In this paper, we introduce ParetoPrep, a new method for efficient lower bound computation which can be used as a preprocessing step in multiple algorithms for computing path alternatives. ParetoPrep requires less time and visits less nodes in the network than state-of-the-art preprocessing steps. Our experiments show that path skyline and linear path skyline computation can be significantly accelareted by ParetoPrep.
KeywordsOptimal Path Target Node Query Time Skyline Query Cost Criterion
This research has received funding from the Shared E-Fleet project (in the IKTII program), by the German Federal Ministry of Economics and Technology (grant no. 01ME12107).
- 3.Borzsonyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering (ICDE), Heidelberg, Germany (2001)Google Scholar
- 7.Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* search meets graph theory. Technical report MSR-TR-2004-24, Microsoft Research (2004)Google Scholar
- 8.Graf, F., Kriegel, H.-P., Renz, M., Schubert, M.: Mario: Multi attribute routing in open street map (2011)Google Scholar
- 9.Guo, C., Jensen, C.S., Kaul, M., Yang, B., Shang, S.: Stochastic skyline route planning under time-varying uncertainty. In: ICDE 2014, pp. 136–147 (2014)Google Scholar
- 13.Kriegel, H.P., Renz, M., Schubert, M.: Route skyline queries: a multi-preference path planning approach. In: ICDE 2010, pp. 261–272 (2010)Google Scholar
- 16.Shekelyan, M., Jossé, G., Schubert, M.: Linear path skylines in multicriteria networks. In: ICDE15, pp. 459–470 (2015)Google Scholar
- 17.Shekelyan, M., Jossé, G., Schubert, M., Kriegel, H.-P.: Linear path skyline computation in bicriteria networks. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) DASFAA 2014, Part I. LNCS, vol. 8421, pp. 173–187. Springer, Heidelberg (2014) CrossRefGoogle Scholar