Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Resource Allocation Problems in Spatial Databases

  • Donghui Zhang
  • Yang Du
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_315

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...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    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.CrossRefGoogle Scholar
  2. 2.
    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.CrossRefGoogle Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Vygen J. Approximation algorithms for facility location problems (lecture notes). Technical Report, University of Bonn; 2005. p. 1–59.Google Scholar
  6. 6.
    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.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Paradigm4, Inc.WalthamUSA
  2. 2.Northeastern UniversityBostonUSA

Section editors and affiliations

  • Dimitris Papadias
    • 1
  1. 1.Dept. of Computer Science and Eng.Hong Kong Univ. of Science and TechnologyKowloonHong Kong SAR