Abstract
In this paper, we introduce a new interesting path finding problem, which is the Skyline Trips of Multiple POIs Categories (STMPC) query. In particular, given a road network with a set of Points of Interest (POIs) from different categories, a list of items the user is planning to purchase and a pricing function for items at each related POI; find the skyline trips in term of both trip length and trip aggregated cost. This query has important applications in everyday life. Specifically, it assists people to choose the most suitable trips among the skyline trips based on two dimensions; trip total length and trip aggregated cost. We prove the problem is NP-hard and we distinguish it from existing related problems. We also proposed a framework and two effective algorithms to efficiently solve the STMPC query in real time and produce near optimal results when tested on real datasets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ali, M.E., Tanin, E., Zhang, R., Kulik, L.: A motion-aware approach for efficient evaluation of continuous queries on 3d object databases. The VLDB Journal The International Journal on Very Large Data Bases 19(5), 603–632 (2010)
Aljubayrin, S., Qi, J., Jensen, C.S., Zhang, R., He, Z., Wen, Z.: The safest path via safe zones. In: ICDE (2015)
Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the17th International Conference on Data Engineering, pp. 421–430. IEEE (2001)
Chen, H., Ku, W.S., Sun, M.T., Zimmermann, R.: The multi-rule partial sequenced route query. In: Proceedings of the 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. p. 10. ACM (2008)
Comer, D.: Ubiquitous b-tree. ACM Computing Surveys (CSUR) 11(2), 121–137 (1979)
Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part I. LNCS, vol. 6261, pp. 432–449. Springer, Heidelberg (2010)
Deng, K., Zhou, X., Shen, H.T.: Multi-source skyline query processing in road networks. In: IEEE 23rd International Conference on Data Engineering, ICDE 2007, pp. 796–805. IEEE (2007)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)
Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. BioSystems 43(2), 73–81 (1997)
Eunus Ali, M., Zhang, R., Tanin, E., Kulik, L.: A motion-aware approach to continuous retrieval of 3d objects. In: IEEE 24th International Conference on Data Engineering, ICDE 2008, pp. 843–852. IEEE (2008)
Guttman, A.: R-trees: a dynamic index structure for spatial searching, vol. 14. ACM (1984)
Huang, X., Jensen, C.S.: In-Route Skyline Querying for Location-Based Services. In: Kwon, Y.-J., Bouju, A., Claramunt, C. (eds.) W2GIS 2004. LNCS, vol. 3428, pp. 120–135. Springer, Heidelberg (2005)
Huang, Y.K., Chang, C.H., Lee, C.: Continuous distance-based skyline queries in road networks. Information Systems 37(7), 611–633 (2012)
Jang, S.M., Yoo, J.S.: Processing continuous skyline queries in road networks. In: International Symposium on Computer Science and its Applications, CSA 2008, pp. 353–356. IEEE (2008)
Jensen, C.S., Kolářvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: Proceedings of the 11th ACM International Symposium on Advances in Geographic Information Systems, pp. 1–8. ACM (2003)
Kanza, Y., Levin, R., Safra, E., Sagiv, Y.: Interactive route search in the presence of order constraints. Proceedings of the VLDB Endowment 3(1–2), 117–128 (2010)
Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 275–286. VLDB Endowment (2002)
Kriegel, H.P., Renz, M., Schubert, M.: Route skyline queries: A multi-preference path planning approach. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE), pp. 261–272. IEEE (2010)
Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On Trip Planning Queries in Spatial Databases. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005)
Mouratidis, K., Lin, Y., Yiu, M.L.: Preference queries in large multi-cost transportation networks. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE), pp. 533–544. IEEE (2010)
Nutanong, S., Zhang, R., Tanin, E., Kulik, L.: The v*-diagram: a query-dependent approach to moving knn queries. Proceedings of the VLDB Endowment 1(1), 1095–1106 (2008)
Pyle, D.: Data preparation for data mining, vol. 1. Morgan Kaufmann (1999)
Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica 7(3), 255–273 (2003)
Sharifzadeh, M., Kolahdouzan, M., Shahabi, C.: The optimal sequenced route query. The VLDB Journal 17(4), 765–787 (2008)
Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 751–762. VLDB Endowment (2006)
Shipman, D.W.: The functional data model and the data languages daplex. ACM Transactions on Database Systems (TODS) 6(1), 140–173 (1981)
Tan, K.L., Eng, P.K., Ooi, B.C., et al.: Efficient progressive skyline computation. VLDB 1, 301–310 (2001)
Tian, Y., Lee, K.C., Lee, W.C.: Finding skyline paths in road networks. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 444–447. ACM (2009)
Vranken, W.F., Boucher, W., Stevens, T.J., Fogh, R.H., Pajon, A., Llinas, M., Ulrich, E.L., Markley, J.L., Ionides, J., Laue, E.D.: The ccpn data model for nmr spectroscopy: development of a software pipeline. Proteins: Structure, Function, and Bioinformatics 59(4), 687–696 (2005)
Zhang, R., Lin, D., Ramamohanarao, K., Bertino, E.: Continuous intersection joins over moving objects. In: IEEE 24th International Conference on Data Engineering, ICDE 2008, pp. 863–872. IEEE (2008)
Zhang, R., Qi, J., Lin, D., Wang, W., Wong, R.C.W.: A highly optimized algorithm for continuous intersection join queries over moving objects. The VLDB Journal The International Journal on Very Large Data. Bases 21(4), 561–586 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Aljubayrin, S., He, Z., Zhang, R. (2015). Skyline Trips of Multiple POIs Categories. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M. (eds) Database Systems for Advanced Applications. DASFAA 2015. Lecture Notes in Computer Science(), vol 9050. Springer, Cham. https://doi.org/10.1007/978-3-319-18123-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-18123-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18122-6
Online ISBN: 978-3-319-18123-3
eBook Packages: Computer ScienceComputer Science (R0)