SR-KNN: An Real-time Approach of Processing k-NN Queries over Moving Objects

  • Ziqiang Yu
  • Yuehui Chen
  • Kun MaEmail author
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 1)


Central to many location-based service applications is the task of processing k-nearest neighbor (k-NN) queries over moving objects. Many existing approaches adapt different index structures and design various search algorithms to deal with this problem. In these works, tree-based indexes and grid index are mainly utilized to maintain a large volume of moving objects and improve the performance of search algorithms. In fact, tree-based indexes and grid index have their own flaws for supporting processing k-NN queries over an ocean of moving objects. A treebased index (such as R-tree) needs to constantly maintain the relationship between nodes with objects continuously moving, which usually causes a high maintenance cost. Grid index is although widely used to support k-NN queries over moving objects, but the approaches based on grid index almost require an uncertain number of iterative calculations, which makes the performance of these approaches be not predictable. To address this problem, we present a dynamic Strip-Rectangle Index (SRI), which can reach a good balance of the maintenance cost and the performance of supporting k-NN queries over moving objects. SRI supplies two different index granularities that makes it better adapt to handle different data distributions than existing index structures. Based on SRI, we propose a search algorithm called SR-KNN that can rapidly calculate a final region space with a filter-and-refine strategy to enhance the efficiency of process k-NN queries, rather than iteratively enlarging the search space like the approaches based on grid index. Finally, we conduct experiments to fully evaluate the performance of our proposal.


Index Structure Search Region Spatial Query Neighbor Query Grid Index 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. L. Cheung and A. W.-C. Fu, “Enhanced nearest neighbour search on the r-tree,” ACM SIGMOD Record, vol. 27, no. 3, pp. 16–21, 1998.Google Scholar
  2. 2.
    A. Guttman, “R-trees: a dynamic index structure for spatial searching,” in SIGMOD, 1984, pp. 47–57.Google Scholar
  3. 3.
    X. Yu, K. Pu, and N. Koudas, “Monitoring k-nearest neighbor queries over moving objects,” in ICDE, 2005, pp. 631–642.Google Scholar
  4. 4.
    K. Mouratidis, D. Papadias, and M. Hadjieleftheriou, “Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring,” in SIGMOD, 2005, pp. 634–645.Google Scholar
  5. 5.
    M. Cheema, “CircularTrip and arctrip: Effective grid access methods for continuous spatial queries,” in DASFAA, 2007, pp. 863–869.Google Scholar
  6. 6.
    Y. Tao, D. Papadias, and Q. Shen, “Continuous nearest neighbor search,” in VLDB, 2002, pp. 287–298.Google Scholar
  7. 7.
    K. Mouratidis and D. Papadias, “Continuous nearest neighbor queries over sliding windows,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 6, pp. 789–803, 2007.Google Scholar
  8. 8.
    M. S. H. A.-K. Sultan Alamri, David Taniar, “Tracking moving objects using topographical indexing,” Concurrency and Computation: Practice and Experience, 27(8): 1951-1965, 2015.Google Scholar
  9. 9.
    K. Raptopoulou, A. Papadopoulos, and Y. Manolopoulos, “Fast nearest-neighbor query processing in moving-object databases,” GeoInformatica, vol. 7, no. 2, pp. 113–137, 2003.Google Scholar
  10. 10.
    T. Seidl and H. Kriegel, “Optimal multi-step k-nearest neighbor search,” in SIGMOD, 1998, pp. 154–165.Google Scholar
  11. 11.
    S. Chaudhuri and L. Gravano, “Evaluating top-k selection queries,” in VLDB, 1999, pp. 399–410.Google Scholar
  12. 12.
    B. Gedik, K. Wu, P. Yu, and L. Liu, “Processing moving queries over moving objects using motion-adaptive indexes,” Knowledge and Data Engineering, vol. 18, no. 5, pp. 651–668, 2006.Google Scholar
  13. 13.
    C. Yu, B. Ooi, K. Tan, and H. Jagadish, “Indexing the distance: An efficient method to knn processing,” in VLDB, 2001, pp. 421–430.Google Scholar
  14. 14.
    B. Zheng, J. Xu, W.-C. Lee, and L. Lee, “Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services,” The VLDB Journal, vol. 15, no. 1, pp. 21–39, 2006.Google Scholar
  15. 15.
    K. Mouratidis, S. Bakiras, and D. Papadias, “Continuous monitoring of spatial queries in wireless broadcast environments,” IEEE Transactions on Mobile Computing, vol. 8, no. 10, pp. 1297–1311, 2009.Google Scholar
  16. 16.
    M. F. Mokbel, X. Xiong, and W. G. Aref, “SINA: scalable incremental processing of continuous queries in spatio-temporal databases,” in SIGMOD, 2004, pp. 623–634.Google Scholar
  17. 17.
    X. Xiong, M. F. Mokbel, and W. G. Aref, “SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases,” in ICDE, 2005, pp. 643–654.Google Scholar
  18. 18.
    D. Šidlauskas, S. Šaltenis, and C. S. Jensen, “Parallel main-memory indexing for moving-object query and update workloads,” in SIGMOD, 2012, pp. 37–48.Google Scholar
  19. 19.
    H. Wang and R. Zimmermann, “Snapshot location-based query processing on moving objects in road networks,” in SIGSPATIAL GIS, 2008, pp. 50:1–50:4.Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.The university of Ji’nanJinanChina

Personalised recommendations