Abstract
Bichromatic reverse nearest neighbor (BRNN) based query uses the number of reverse nearest customers to model the influence of a facility location. The query has great potential for real life applications and receives considerable attentions from spatial database studies. In real world, facilities are inevitably constrained by designed capacities. When the needs of service increase, facilities in those booming areas may suffer from overloading. In this paper, we study a new kind of BRNN related query. It aims at finding most promising candidate locations to increase the overall service quality. To efficiently answer the query, we propose an O(nlogn) algorithm using pruning techniques and spatial indices. To evaluate the efficiency of proposed algorithm, we conduct extensive experiments on both real and synthetic datasets. The results show our algorithm has superior performance over the basic solution.
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
Huang, J., Wen, Z.: Top-k most influential locations selection. In: CIKM 2011 (2011)
Jianzhong, Q., Rui, Z.: The min-dist location selection query. In: ICDE 2012 (2012)
Korn, F.: Influence sets based on reverse nearest neighbor queries. SIGMOD Rec. (2000)
Leong Hou, U.: Capacity constrained assignment in spatial databases. In: SIGMOD 2008 (2008)
Stanoi, I.: Discovery of influence sets in frequently updated databases. In: VLDB 2001 (2001)
Wong, R.C.-W., Özsu, M.T.: Efficient method for maximizing bichromatic reverse nearest neighbor. Proc. VLDB Endow. (2009)
Wong, R.C.-W., Tao, Y.: On efficient spatial matching. In: VLDB 2007 (2007)
Xia, T., Zhang, D.: On computing top-t most influential spatial sites. In: VLDB 2005 (2005)
Zhang: Progressive computation of the min-dist optimal-location query. In: VLDB 2006 (2006)
Zhou, Z., Wu, W.: Maxfirst for maxbrknn. In: ICDE (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, Y., Huang, J., Chen, Y., Du, X., Zhang, R. (2012). Top-k Most Incremental Location Selection with Capacity Constraint. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds) Web-Age Information Management. WAIM 2012. Lecture Notes in Computer Science, vol 7418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32281-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-32281-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32280-8
Online ISBN: 978-3-642-32281-5
eBook Packages: Computer ScienceComputer Science (R0)