Abstract
Group nearest group query(GNG for short) is an important variant of NN search. Let \(\mathcal {D}\) be the \(d-\)multi-dimensional object set, \(GQ\langle k, Q\rangle \) be a GNG with Q containing a set of d-multi-dimensional query points. The target of GNG is to select k object points \(O_Q\) from \(\mathcal {D}\) such that the total distance between these query points and their NNs in \(O_Q\) is minimal. In this paper, we study GNG in a very dynamical data environment, i.e., continuous GNG query(CGNG for short) over sliding window, which has many applications. To the best of our knowledge, it is the first time to study the problem of CGNG over sliding window.
In this paper, we propose a novel framework named KMPT(short for K-Means Partition Tree-based framework) for supporting CGNG. The key behind KMPT is to partition query points into a group of k subsets, generate a group of k virtual points based on objects in these subsets, and reduce the CGNG problem to continuous NN search over data stream. In order to efficiently support continuous NN search, we first partition objects in the window into a group of sub-windows based on their arrived order. We then form a group of quad-tree based indexes to maintain objects’ position information in each partition, form an R-tree based index to evaluate which objects have a chance to become query result objects in the near future, and finally achieve to goal of using a small number of objects to support query processing. The comprehensive experiments on both real and synthetic data sets demonstrate the superiority in both efficiency and quality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
de Berg, S., Staals, F.: Dynamic data structures for k-nearest neighbor queries. Comput. Geom. 111, 101976 (2023)
Cui, N., et al.: Towards multi-user, secure, and verifiable \( k \)nn query in cloud database. IEEE Trans. Knowl. Data Eng. (2023)
Deng, K., Sadiq, S., Zhou, X., Xu, H., Fung, G.P.C., Lu, Y.: On group nearest group query processing. IEEE Trans. Knowl. Data Eng. 24(2), 295–308 (2010)
Deng, K., Xu, H., Sadiq, S., Lu, Y., Fung, G.P.C., Shen, H.T.: Processing group nearest group query. In: 2009 IEEE 25th International Conference on Data Engineering, pp. 1144–1147. IEEE (2009)
Krishna, K., Murty, M.N.: Genetic k-means algorithm. IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) 29(3), 433–439 (1999)
Lee, J.M.: Fast k-nearest neighbor searching in static objects. Wirel. Pers. Commun. 93(1), 147–160 (2017)
Li, T., Chen, L., Jensen, C.S., Pedersen, T.B., Gao, Y., Hu, J.: Evolutionary clustering of moving objects. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 2399–2411. IEEE (2022)
Li, T., Gu, Y., Zhou, X., Ma, Q., Yu, G.: An effective and efficient truth discovery framework over data streams. In: Proceedings of the 20th International Conference on Extending Database Technology, pp. 180–191. Springer (2017)
Miao, X., Gao, Y., Chen, G., Zheng, B., Cui, H.: Processing incomplete k nearest neighbor search. IEEE Trans. Fuzzy Syst. 24(6), 1349–1363 (2016)
Nandy, S.C., Das, S., Goswami, P.P.: An efficient k nearest neighbors searching algorithm for a query line. Theor. Comput. Sci. 299(1–3), 273–288 (2003)
Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: Proceedings. 20th International Conference on Data Engineering, pp. 301–312. IEEE (2004)
Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst. (TODS) 30(2), 529–576 (2005)
Xu, H., Lu, Y., Li, Z.: Continuous group nearest group query on moving objects. In: 2010 Second International Workshop on Education Technology and Computer Science, vol. 1, pp. 350–353. IEEE (2010)
Yang, K., Tian, C., Xian, H., Tian, W., Zhang, Y.: Query on the cloud: improved privacy-preserving k-nearest neighbor classification over the outsourced database. In: World Wide Web, pp. 1–28 (2022)
Yiying, J., Liping, Z., Feihu, J., Xiaohong, H.: Groups nearest neighbor query of mixed data in spatial database. J. Front. Comput. Sci. Technol. 16(2), 348 (2022)
Acknowledgements
This paper is partly supported by the National Key Research and Development Program of China (2020YFB1707901), the National Natural Science Foundation of Liao Ning (2022-MS-303, 2022-MS-302, and 2022-BS-218), the National Natural Science Foundation of China (62102271, 62072088, Nos. U22A2025, 62072088, 62232007, 61991404), and Ten Thousand Talent Program (No. ZX20200035).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhu, R., Li, C., Zhang, A., Zong, C., Xia, X. (2024). Continuous Group Nearest Group Search over Streaming Data. In: Song, X., Feng, R., Chen, Y., Li, J., Min, G. (eds) Web and Big Data. APWeb-WAIM 2023. Lecture Notes in Computer Science, vol 14333. Springer, Singapore. https://doi.org/10.1007/978-981-97-2387-4_6
Download citation
DOI: https://doi.org/10.1007/978-981-97-2387-4_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-2386-7
Online ISBN: 978-981-97-2387-4
eBook Packages: Computer ScienceComputer Science (R0)