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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (1997)
Korn, F., Muthukrishnan, S.: Influence Sets Based on Reverse Nearest Neighbor Queries. In: SIGMOD, pp. 201–212 (2000)
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)
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)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD, pp. 71–79 (1995)
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)
Shekhar, S., Kohli, A., Coyle, M.: Path Computation Algorithms for Advanced Traveller Information System (ATIS). In: ICDE, pp. 31–39 (1993)
Smid, M.: Closest Point Problems in Computational Geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook on Computational Geometry. Elsevier Science Publishing, Amsterdam (1997)
Stanoi, I., Riedewald, M., Agrawal, D., El Abbadi, A.: Discovery of Influence Sets in Frequently Updated Databases. In: VLDB, pp. 99–108 (2001)
Theodoridis, Y.: The R-tree-portal (2003), http://www.rtreeportal.org
Tao, Y., Papadias, D., Lian, X.: Reverse kNN Search in Arbitrary Dimensionality. In: VLDB, pp. 744–755 (2004)
Yang, C., Lin, K.-I.: An Index Structure for Efficient Reverse Nearest Neighbor Queries. In: ICDE, pp. 485–492 (2001)
Yang, J., Widom, J.: Incremental Computation and Maintenance of Temporal Aggregates. In: ICDE, pp. 51–60 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)