Skip to main content
Springer Nature Link
Log in

The Optimal-Location Query

  • Conference paper
Advances in Spatial and Temporal Databases (SSTD 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3633))

Included in the following conference series:

Abstract

We propose and solve the optimal-location query in spatial databases. Given a set S of sites, a set O of weighted objects, and a spatial region Q, the optimal-location query returns a location in Q with maximum influence. Here the influence of a location l is the total weight of its RNNs, i.e. the total weight of objects in O that are closer to l than to any site in S. This new query has practical applications, but is very challenging to solve. Existing work on computing RNNs assumes a single query location, and thus cannot be used to compute optimal locations. The reason is that there are infinite candidate locations in Q. If we check a finite set of candidate locations, the result can be inaccurate, i.e. the revealed location may not have maximum influence. This paper proposes three methods that accurately compute optimal locations. The first method uses a standard R*-tree. To compute an optimal location, the method retrieves certain objects from the R*-tree and sends them as a stream to a plane-sweep algorithm, which uses a new data structure called the aSB-tree to ensure query efficiency. The second method is based on a new index structure called the OL-tree, which novelly extends the k-d-B-tree to store segmented rectangular records. The OL-tree is only of theoretical usage for it is not space efficient. The most practical approach is based on a new index structure called the Virtual OL-tree. These methods are theoretically and experimentally evaluated.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  2. Korn, F., Muthukrishnan, S.: Influence Sets Based on Reverse Nearest Neighbor Queries. In: SIGMOD, pp. 201–212 (2000)

    Google Scholar 

  3. Lee, D.T., Wong, C.K.: Voronoi Diagram in L1 (L ∞ ) Metrics with 2-Dimensional Storage Applications. SIAM Journal on Computing 9, 200–211 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP Operations in Spatial Data Warehouses. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 443–459. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD, pp. 71–79 (1995)

    Google Scholar 

  6. Stanoi, I., Agrawal, D., El Abbadi, A.: Reverse Nearest Neighbor Queries for Dynamic Databases. In: ACM/SIGMOD Int. Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD), pp. 44–53 (2000)

    Google Scholar 

  7. Shekhar, S., Kohli, A., Coyle, M.: Path Computation Algorithms for Advanced Traveller Information System (ATIS). In: ICDE, pp. 31–39 (1993)

    Google Scholar 

  8. Smid, M.: Closest Point Problems in Computational Geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook on Computational Geometry. Elsevier Science Publishing, Amsterdam (1997)

    Google Scholar 

  9. Stanoi, I., Riedewald, M., Agrawal, D., El Abbadi, A.: Discovery of Influence Sets in Frequently Updated Databases. In: VLDB, pp. 99–108 (2001)

    Google Scholar 

  10. Theodoridis, Y.: The R-tree-portal (2003), http://www.rtreeportal.org

  11. Tao, Y., Papadias, D., Lian, X.: Reverse kNN Search in Arbitrary Dimensionality. In: VLDB, pp. 744–755 (2004)

    Google Scholar 

  12. Yang, C., Lin, K.-I.: An Index Structure for Efficient Reverse Nearest Neighbor Queries. In: ICDE, pp. 485–492 (2001)

    Google Scholar 

  13. Yang, J., Widom, J.: Incremental Computation and Maintenance of Temporal Aggregates. In: ICDE, pp. 51–60 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer & Information Science, Northeastern University, Boston, MA, 02115, USA

    Yang Du, Donghui Zhang & Tian Xia

Authors
  1. Yang Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Donghui Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tian Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computing, CP 6176, University of Campinas, 13084-971, Campinas, Brazil

    Claudia Bauzer Medeiros

  2. National Center for Geographic Information and Analysis and Department of Spatial Information Science and Engineering, University of Maine, Boardman Hall, ME 04469-5711, Orono, USA

    Max J. Egenhofer

  3. Purdue University,  

    Elisa Bertino

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Du, Y., Zhang, D., Xia, T. (2005). The Optimal-Location Query. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds) Advances in Spatial and Temporal Databases. SSTD 2005. Lecture Notes in Computer Science, vol 3633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535331_10

Download citation

  • DOI: https://doi.org/10.1007/11535331_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28127-6

  • Online ISBN: 978-3-540-31904-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics