Abstract
Consider a road network G on which a set C of clients and a set S of servers are located. Optimal location query (OLQ) in road networks is to find a location such that when a new server is set up at this location, a certain objective function computed based on the clients and the servers serving the clients is optimized. In this paper, we study the OLQ with the MinSum objective function in road networks, namely the MinSum query. This problem has been studied before, but the state-of-the-art is still not efficient enough. We propose an efficient algorithm based on the two-level pruning technique. We also study the extension of the MinSum query problem, namely the optimal multiple-location MinSum query. Since this extension is shown to be NP-hard, we propose a greedy algorithm. Moreover, we give an approximate guarantee for our solution. Extensive experiments on the real road networks were conducted to show the efficiency of our proposed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cabello, S., Diaz-Banez, J.M., Langerman, S., Seara, C., Ventura, I.: Reverse facility location problems. In: CCCG (2005)
Cardinal, J., Langerman, S.: Min-max-min geometric facility location problems. In: EWCG (2006)
Chen, Z., Liu, Y., Wong, R.C.W., Xiong, J., Mai, G., Long, C.: Efficient algorithms for optimal location queries in road networks. In: SIGMOD (2014)
Chen, Z., Liu, Y., Wong, R.C.W., Xiong, J., Mai, G., Long, C.: Optimal location queries in road networks. ACM Trans. Database Syst. 40(3), 17 (2015)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)
Du, Y., Zhang, D., Xia, T.: The optimal-location query. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 163–180. Springer, Heidelberg (2005). doi:10.1007/11535331_10
Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD (2000)
Gamper, J., Böhlen, M., Innerebner, M.: Scalable computation of isochrones with network expiration. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol. 7338, pp. 526–543. Springer, Heidelberg (2012). doi:10.1007/978-3-642-31235-9_35
Ghaemi, P., Shahabi, K., Wilson, J.P., Kashani, F.B.: A comparative study of two approaches for supporting optimal network location queries. GeoInformatica 18(2), 229–251 (2014)
Krarup, J., Pruzan, P.M.: The simple plant location problem: survey and synthesis. Eur. J. Oper. Res. 12(1), 36–57 (1983)
Liu, R., Fu, A.W.C., Chen, Z., Huang, S., Liu, Y.: Finding multiple new optimal locations in a road network. In: SIGSPATIAL (2016)
Liu, Y., Wong, R.C.W., Wang, K., Li, Z., Chen, C., Chen, Z.: A new approach for maximizing bichromatic reverse nearest neighbor search. Knowl. Inf. Syst. 36(1), 23–58 (2013)
Long, C., Wong, R.C.W., Yu, P.S., Jiang, M.: On optimal worst-case matching. In: SIGMOD (2013)
Qi, J., Zhang, R., Kulik, L., Lin, D., Xue, Y.: The min-dist location selection query. In: ICDE (2012)
Qi, J., Zhang, R., Wang, Y., Xue, A.Y., Yu, G., Kulik, L.: The min-dist location selection and facility replacement queries. World Wide Web 17(6), 1261–1293 (2014)
Tansel, B.C., Francis, R.L., Lowe, T.J.: Location on networks: a survey. Manage. Sci. 29(4), 498–511 (1983)
Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. PVLDB 9(12), 1053–1064 (2016)
U, L.H., Yiu, M.L., Mouratidis, K., Mamoulis, N.: Capacity constrained assignment in spatial databases. In: SIGMOD (2008)
Vlachou, A., Doulkeridis, C., Kotidis, Y., Norvag, K.: Monochromatic and bichromatic reverse top-k queries. IEEE Trans. Knowl. Data Eng. 23(8), 1215–1229 (2011)
Wong, R.C.W., Ozsu, M.T., Fu, A.W.C., Yu, P.S., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB 2(1), 1126–1137 (2009)
Wong, R.C.W., Ozsu, M.T., Fu, A.W.C., Yu, P.S., Liu, L., Liu, Y.: Maximizing bichromatic reverse nearest neighbor for lp-norm in two- and three-dimensional spaces. VLDB J. 20, 893–919 (2011)
Wong, R.C.W., Tao, Y., Fu, A.W.C., Xiao, X.: On efficient spatial matching. In: VLDB (2007)
Xiao, X., Yao, B., Li, F.: Optimal location queries in road network databases. In: ICDE (2011)
Xu, Z., Jacobsen, H.A.: Processing proximity relations in road networks. In: SIGMOD (2010)
Yan, D., Wong, R.C.W., Ng, W.: Efficient methods for finding influential locations with adaptive grids. In: CIKM (2011)
Yao, B., Xiao, X., Li, F., Wu, Y.: Dynamic monitoring of optimal locations in road network databases. VLDB J. 23(5), 697–720 (2014)
Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive computation of the min-dist optimal-location query. In: VLDB (2006)
Zhou, Z., Wu, W., Li, X., Lee, M.L., Hsu, W.: MaxFirst for MaxBRkNN. In: ICDE (2011)
Acknowledgements
We are very thankful to the anonymous reviewers for the very useful comments. This paper is supported by the NSFC (61572537, U1401256, U1501252) and the Science and Technology Planning Project of Guangdong Province, China (2014A080802003).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Xu, L., Mai, G., Chen, Z., Liu, Y., Dai, G. (2017). MinSum Based Optimal Location Query in Road Networks. In: Candan, S., Chen, L., Pedersen, T., Chang, L., Hua, W. (eds) Database Systems for Advanced Applications. DASFAA 2017. Lecture Notes in Computer Science(), vol 10178. Springer, Cham. https://doi.org/10.1007/978-3-319-55699-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-55699-4_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55698-7
Online ISBN: 978-3-319-55699-4
eBook Packages: Computer ScienceComputer Science (R0)