{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T16:11:27Z","timestamp":1776701487493,"version":"3.51.2"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T00:00:00Z","timestamp":1694390400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T00:00:00Z","timestamp":1694390400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001773","name":"University of New South Wales","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001773","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Given a user dataset\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\varvec{U}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>U<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and an object dataset\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\varvec{I}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>I<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , a kNN join query in high-dimensional space returns the\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\varvec{k}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>k<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    nearest neighbors of each object in dataset\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\varvec{U}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>U<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    from the object dataset\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\varvec{I}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>I<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . The kNN join is a basic and necessary operation in many applications, such as databases, data mining, computer vision, multi-media, machine learning, recommendation systems, and many more. In the real world, datasets frequently update dynamically as objects are added or removed. In this paper, we propose novel methods of continuous kNN join over dynamic high-dimensional data. We firstly propose the HDR\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$^+$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mrow\/>\n                            <mml:mo>+<\/mml:mo>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    Tree, which supports more efficient insertion, deletion, and batch update. Further observed that the existing methods rely on globally correlated datasets for effective dimensionality reduction, we then propose the HDR Forest. It clusters the dataset and constructs multiple HDR Trees to capture local correlations among the data. As a result, our HDR Forest is able to process non-globally correlated datasets efficiently. Two novel optimisations are applied to the proposed HDR Forest, including the precomputation of the PCA states of data items and pruning-based kNN recomputation during item deletion. For the completeness of the work, we also present the proof of computing distances in reduced dimensions of PCA in HDR Tree. Extensive experiments on real-world datasets show that the proposed methods and optimisations outperform the baseline algorithms of naive RkNN join and HDR Tree.\n                  <\/jats:p>","DOI":"10.1007\/s11280-023-01204-9","type":"journal-article","created":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T10:02:26Z","timestamp":1694426546000},"page":"3759-3794","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient continuous kNN join over dynamic high-dimensional data"],"prefix":"10.1007","volume":"26","author":[{"given":"Nimish","family":"Ukey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangjian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binghao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,11]]},"reference":[{"key":"1204_CR1","unstructured":"Dasarathy, B.V.: Nearest neighbor (nn) norms: Nn pattern classification techniques. IEEE Computer Society Tutorial (1991)"},{"issue":"5","key":"1204_CR2","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1109\/TNNLS.2017.2673241","volume":"29","author":"S Zhang","year":"2017","unstructured":"Zhang, S., Li, X., Zong, M., Zhu, X., Wang, R.: Efficient knn classification with different numbers of nearest neighbors. IEEE Trans. Neural Netw. Learn. Sys. 29(5), 1774\u20131785 (2017)","journal-title":"IEEE Trans. Neural Netw. Learn. Sys."},{"key":"1204_CR3","doi-asserted-by":"crossref","unstructured":"Zhou, C., Tham, C.-K.: Graphel: A graph-based ensemble learning method for distributed diagnostics and prognostics in the industrial internet of things. In: 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS), pp. 903\u2013909 IEEE (2018)","DOI":"10.1109\/PADSW.2018.8644943"},{"issue":"1","key":"1204_CR4","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm as 136: A k-means clustering algorithm. J. R. Stat. Soc. Ser C (applied statistics) 28(1), 100\u2013108 (1979)","journal-title":"J. R. Stat. Soc. Ser C (applied statistics)"},{"issue":"7","key":"1204_CR5","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: Analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 881\u2013892 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"1204_CR6","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.-P., Ng, R.T., Sander, J.: Lof: identifying density-based local outliers. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp. 93\u2013104 (2000)","DOI":"10.1145\/342009.335388"},{"issue":"2","key":"1204_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TKDE.2006.29","volume":"18","author":"F Angiulli","year":"2005","unstructured":"Angiulli, F., Basta, S., Pizzuti, C.: Distance-based detection and prediction of outliers. IEEE transactions on knowledge and data engineering 18(2), 145\u2013160 (2005)","journal-title":"IEEE transactions on knowledge and data engineering"},{"issue":"3","key":"1204_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10618-008-0093-2","volume":"16","author":"A Ghoting","year":"2008","unstructured":"Ghoting, A., Parthasarathy, S., Otey, M.E.: Fast mining of distance-based outliers in high-dimensional datasets. Data Min. Knowl. Disc. 16(3), 349\u2013364 (2008)","journal-title":"Data Min. Knowl. Disc."},{"key":"1204_CR9","doi-asserted-by":"crossref","unstructured":"Lu, W., Shen, Y., Chen, S., Ooi, B.C.: Efficient processing of k nearest neighbor joins using mapreduce. (2012) arXiv preprint arXiv:1207.0141","DOI":"10.14778\/2336664.2336674"},{"key":"1204_CR10","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.patrec.2018.06.007","volume":"112","author":"J Ning","year":"2018","unstructured":"Ning, J., Chen, L., Zhou, C., Wen, Y.: Parameter k search strategy in outlier detection. Pattern Recogn. Lett. 112, 56\u201362 (2018)","journal-title":"Pattern Recogn. Lett."},{"key":"1204_CR11","unstructured":"Lin, R.A.K.-l., Shim, H.S.S.K.: Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In: Proceeding of the 21th International Conference on Very Large Data Bases, pp. 490\u2013501. Citeseer (1995)"},{"issue":"3","key":"1204_CR12","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/TKDE.2018.2886189","volume":"32","author":"Y Zhang","year":"2018","unstructured":"Zhang, Y., Wu, J., Wang, J., Xing, C.: A transformation-based framework for knn set similarity search. IEEE Trans. Knowl. Data Eng. 32(3), 409\u2013423 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1204_CR13","doi-asserted-by":"crossref","unstructured":"Amorim, L.A., Freitas, M.F., da Silva, P.H., Martins, W.S.: A fast similarity search knn for textual datasets. In: 2018 Symposium on High Performance Computing Systems (WSCAD), pp. 229\u2013236. IEEE (2018)","DOI":"10.1109\/WSCAD.2018.00043"},{"issue":"1","key":"1204_CR14","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s13755-023-00221-2","volume":"11","author":"D Samariya","year":"2023","unstructured":"Samariya, D., Ma, J., Aryal, S., Zhao, X.: Detection and explanation of anomalies in healthcare data. Health. Inf. Sci. Syst. 11(1), 20 (2023)","journal-title":"Health. Inf. Sci. Syst."},{"key":"1204_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13755-018-0047-z","volume":"6","author":"AS Ashour","year":"2018","unstructured":"Ashour, A.S., Hawas, A.R., Guo, Y.: Comparative study of multiclass classification methods on light microscopic images for hepatic schistosomiasis fibrosis diagnosis. Health. Inf. Sci. Syst. 6, 1\u201312 (2018)","journal-title":"Health. Inf. Sci. Syst."},{"key":"1204_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13755-018-0048-y","volume":"6","author":"V Bajaj","year":"2018","unstructured":"Bajaj, V., Taran, S., Sengur, A.: Emotion classification using flexible analytic wavelet transform for electroencephalogram signals. Health. Inf. Sci. Syst. 6, 1\u20137 (2018)","journal-title":"Health. Inf. Sci. Syst."},{"issue":"2","key":"1204_CR17","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s11280-021-00914-2","volume":"25","author":"C Chen","year":"2022","unstructured":"Chen, C., Zhu, Q., Wu, Y., Sun, R., Wang, X., Liu, X.: Efficient critical relationships identification in bipartite networks. World. Wide. Web. 25(2), 741\u2013761 (2022)","journal-title":"World. Wide. Web."},{"issue":"1","key":"1204_CR18","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s13755-023-00234-x","volume":"11","author":"AH Rabie","year":"2023","unstructured":"Rabie, A.H., Saleh, A.I.: A new diagnostic autism spectrum disorder (DASD) strategy using ensemble diagnosis methodology based on blood tests. Health. Inf. Sci. Syst. 11(1), 36 (2023)","journal-title":"Health. Inf. Sci. Syst."},{"key":"1204_CR19","unstructured":"Tweets, M.: Twitter official blog [web-page]. 22 feb. Electronic resource https:\/\/blog.twitter.com\/official\/en_us\/a\/2010\/measuring-tweets.html (2010)"},{"issue":"6","key":"1204_CR20","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm, C., Krebs, F.: The k-nearest neighbour join: Turbo charging the kdd process. Knowl. Inf. Syst. 6(6), 728\u2013749 (2004)","journal-title":"Knowl. Inf. Syst."},{"key":"1204_CR21","doi-asserted-by":"crossref","unstructured":"Xia, C., Lu, H., Ooi, B.C., Hu, J.: Gorder: an efficient method for knn join processing. In: Proceedings of the Thirtieth International Conference on Very Large Data bases-Volume 30, pp. 756\u2013767. (2004)","DOI":"10.1016\/B978-012088469-8\/50067-X"},{"issue":"4","key":"1204_CR22","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.infsof.2006.05.006","volume":"49","author":"C Yu","year":"2007","unstructured":"Yu, C., Cui, B., Wang, S., Su, J.: Efficient index-based knn join processing for high-dimensional data. Inf. Softw. Technol. 49(4), 332\u2013344 (2007)","journal-title":"Inf. Softw. Technol."},{"key":"1204_CR23","unstructured":"Wang, J., Lin, L., Huang, T., Wang, J., He, Z.: Efficient k-nearest neighbor join algorithms for high dimensional sparse data. (2010) arXiv preprint arXiv:1011.2807"},{"key":"1204_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, C., Li, F., Jestes, J.: Efficient parallel knn joins for large data in mapreduce. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 38\u201349 (2012)","DOI":"10.1145\/2247596.2247602"},{"issue":"1","key":"1204_CR25","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10707-009-0076-5","volume":"14","author":"C Yu","year":"2010","unstructured":"Yu, C., Zhang, R., Huang, Y., Xiong, H.: High-dimensional knn joins with incremental updates. Geoinformatica 14(1), 55\u201382 (2010)","journal-title":"Geoinformatica"},{"key":"1204_CR26","doi-asserted-by":"crossref","unstructured":"Yang, C., Yu, X., Liu, Y.: Continuous knn join processing for real-time recommendation. In: 2014 IEEE International Conference on Data Mining, pp. 640\u2013649. IEEE (2014)","DOI":"10.1109\/ICDM.2014.20"},{"key":"1204_CR27","doi-asserted-by":"crossref","unstructured":"Ukey, N., Yang, Z., Zhang, G., Liu, B., Li, B., Zhang, W.: Efficient knn join over dynamic high-dimensional data. In: Australasian Database Conference, pp. 63\u201375. Springer (2022)","DOI":"10.1007\/978-3-031-15512-3_5"},{"key":"1204_CR28","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., El\u00a0Abbadi, A.: Vector approximation based indexing for non-uniform high dimensional data sets. In: Proceedings of the Ninth International Conference on Information and Knowledge Management, pp. 202\u2013209 (2000)","DOI":"10.1145\/354756.354820"},{"issue":"3","key":"1204_CR29","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/TKDE.2005.46","volume":"17","author":"B Cui","year":"2005","unstructured":"Cui, B., Coi, B.C., Su, J., Tan, K.-L.: Indexing high-dimensional data for efficient in-memory similarity search. IEEE Trans. Knowl. Data Eng. 17(3), 339\u2013353 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1204_CR30","unstructured":"Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: A new approach to indexing high dimensional spaces. Technical Report, TR-MARS-00-04, University of California at Irvin (2000). http:\/\/www-db.ics.uci.edu\/pages\/publications\/"},{"issue":"5","key":"1204_CR31","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00778-012-0265-y","volume":"21","author":"MA Cheema","year":"2012","unstructured":"Cheema, M.A., Zhang, W., Lin, X., Zhang, Y.: Efficiently processing snapshot and continuous reverse k nearest neighbors queries. The VLDB Journal 21(5), 703\u2013728 (2012)","journal-title":"The VLDB Journal"},{"key":"1204_CR32","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegal, H.-P.: The pyramid-technique: Towards breaking the curse of dimensionality. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 142\u2013153 (1998)","DOI":"10.1145\/276304.276318"},{"key":"1204_CR33","unstructured":"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\u2013430. (2001)"},{"issue":"2","key":"1204_CR34","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.-L., Yu, C., Zhang, R.: idistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. (TODS) 30(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"1204_CR35","doi-asserted-by":"crossref","unstructured":"Cui, B., Ooi, B.C., Su, J., Tan, K.-L.: Contorting high dimensional data for efficient main memory knn processing. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 479\u2013490 (2003)","DOI":"10.1145\/872757.872815"},{"key":"1204_CR36","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, vol. 98, pp. 194\u2013205. (1998)"},{"key":"1204_CR37","doi-asserted-by":"crossref","unstructured":"Ooi, B.C., Tan, K.-L., Yu, C., Bressan, S.: Indexing the edges-a simple and yet efficient approach to high-dimensional indexing. In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 166\u2013174. (2000)","DOI":"10.1145\/335168.335219"},{"key":"1204_CR38","doi-asserted-by":"crossref","unstructured":"Pillai, K.G., Sturlaugson, L., Banda, J.M., Angryk, R.A.: Extending high-dimensional indexing techniques pyramid and iminmax ($$\\theta $$): Lessons learned. In: Big Data: 29th British National Conference on Databases, BNCOD 2013, Oxford, UK, July 8-10, 2013. Proceedings 29, pp. 253\u2013267. Springer (2013)","DOI":"10.1007\/978-3-642-39467-6_23"},{"key":"1204_CR39","unstructured":"Gionis, A., Indyk, P., Motwani, R., et\u00a0al.: Similarity search in high dimensions via hashing. In: Vldb, vol. 99, pp. 518\u2013529 (1999)"},{"issue":"6","key":"1204_CR40","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1007\/s00779-019-01282-5","volume":"25","author":"Y Hu","year":"2021","unstructured":"Hu, Y., Yang, C., Zhan, P., Zhao, J., Li, Y., Li, X.: Efficient continuous knn join processing for real-time recommendation. Pers. Ubiquit. Comput. 25(6), 1001\u20131011 (2021)","journal-title":"Pers. Ubiquit. Comput."},{"key":"1204_CR41","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Krebs, F.: Supporting kdd applications by the k-nearest neighbor join. In: International Conference on Database and Expert Systems Applications, pp. 504\u2013516. Springer (2003)","DOI":"10.1007\/978-3-540-45227-0_50"},{"key":"1204_CR42","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"issue":"2","key":"1204_CR43","doi-asserted-by":"publisher","first-page":"629","DOI":"10.3390\/s23020629","volume":"23","author":"N Ukey","year":"2023","unstructured":"Ukey, N., Yang, Z., Li, B., Zhang, G., Hu, Y., Zhang, W.: Survey on exact knn queries over high-dimensional data space. Sensors 23(2), 629 (2023)","journal-title":"Sensors"},{"key":"1204_CR44","doi-asserted-by":"crossref","unstructured":"Jiaqi, J., Chung, Y.: Research on k nearest neighbor join for big data. In: 2017 IEEE International Conference on Information and Automation (ICIA), pp. 1077\u20131081. IEEE (2017)","DOI":"10.1109\/ICInfA.2017.8079062"},{"key":"1204_CR45","doi-asserted-by":"crossref","unstructured":"Souza, V., Carvalho, L.O., de Oliveira, D., Bedo, M., Santos, L.F.: Adding result diversification to k nn-based joins in a map-reduce framework. In: International Conference on Database and Expert Systems Applications, pp. 68\u201383. Springer (2023)","DOI":"10.1007\/978-3-031-39847-6_5"},{"key":"1204_CR46","doi-asserted-by":"crossref","unstructured":"Nalepa, F., Batko, M., Zezula, P.: Speeding up continuous knn join by binary sketches. In: Advances in Data Mining. Applications and Theoretical Aspects: 18th Industrial Conference, ICDM 2018, New York, NY, USA, July 11-12, 2018, Proceedings 18, pp. 183\u2013198. Springer (2018)","DOI":"10.1007\/978-3-319-95786-9_14"},{"key":"1204_CR47","doi-asserted-by":"crossref","unstructured":"Shahvarani, A., Jacobsen, H.-A.: Distributed stream knn join. In: Proceedings of the 2021 International Conference on Management of Data, pp. 1597\u20131609 (2021)","DOI":"10.1145\/3448016.3457269"},{"key":"1204_CR48","doi-asserted-by":"crossref","unstructured":"Lee, H., Chang, J.-W., Chae, C.: knn-join query processing algorithm on mapreduce for large amounts of data. In: 2021 International Symposium on Electrical, Electronics and Information Engineering, pp. 538\u2013544 (2021)","DOI":"10.1145\/3459104.3459192"},{"key":"1204_CR49","doi-asserted-by":"crossref","unstructured":"Allheeib, N., Adhinugraha, K., Taniar, D., Islam, Md. Saiful.: Computing reverse nearest neighbourhood on road maps. World. Wide. Web. 1\u201332 (2022)","DOI":"10.1007\/s11280-021-00969-1"},{"key":"1204_CR50","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Vldb, vol. 97, pp. 426\u2013435 (1997)"},{"key":"1204_CR51","unstructured":"Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: A new approach to indexing high dimensional spaces. In: VLDB Conference (2000)"},{"key":"1204_CR52","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Database-friendly random projections. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 274\u2013281 (2001)","DOI":"10.1145\/375551.375608"},{"key":"1204_CR53","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C Faloutsos","year":"1994","unstructured":"Faloutsos, C., Barber, R., Flickner, M., Hafner, J., Niblack, W., Petkovic, D., Equitz, W.: Efficient and effective querying by image content. Journal of intelligent information systems 3, 231\u2013262 (1994)","journal-title":"Journal of intelligent information systems"},{"issue":"3","key":"1204_CR54","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1002\/nla.1839","volume":"20","author":"SJ Leon","year":"2013","unstructured":"Leon, S.J., Bj\u00f6rck, \u00c5., Gander, W.: Gram-schmidt orthogonalization: 100 years and more. Numer. Linear Algebra Appl. 20(3), 492\u2013532 (2013)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1204_CR55","doi-asserted-by":"crossref","unstructured":"Chua, T.-S., Tang, J., Hong, R., Li, H., Luo, Z., Zheng, Y.: Nus-wide: a real-world Web image database from national university of singapore. In: Proceedings of the ACM International Conference on Image and Video Retrieval, pp. 1\u20139. (2009)","DOI":"10.1145\/1646396.1646452"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-023-01204-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-023-01204-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-023-01204-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T17:56:39Z","timestamp":1730051799000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-023-01204-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,11]]},"references-count":55,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1204"],"URL":"https:\/\/doi.org\/10.1007\/s11280-023-01204-9","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2572561\/v1","asserted-by":"object"},{"id-type":"doi","id":"10.21203\/rs.3.rs-2572561\/v3","asserted-by":"object"},{"id-type":"doi","id":"10.21203\/rs.3.rs-2572561\/v2","asserted-by":"object"},{"id-type":"doi","id":"10.21203\/rs.3.rs-2572561\/v4","asserted-by":"object"}]},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,11]]},"assertion":[{"value":"27 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}