Abstract
Traditional nearest neighbor queries and its variants, such as Group Nearest Neighbor Query (GNN), have been widely studied by many researchers. Recently obstacles are involved in spatial queries. The existence of obstacles may affect the query results due to the visibility of query point. In this paper, we propose a new type of query, Group Visible Nearest Neighbor Query (GVNN), which considers both visibility and distance as constraints. Multiple Traversing Obstacles (MTO) Algorithm and Traversing Obstacles Once (TOO) Algorithm are proposed to efficiently solve GVNN problem. TOO resolves GVNN by defining the invisible region of MBR of query set to prune both data set and obstacle set, and traverses obstacle R*-tree only once. The experiments with different settings show that TOO is more efficient and scalable than MTO.
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
Gao, Y., Zheng, B., Lee, W., Chen, G.: Continuous visible nearest neighbor queries. In: EDBT (2009)
Gao, Y., Zheng, B.: Continuous obstructed nearest neighbor queries in spatial databases. In: SIGMOD (2009)
Zhang, J., Papadias, D., Mouratidis, K., Zhu, M.: Spatial Queries in the Presence of Obstacles. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 366–384. Springer, Heidelberg (2004)
Nutanong, S., Tanin, E., Zhang, R.: Visible Nearest Neighbor Queries. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 876–883. Springer, Heidelberg (2007)
Gao, Y., Zheng, B., Chen, G., Lee, W., Lee, K.C.K., Li, Q.: Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases. IEEE Trans. Knowl. Data Eng. in TKDE (2009)
Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group Nearest Neighbor Queries. In: ICDE (2004)
Frentzos, E., Gratsias, K., Pelekis, N., Theodoridis, Y.: Nearest Neighbor Search on Moving Object Trajectories. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 328–345. Springer, Heidelberg (2005)
Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: SIGMOD Conference (1990)
Zhang, W., Lin, X., Cheema, M.A., Zhang, Y., Wang, W.: Quantile-Based KNN Over Multi-Valued Objects. In: ICDE (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, H., Li, Z., Lu, Y., Deng, K., Zhou, X. (2010). Group Visible Nearest Neighbor Queries in Spatial Databases. In: Chen, L., Tang, C., Yang, J., Gao, Y. (eds) Web-Age Information Management. WAIM 2010. Lecture Notes in Computer Science, vol 6184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14246-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-14246-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14245-1
Online ISBN: 978-3-642-14246-8
eBook Packages: Computer ScienceComputer Science (R0)