Abstract
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.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Rec. 27(3), 16–21 (1998)
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)
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)
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)
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)
Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of spatial queries in wireless broadcast environments. IEEE Trans. Mob. Comput. 8(10), 1297–1311 (2009)
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)
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)
Raptopoulou, K., Papadopoulos, A.N., Manolopoulos, Y.: Fast nearest-neighbor query processing in moving-object databases. GeoInformatica 7(2), 113–137 (2003)
Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. In: SIGMOD, pp. 154–165 (1998)
Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: VLDB, pp. 287–298 (2002)
Šidlauskas, D., Šaltenis, S., Jensen, C.S.: Parallel main-memory indexing for moving-object query and update workloads. In: SIGMOD, pp. 37–48 (2012)
Wang, H., Zimmermann, R.: Snapshot location-based query processing on moving objects in road networks. In: SIGSPATIAL GIS, pp. 50:1–50:4 (2008)
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)
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)
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)
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)
Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631–642 (2005)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Yu, Z., Lai, M., Wang, L. (2018). GMM-KNN: A Method for Processing Continuous k-NN Queries Based on The Gaussian Mixture Model. In: Abraham, A., Muhuri, P., Muda, A., Gandhi, N. (eds) Hybrid Intelligent Systems. HIS 2017. Advances in Intelligent Systems and Computing, vol 734. Springer, Cham. https://doi.org/10.1007/978-3-319-76351-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-76351-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76350-7
Online ISBN: 978-3-319-76351-4
eBook Packages: EngineeringEngineering (R0)