Abstract
As the fundamental application of Location Based Service (LBS), k nearest neighbors query has received dramatic attention. In this paper, for the first time, we study how to monitor the weighted k nearest neighbors(WkNN) in a novel weighted space to reflect more complex scenario. Different from traditional kNN approaches, the distances are measured according to a weighted Euclidean metric. The length of a path is defined to be the sum of its weighted subpaths, where a weighted subpath is relative to the weights of its passing regions. By dividing the plane into a set of Combination Regions, a data structure “Weighted Indexing Map”(WIM) is presented. The WIM keeps an index of the weighted length information. Based on WIM, we propose an efficient algorithm, called wNeighbors, for answering the WkNN query. The experimental results show that our WIM based WkNN processing algorithm are effective and efficient.
This research was partially supported by the National Natural Science Foundation of China under Grant No.60773220, No.61003058 and No.60933001, and the 863 High Technology Foundation of China under Grant No. 2009AA01Z131.
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.
Similar content being viewed by others
References
Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The r*-tree: an efficient and robust access method for points and rectangles. ACM SIGMOD Record 19(2), 322–331 (1990)
Chen, Z., Shen, H.T., Zhou, X., Yu, J.X.: Monitoring path nearest neighbor in road networks. In: SigMod (2009)
Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)
Gao, Y., Zheng, B.: Continuous obstructed nearest neighbor queries in spatial databases. In: SIGMOD, pp. 577–590 (2009)
Gao, Y., Zheng, B., Chen, G., Lee, W.-C., Lee, K.C., Li, Q.: Visible reverse k-nearest neighbor query processing in spatial databases. TKDE 21(9), 1314–1327 (2009)
Gao, Y., Zheng, B., Chen, G., Lee, W.-C., Lee, K.C.K., Li, Q.: Visible reverse k-nearest neighbor queries. In: ICDE, pp. 1203–1206 (2009)
Gao, Y., Zheng, B., Lee, W.-C., Chen, G.: Continuous visible nearest neighbor queries. In: EDBT, pp. 144–155 (2009)
Guibas, L., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of Voronoi. ACM Transactions on Graphics (TOG) 4(2), 123 (1985)
Hjaltason, G., Samet, H.: Ranking in spatial databases. In: Advances in Spatial Databases, pp. 83–95. Springer, Heidelberg (1995)
Hu, H., Lee, D., Lee, V.: Distance indexing on road networks. In: Proceedings of the 32nd International Conference on Very Large Data Bases, p. 905, VLDB Endowment (2006)
Jagadish, H., Ooi, B., Tan, K., Yu, C., Zhang, R.: iDistance: An adaptive B-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS 2005) 30(2), 364–397 (2005)
Li, C., Gu, Y., Li, F., Chen, M.: Moving k-nearest neighbor query over obstructed regions. In: APWeb, Pusan, Korea (2010)
Mitchell, J., Papadimitriou, C.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM (JACM) 38(1), 18–73 (1991)
Nutanong, S., Zhang, R., Tanin, E., Kulik, L.: The v*diagram: A query dependent approach to moving knn queries. In: VLDB, pp. 1095–1106 (2008)
Papadakis, N., Perakis, A.: Deterministic minimal time vessel routing. Operations Research 38(3), 426–438 (1990)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proceedings of the 29th International Conference on Very Large Data Bases, vol. 29, pp. 802–813, VLDB Endowment (2003)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71–79 (1995)
Zhang, J., Papadias, D., Mouratidis, K., Zhu, M.: Spatial queries in the presence of obstacles. In: Hwang, J., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 366–384. Springer, Heidelberg (2004)
Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.L.: Location-based spatial queries. In: SIGMOD, pp. 443–454 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, C., Gu, Y., Yu, G., Li, F. (2011). wNeighbors: A Method for Finding k Nearest Neighbors in Weighted Regions. In: Yu, J.X., Kim, M.H., Unland, R. (eds) Database Systems for Advanced Applications. DASFAA 2011. Lecture Notes in Computer Science, vol 6588. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20152-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-20152-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20151-6
Online ISBN: 978-3-642-20152-3
eBook Packages: Computer ScienceComputer Science (R0)