Distributed Grid-Based K Nearest Neighbour Query Processing Over Moving Objects

  • Min Yang
  • Yang LiuEmail author
  • Ziqiang Yu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9098)


K-nearest neighbour (k-NN) queries over moving objects is a classic problem with applications to a wide spectrum of location-based services. Abundant algorithms exist for solving this problem in a centralized setting using a single server, but many of them become inapplicable when distributed processing is called for tackling the increasingly large scale of data. To address this challenge, we propose a distributed grid-based solution to k-NN query processing over moving objects. First, we design a new grid-based index called Block Grid Index (BGI), which indexes moving objects using a two-layer structure and can be easily constructed and maintained in a distributed setting. We then propose a distributed k-NN algorithm based on BGI, called DBGKNN. We implement BGI and DBGKNN in the commonly used master-worker mode, and the efficiency of our solution is verified by extensive experiments with millions of nodes.


Query Processing Query Time Baseline Method Query Object Split Operation 
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.
    Chaudhuri, S., Gravano, L.: Evaluating top-k selection queries. In: VLDB, vol. 99, pp. 397–410 (1999)Google Scholar
  2. 2.
    Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems (TODS) 24(2), 265–318 (1999)CrossRefGoogle Scholar
  3. 3.
    Raptopoulou, K., Papadopoulos, A., Manolopoulos, Y.: Fast nearest-neighbor query processing in moving-object databases. GeoInformatica 7(2), 113–137 (2003)CrossRefGoogle Scholar
  4. 4.
    Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: ACM Sigmod Record, vol. 24, pp. 71–79. ACM (1995)Google Scholar
  5. 5.
    Seidl, T., Kriegel, H.-P.: Optimal multi-step k-nearest neighbor search. In: ACM SIGMOD Record, vol. 27, pp. 154–165. ACM (1998)Google Scholar
  6. 6.
    Šidlauskas, D., Šaltenis, S., Jensen, C.S.: Parallel main-memory indexing for moving-object query and update workloads. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 37–48. ACM (2012)Google Scholar
  7. 7.
    Song, Z., Roussopoulos, N.: \(K\)-Nearest neighbor search for moving query point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79–96. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  8. 8.
    Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 287–298. VLDB Endowment (2002)Google Scholar
  9. 9.
    Yu, C., Ooi, B.C., Tan, K.-L., Jagadish, H.: Indexing the distance: an efficient method to knn processing. In: VLDB, vol. 1, pp. 421–430 (2001)Google Scholar
  10. 10.
    Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: Proceedings of 21st International Conference on Data Engineering, ICDE 2005, pp. 631–642. IEEE (2005)Google Scholar
  11. 11.
    Zheng, B., Xu, J., Lee, W.-C., Lee, L.: Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services. The VLDB JournalThe International Journal on Very Large Data Bases 15(1), 21–39 (2006)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyShandong UniversityJinanChina

Personalised recommendations