Skip to main content
SpringerLink
Log in

Resource Allocation Problems in Spatial Databases

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

  • 139 Accesses

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 via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Du Y, Zhang D, Xia T. The optimal-location query. In: Proceedings of 9th International Symposium on Advances in Spatial and Temporal Databases; 2005. p. 163–80.

    Google Scholar 

  2. Mouratidis K, Papadias D, Papadimitriou S. Medoid queries in large spatial databases. In: Proceedings of 9th International Symposium on Advances in Spatial and Temporal Databases; 2005. p. 55–72.

    Google Scholar 

  3. Papadopoulos S, Sacharidis D, Mouratidis K. Continuous medoid queries over moving objects. In: Proceedings of 10th International Symposium on Advances in Spatial and Temporal Databases; 2007. p. 38–56.

    Google Scholar 

  4. U LH, Mamoulis N, Yiu ML. Continuous monitoring of exclusive closest pairs. In: Proceedings of 10th International Symposium on Advances in Spatial and Temporal Databases; 2007. p. 1–19.

    Google Scholar 

  5. Vygen J. Approximation algorithms for facility location problems (lecture notes). Technical Report, University of Bonn; 2005. p. 1–59.

    Google Scholar 

  6. Zhang D, Du Y, Xia T, Tao Y. Progressive computation of the min-dist optimal-location query. In: Proceedings of 32nd International Conference on Very Large Data Bases; 2006. p. 643–54.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Paradigm4, Inc, Waltham, MA, USA

    Donghui Zhang

  2. Northeastern University, Boston, MA, USA

    Yang Du

Authors
  1. Donghui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Donghui Zhang .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. Dept. of Computer Science and Eng., Hong Kong Univ. of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, Hong Kong SAR

    Dimitris Papadias

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Zhang, D., Du, Y. (2014). Resource Allocation Problems in Spatial Databases. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_315-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_315-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation