Synonyms
Facility-location problem
Definition
Assume that a franchise plans to open one or more branches in a state. How shall the locations of the new branches be allocated to maximally benefit the customers? Depending on whether some branches already exist and how to quantify the benefits to the customers, there are multiple forms of such resource allocation problems. In spatial databases, distance plays an important role. A customer is assumed to always visit the closest branch. Therefore it is beneficial to a customer if a new branch is opened at a location closer than her closest existing branch. The max-inf optimal-location query assumes the existence of a set of sites (already opened franchise branches), and aims to find a new location within a given area which benefits the largest number of customers. The min-dist optimal-location queryalso assumes the existence of a set of sites and aims to find a location for a new site which is optimal; but here the optimality is defined...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Du Y, Zhang D, Xia T. The optimal-location query. In: Proceedings of the 9th International Symposium on Advances in Spatial and Temporal Databases; 2005. p. 163–80.
Mouratidis K, Papadias D, Papadimitriou S. Medoid queries in large spatial databases. In: Proceedings of the 9th International Symposium on Advances in Spatial and Temporal Databases; 2005. p. 55–72.
Papadopoulos S, Sacharidis D, Mouratidis K. Continuous medoid queries over moving objects. In: Proceedings of the 10th International Symposium on Advances in Spatial and Temporal Databases; 2007. p. 38–56.
U LH, Mamoulis N, Yiu ML. Continuous monitoring of exclusive closest pairs. In: Proceedings of the 10th International Symposium on Advances in Spatial and Temporal Databases; 2007. p. 1–19.
Vygen J. Approximation algorithms for facility location problems (lecture notes). Technical Report, University of Bonn; 2005. p. 1–59.
Zhang D, Du Y, Xia T, Tao Y. Progressive computation of the min-dist optimal-location query. In: Proceedings of the 32nd International Conference on Very Large Data Bases; 2006. p. 643–54.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Zhang, D., Du, Y. (2018). Resource Allocation Problems in Spatial Databases. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_315
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_315
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering