Abstract
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a location point, as the query location. Examples of the applications of range NN queries include uncertain locations and privacy-preserving queries. Given a set of objects, the range NN answer is a set of objects that includes the nearest object(s) to every point in a given spatial region. The answer set size would significantly increase as the spatial region gets larger. Unfortunately, mobile users in wireless environments suffer from scarce bandwidth and low-quality communication, transmitting a large answer set from a database server to the user would pose very high response time. To this end, we propose an approximate range NN query processing algorithm to balance a performance tradeoff between query response time and the quality of answers. The distinct features of our algorithm are that (1) it allows the user to specify an approximation tolerance level k, so that we guarantee to provide an answer set \({\cal A}\) such that each object in \({\cal A}\) is one of the k nearest objects to every point in a given query region; and (2) it minimizes the number of objects returned in an answer set, in order to minimize the transmission time of sending the answer set to the user. Extensive experimental results show that our proposed algorithm is scalable and effectively reduces query response time while providing approximate query answers that satisfy the user specified approximation tolerance level.
This work is supported in part by the National Science Foundation under Grants IIS-0811998, IIS-0811935, and CNS-0708604.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest and reverse nearest neighbor queries for moving objects. VLDB Journal 15(3), 229–249 (2006)
Hu, H., Xu, J., Lee, D.L.: A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD (2005)
Mouratidis, K., Papadias, D., Hadjieleftheriou, M.: Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In: SIGMOD (2005)
Mokbel, M.F., Xiong, X., Aref, W.G.: Sina: Scalable incremental processing of continuous queries in spatio-temporal databases. In: SIGMOD (2004)
Zheng, B., Xu, J., Lee, W.C., Lee, D.L.: Grid-partition index: A hybrid method for nearest-neighbor queries in wireless location-based services. VLDB Journal 15(1), 21–39 (2006)
Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB (2002)
Hu, H., Lee, D.L.: Range nearest-neighbor query. IEEE TKDE 18(1), 78–91 (2006)
Kalnis, P., Ghinita, G., Mouratidis, K., Papadias, D.: Preventing location-based identity inference in anonymous spatial queries. IEEE TKDE 19(12), 1719–1733 (2007)
Mokbel, M.F., Chow, C.Y., Aref, W.G.: The new casper: Query processing for location services without compromising privacy. In: VLDB (2006)
de Almeida, V.T., Güting, R.H.: Supporting uncertainty in moving objects in network databases. In: ACM GIS (2005)
Cheng, R., Kalashnikov, D.V., Prabhakar, S.: Querying imprecise data in moving object environments. IEEE TKDE 16(9), 1112–1127 (2004)
Pfoser, D., Jensen, C.S.: Capturing the uncertainty of moving-object representations. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, p. 111. Springer, Heidelberg (1999)
Trajcevski, G., Wolfson, O., Hinrichs, K., Chamberlain, S.: Managing uncertainty in moving objects databases. ACM TODS 29(3), 463–507 (2004)
Yiu, M.L., Mamoulis, N., Dai, X., Tao, Y., Vaitis, M.: Efficient evaluation of probabilistic advanced spatial queries on existentially uncertain data. IEEE TKDE 21(1), 108–122 (2009)
Bamba, B., Liu, L., Pesti, P., Wang, T.: Supporting anonymous location queries in mobile environments with privacygrid. In: WWW (2008)
Cheng, R., Zhang, Y., Bertino, E., Prabhakar, S.: Preserving user location privacy in mobile data management infrastructures. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol. 4258, pp. 393–412. Springer, Heidelberg (2006)
Ghinita, G., Kalnis, P., Skiadopoulos, S.: Mobihide: A mobile peer-to-peer system for anonymous location-based queries. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 221–238. Springer, Heidelberg (2007)
Gedik, B., Liu, L.: Protecting location privacy with personalized k-anonymity: Architecture and algorithms. IEEE Trans. on Mobile Computing 7(1), 1–18 (2008)
Hu, H., Xu, J.: Non-exposure location anonymity. In: ICDE (2009)
Lee, D.T.: On k-nearest neighbor voronoi diagrams in the plane. IEEE Trans. on Computers 31(6), 478–487 (1982)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chow, CY., Mokbel, M.F., Naps, J., Nath, S. (2009). Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds) Advances in Spatial and Temporal Databases. SSTD 2009. Lecture Notes in Computer Science, vol 5644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02982-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-02982-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02981-3
Online ISBN: 978-3-642-02982-0
eBook Packages: Computer ScienceComputer Science (R0)