Abstract
Nearest Neighbor (NN) queries are frequently used for location-dependent information services. In this paper, we study a new NN query called Path-based Constrained Nearest Neighbor (PCNN) query, which involves the additional constraints on non-spatial attribute values of data objects on processing a continuous NN search along a path. For PCNN query processing, we propose an efficient PCNN query method based on transformation idea. The proposed method transforms a continuous NN search into static NN queries at discrete intersection nodes. We further leverage peer-to-peer sharing to improve the proposed method. Extensive experiments are conducted, and the results demonstrate the effectiveness of our methods.
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
Lee, D.L., Lee, W.C., Xu, J., Zhang, B.: Data management in location-dependent information services. IEEE Pervasive Computing 1(3), 65–72 (2002)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proc. of VLDB, pp. 802–813. ACM Press, Berlin (2003)
Tao, Y., Papadias, D., Shen, Q.: Continuous Nearest Neighbor Search. In: Proc. of VLDB, pp. 287–298. ACM Press, Hang Kong (2002)
Mokbel, M.F., Xiong, X., Aref, W.G.: SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases. In: Proc. of ACM SIGMOD, pp. 623–634. ACM Press, Paris (2004)
Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring. In: Proc. of ACM SIGMOD, pp. 634–645. ACM Press, Maryland (2005)
Iwerks, G.S., Samet, H., Smith, K.: Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates. In: Proc. of VLDB, pp. 287–298. ACM Press, Berlin (2003)
Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases. In: Proc. of ICDE, pp. 643–654. IEEE Press, Tokyo (2005)
Xiao, Y.Y., Wang, H.Y.: An Efficient Algorithm for Continuous Nearest Neighbor Queries Based on the VDTPR-tree. Journal of Computational Information Systems 4(2), 527–534 (2007)
Feng, J., Watanabe, T.: Search of Continuous Nearest Target Objects along Route on Large Hierarchical Road Network. In: Proc. of Control and Applications, New York, USA, pp. 33–41 (2004)
Kolahdouzan, M., Shahabi, C.: Continuous K-Nearest Neighbor Queries in Spatial Network Databases. In: Proc. of STDBM, Citeseer,Toronto, Canada, pp. 33–40 (2004)
Cho, H.J., Chung, C.W.: An Efficient and Scalable Approach to CNN Queries in a Road Network. In: Proc. of VLDB, pp. 865–876. ACM Press, Trondheim (2005)
Jun, H., Choi, H., Chung, Y.D.: Generalized Spatial Queries in the Wireless Data Broadcasting System. In: Proc. of MDM, Taipei, Taiwan, pp. 279–284 (2009)
Ku, W.S., Zimmermann, R., Wang, H.: Location-Based Spatial Query Processing in Wireless Broadcast Environments. IEEE Transactions on Mobile Computing 7(6), 778–790 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, Y., Shen, Y., Jiang, T., Wang, H. (2012). Path-Based Constrained Nearest Neighbor Search in a Road Network. In: Liddle, S.W., Schewe, KD., Tjoa, A.M., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32600-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-32600-4_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32599-1
Online ISBN: 978-3-642-32600-4
eBook Packages: Computer ScienceComputer Science (R0)