GMM-KNN: A Method for Processing Continuous k-NN Queries Based on The Gaussian Mixture Model

  • Ziqiang YuEmail author
  • Mincai Lai
  • Lin Wang
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 734)


For a given set of moving objects and a k nearest neighbor query q, the processing of Continuous K Nearest Neighbor (CKNN) query refers to search the k nearest objects for q and continuously monitor its result in real-time when the objects and the queries are constantly moving. Most existing works about processing CKNN queries usually exist some flaws about the index maintenance, updates of results, and the query cost, which makes them hardly can perfectly settle this issue. To address these challenges, we propose GMM-KNN, an incremental search algorithm based on a Gaussian Mixture Model to handle CKNN queries over a tremendous volume of moving objects. In particularly, our approach adopts the grid index to maintain the moving objects in real-time, and introduces a Gaussian Mixture Model to simulate the distribution of moving objects in this grid index. For a given query q, we first employs YPK-CNN algorithm to compute the initial result of q. Once the query point occurs a movement, we no longer recompute its k nearest neighbors with YPK-CNN algorithm, but endeavor to rapidly estimate an appropriate search region that guarantees covering k nearest neighbors of q based on its previous search scope. In this step, the Gaussian Mixture Model plays a significant role in computing the appropriate search space for the moving query because it can help us avoid iteratively enlarging the search region, which can greatly enhance the search efficiency. Finally, we conduct extensive experiments to fully evaluate the performance of our proposal.


Continuous k-NN queries Incremental processing Moving objects 


  1. 1.
    Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Rec. 27(3), 16–21 (1998)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Gedik, B., Wu, K.L., Yu, P.S., Liu, L.: Processing moving queries over moving objects using motion-adaptive indexes. Know. Data Eng. 18(5), 651–668 (2006)CrossRefGoogle Scholar
  3. 3.
    Han, S.-Y., Chen, Y.-H., Tang, G.-Y.: Fault diagnosis and fault-tolerant tracking control for discrete-time systems with faults and delays in actuator and measurement. J. Franklin Instit. (2017)Google Scholar
  4. 4.
    Mohamed, F.: Mokbel and Walid G Aref. SOLE: scalable on-line execution of continuous queries on spatio-temporal data streams. VLDB J. 17(5), 971–995 (2008)CrossRefGoogle Scholar
  5. 5.
    Mokbel, M.F., Xiong, X., Aref, W.G.: SINA: scalable incremental processing of continuous queries in spatio-temporal databases. In: SIGMOD, pp. 623–634 (2004)Google Scholar
  6. 6.
    Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of spatial queries in wireless broadcast environments. IEEE Trans. Mob. Comput. 8(10), 1297–1311 (2009)CrossRefGoogle Scholar
  7. 7.
    Nehme, R.V., Rundensteiner, E.A.: Scuba: Scalable cluster-based algorithm for evaluating continuous spatio-temporal queries on moving objects. In: EDBT, pp. 1001–1019 (2006)Google Scholar
  8. 8.
    Padillo, F., Luna, J.M., Cano, A., Ventura, S.: A data structure to speed-up machine learning algorithms on massive datasets. Springer International Publishing (2016)Google Scholar
  9. 9.
    Raptopoulou, K., Papadopoulos, A.N., Manolopoulos, Y.: Fast nearest-neighbor query processing in moving-object databases. GeoInformatica 7(2), 113–137 (2003)CrossRefGoogle Scholar
  10. 10.
    Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. In: SIGMOD, pp. 154–165 (1998)CrossRefGoogle Scholar
  11. 11.
    Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB, pp. 287–298 (2002)CrossRefGoogle Scholar
  12. 12.
    Šidlauskas, D., Šaltenis, S., Jensen, C.S.: Parallel main-memory indexing for moving-object query and update workloads. In: SIGMOD, pp. 37–48 (2012)Google Scholar
  13. 13.
    Wang, H., Zimmermann, R.: Snapshot location-based query processing on moving objects in road networks. In: SIGSPATIAL GIS, pp. 50:1–50:4 (2008)Google Scholar
  14. 14.
    Wang, L., Yang, B., Chen, Y., Zhang, X., Orchard, J.: Improving neural-network classifiers using nearest neighbor partitioning. IEEE Trans. Neural Netw. Learn. Syst. 28, 2255–2267 (2016)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE, pp. 643–654 (2005)Google Scholar
  16. 16.
    Yang, M., Liu, Y., Yu, Z.: Distributed grid-based k nearest neighbour query processing over moving objects. In: International Conference on Web-Age Information Management, pp. 350–361 (2015)CrossRefGoogle Scholar
  17. 17.
    Yu, C., Ooi, B.C., Tan, K.L., Jagadish, H.V.: Indexing the distance: an efficient method to KNN processing. In: VLDB, pp. 421–430 (2001)Google Scholar
  18. 18.
    Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631–642 (2005)Google Scholar
  19. 19.
    Zheng, B., Jianliang, X., Lee, W.-C., Lee, L.: Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services. VLDB J. 15(1), 21–39 (2006)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.University of JinanJinanChina
  2. 2.Shandong Provincial Key Laboratory of Network Based Intelligent ComputingJinanChina

Personalised recommendations