ABSTRACT
In this paper, we study a novel variant of obstructed nearest neighbor queries, namely, range-based obstructed nearest neighbor (RONN) search. A natural generalization of continuous obstructed nearest-neighbor (CONN), an RONN query retrieves the obstructed nearest neighbor for every point in a specified range. To process RONN, we first propose a CONN-Based (CONNB) algorithm as our baseline, which reduces the RONN query into a range query and four CONN queries processed using an R-tree. To address the shortcomings of the CONNB algorithm, we then propose a new RONN by R-tree Filtering (RONN-RF) algorithm, which explores effective filtering, also using R-tree. Next, we propose a new index, called O-tree, dedicated for indexing objects in the obstructed space. The novelty of O-tree lies in the idea of dividing the obstructed space into non-obstructed subspaces, aiming to efficiently retrieve highly qualified candidates for RONN processing. We develop an O-tree construction algorithm and propose a space division scheme, called optimal obstacle balance (OOB) scheme, to address the tree balance problem. Accordingly, we propose an efficient algorithm, called RONN by O-tree Acceleration (RONN-OA), which exploits O-tree to accelerate query processing of RONN. In addition, we extend O-tree for indexing polygons. At last, we conduct a comprehensive performance evaluation using both real and synthetic datasets to validate our ideas and the proposed algorithms. The experimental result shows that the RONN-OA algorithm outperforms the two R-tree based algorithms significantly. Moreover, we show that the OOB scheme achieves the best tree balance in O-tree and outperforms two baseline schemes.
- J. Bao, C.-Y. Chow, M. F. Mokbel, and W.-S. Ku. Efficient evaluation of k-range nearest neighbor queries in road networks. MDM, pages 115--124, 2010. Google ScholarDigital Library
- N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. SIGMOD, pages 322--331, 1990. Google ScholarDigital Library
- N. Chan and T. Dang. On efficient processing of complicated cloaked region for location privacy aware nearest-neighbor queries. International Conference on Information Communication Technology, pages 101--110, 2013. Google ScholarDigital Library
- M. de Berg, M. van Kreveld, M. Overmars, and O.Schwarzkopf. Computational Geometry: Algorithms and Applications, Second Edition. Springer-Verlag, Reading, Massachusetts, 2000. Google ScholarDigital Library
- P. Galdames and Y. Cai. Efficient processing of location-cloaked queries. IEEE INFOCOM, 131(5):2480--2488, 2012.Google Scholar
- Y. Gao and B. Zheng. Continuous obstructed nearest neighbor queries in spatial databases. SIGMOD, pages 577--558, 2009. Google ScholarDigital Library
- Y. Gao, B. Zheng, W.-C. Lee, and G. Chen. Continuous visible nearest neighbor queries. EDBT 09, pages 144--155, 2009. Google ScholarDigital Library
- B. Gedik and L. Liu. A customizable k-anonymity model for protecting location privacy. Distributed Computing Systems (ICDCS), pages 763--774, 2005.Google Scholar
- M. Gruteser and D. Grunwald. Anonymous usage of location-based services through spatial and temporal cloaking. ACM MobiSys, pages 763--774, 2003. Google ScholarDigital Library
- H. Hu and D. L. Lee. Range nearest-neighbor query. TKDE, 18(1):78--91, 2006. Google ScholarDigital Library
- C. H. J and J. R. Efficient processing of moving k-range nearest neighbor queries in directed and dynamic spatial networks. Mobile Information Systems, 2016.Google Scholar
- P. Kalnis, G. Ghinita, K. Mouratidis, and D. Papadias. Preventing location based identity inference in anonymous spatial queries. TKDE, 26(3):1719--1733, 2007. Google ScholarDigital Library
- A. Khoshgozaran, C. Shahabi, and H. Shirani-Mehr. Enabling location privacy; moving beyond k-anonymity, cloaking and anonymizers. Knowledge Information Systems, 26(3):435--465, 2011. Google ScholarDigital Library
- H.-I. Kim and J.-W. Chang. k-nearest neighbor query processing algorithms for a query region in road networks. Journal of Computer Science and Technology, 28(4):585--596, 2013.Google ScholarCross Ref
- E. Lee, H. Cho, T. Chung, and K. Ryu. Moving range k nearest neighbor queries with quality guarantee over uncertain moving objects. Information Sciences, 325:324--341, 2015. Google ScholarDigital Library
- X. Lin, J. Xu, and H. Hu. Range-based skyline queries in mobile environments. TKDE, 25(4):835--849, 2013. Google ScholarDigital Library
- M. F. Mokbel, C. Y. Chow, and W. G. Aref. The New Casper: Query processing for location services without compromising privacy. VLDB, pages 763--774, 2006. Google ScholarDigital Library
- K. Mouratidis, M. Yiu, D. Papadias, and N. Mamoulis. Continuous nearest neighbor monitoring in road networks. VLDB, pages 43--54, 2006. Google ScholarDigital Library
- S. Nutanong, E. Tanin, and R. Zhang. Visible nearest neighbor queries. DASFAA, pages 876--883, 2007. Google ScholarDigital Library
- Y. Tao, D. Papadias, and Q. Shen. Continuous nearest neighbor search. VLDB, pages 287--298, 2002. Google ScholarDigital Library
- A. K. Tung, J. Hou, and J. Han. Spatial clustering in the presence of obstacles. ICDE, pages 322--331, 1990.Google Scholar
- X. Wang and H. J. Hamilton. Clustering spatial data in the presence of obstacles. International Journal on Artificial Intelligence Tools, 14(1--2):177--198, 2005.Google ScholarCross Ref
- C. Xia, D. Hsu, and H. Tung. A fast filter for obstructed nearest neighbor queries. BNCOD, pages 203--215, November 2004.Google ScholarCross Ref
- C. Zhang and Y. Huang. Cloaking locations for anonymous location based services: a hybrid approach. Geoinformatica, pages 159--182, 2009. Google ScholarDigital Library
- J. Zhanga, D. Papadias, K. Mouratidis, and M. Zhu. Spatial queries in the presence of obstacles. EDBT, pages 366--384, 2004.Google ScholarCross Ref
- B. Zheng, W.-C. Lee, and D. L. Lee. On searching continuous k nearest neighbors in wireless data broadcast systems. IEEE Transactions on Mobile Computing, 6(7):748--761, 2007. Google ScholarDigital Library
- H. Zhu, J. Wang, B. Wang, and X. Yang. Location privacy preserving obstructed nearest neighbor queries. Journal of Computer Research and Development, 51(1):115--125, 2014.Google Scholar
Index Terms
- Range-based Obstructed Nearest Neighbor Queries
Recommendations
Continuous obstructed nearest neighbor queries in spatial databases
SIGMOD '09: Proceedings of the 2009 ACM SIGMOD International Conference on Management of dataIn this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers the impact of obstacles on the distance between objects, which is ignored ...
Continuous nearest-neighbor search in the presence of obstacles
Despite the ubiquity of physical obstacles (e.g., buildings, hills, and blindages, etc.) in the real world, most of spatial queries ignore the obstacles. In this article, we study a novel form of continuous nearest-neighbor queries in the presence of ...
On efficient obstructed reverse nearest neighbor query processing
GIS '11: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsIn this paper, we study a new form of reverse nearest neighbor (RNN) queries, i.e., obstructed reverse nearest neighbor (ORNN) search. It considers the impact of obstacles on the distance between objects, which is ignored by the existing work on RNN ...
Comments