{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T00:52:59Z","timestamp":1792889579657,"version":"4.5.0"},"reference-count":145,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T00:00:00Z","timestamp":1721001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T00:00:00Z","timestamp":1721001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61925205"],"award-info":[{"award-number":["61925205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62232009"],"award-info":[{"award-number":["62232009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102215"],"award-info":[{"award-number":["62102215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00778-024-00864-x","type":"journal-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T17:01:51Z","timestamp":1721062911000},"page":"1591-1615","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":188,"title":["Survey of vector database management systems"],"prefix":"10.1007","volume":"33","author":[{"given":"James Jie","family":"Pan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianguo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1398-0621","authenticated-orcid":false,"given":"Guoliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,15]]},"reference":[{"key":"864_CR1","unstructured":"http:\/\/weaviate.io"},{"key":"864_CR2","unstructured":"http:\/\/pinecone.io"},{"key":"864_CR3","unstructured":"http:\/\/github.com\/spotify\/annoy"},{"key":"864_CR4","unstructured":"http:\/\/lucene.apache.org"},{"key":"864_CR5","unstructured":"http:\/\/elastic.co"},{"key":"864_CR6","unstructured":"http:\/\/github.com\/facebookresearch\/faiss"},{"key":"864_CR7","unstructured":"http:\/\/github.com\/pgvector"},{"key":"864_CR8","unstructured":"http:\/\/vald.vdaas.org"},{"key":"864_CR9","unstructured":"http:\/\/qdrant.tech"},{"key":"864_CR10","unstructured":"http:\/\/trychroma.com"},{"key":"864_CR11","unstructured":"http:\/\/singlestore.com"},{"key":"864_CR12","unstructured":"http:\/\/euclidesdb.readthedocs.io"},{"key":"864_CR13","unstructured":"http:\/\/github.com\/flann-lib\/flann"},{"key":"864_CR14","unstructured":"http:\/\/github.com\/yahoojapan\/NGT"},{"key":"864_CR15","unstructured":"http:\/\/github.com\/vearch"},{"key":"864_CR16","unstructured":"http:\/\/milvus.io"},{"key":"864_CR17","unstructured":"http:\/\/vespa.ai"},{"key":"864_CR18","unstructured":"http:\/\/nuclia.com"},{"key":"864_CR19","unstructured":"http:\/\/marqo.ai"},{"key":"864_CR20","unstructured":"http:\/\/clickhouse.com"},{"key":"864_CR21","unstructured":"http:\/\/myscale.com"},{"key":"864_CR22","unstructured":"http:\/\/opensearch.org"},{"key":"864_CR23","unstructured":"http:\/\/solr.apache.org"},{"key":"864_CR24","unstructured":"http:\/\/github.com\/microsoft\/SPTAG"},{"key":"864_CR25","doi-asserted-by":"crossref","unstructured":"Abdelkader, A., Arya, S., da\u00a0Fonseca, G.D., Mount, D.M.: Approximate nearest neighbor searching with non-Euclidean and weighted distances. In: SODA, pp. 355\u2013372 (2019)","DOI":"10.1137\/1.9781611975482.23"},{"key":"864_CR26","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional space. In: ICDT (2001)","DOI":"10.1007\/3-540-44503-X_27"},{"issue":"1","key":"864_CR27","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"864_CR28","unstructured":"Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I., Schmidt, L.: Practical and optimal LSH for angular distance. In: NeurIPS, pp. 1225\u20131233 (2015)"},{"key":"864_CR29","unstructured":"Andoni, A., Indyk, P., Razenshteyn, I.: Approximate nearest neighbor search in high dimensions. In: ICM, pp. 3287\u20133318 (2018)"},{"key":"864_CR30","doi-asserted-by":"crossref","unstructured":"Andoni, A., Razenshteyn, I.: Optimal data-dependent hashing for approximate near neighbors. In: STOC, pp. 793\u2013801 (2015)","DOI":"10.1145\/2746539.2746553"},{"key":"864_CR31","doi-asserted-by":"crossref","unstructured":"Andr\u00e9, F., Kermarrec, A.M., Le\u00a0Scouarnec, N.: Accelerated nearest neighbor search with Quick ADC. In: ICMR (2017)","DOI":"10.1145\/3078971.3078992"},{"issue":"5","key":"864_CR32","doi-asserted-by":"crossref","first-page":"1666","DOI":"10.1109\/TPAMI.2019.2952606","volume":"43","author":"F Andr\u00e9","year":"2021","unstructured":"Andr\u00e9, F., Kermarrec, A.M., Le Scouarnec, N.: Quicker ADC: unlocking the hidden potential of product quantization with SIMD. IEEE Trans. Pattern Anal. Mach. Intell. 43(5), 1666\u20131677 (2021)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"864_CR33","doi-asserted-by":"crossref","unstructured":"Asai, A., Min, S., Zhong, Z., Chen, D.: Retrieval-based language models and applications. In: ACL (2023)","DOI":"10.18653\/v1\/2023.acl-tutorials.6"},{"key":"864_CR34","doi-asserted-by":"crossref","first-page":"101374","DOI":"10.1016\/j.is.2019.02.006","volume":"87","author":"M Aum\u00fcller","year":"2020","unstructured":"Aum\u00fcller, M., Bernhardsson, E., Faithfull, A.: ANN-benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. Inform. Syst. 87, 101374 (2020)","journal-title":"Inform. Syst."},{"issue":"6","key":"864_CR35","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.14778\/3583140.3583166","volume":"16","author":"I Azizi","year":"2023","unstructured":"Azizi, I., Echihabi, K., Palpanas, T.: ELPIS: graph-based similarity search for scalable data science. Proc. VLDB Endow. 16(6), 1548\u20131559 (2023)","journal-title":"Proc. VLDB Endow."},{"key":"864_CR36","doi-asserted-by":"crossref","unstructured":"Bang, F.: GPTCache: an open-source semantic cache for LLM applications enabling faster answers and cost savings. In: NLP-OSS, pp. 212\u2013218 (2023)","DOI":"10.18653\/v1\/2023.nlposs-1.24"},{"issue":"9","key":"864_CR37","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"864_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg","year":"2008","unstructured":"Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer-Verlag, Berlin (2008)","edition":"3"},{"key":"864_CR39","doi-asserted-by":"crossref","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: ICDT (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"864_CR40","unstructured":"Chang, W.C., Yu, F.X., Chang, Y.W., Yang, Y., Kumar, S.: Pre-training tasks for embedding-based large-scale retrieval. In: ICLR (2020)"},{"key":"864_CR41","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1038\/s41592-023-01899-8","volume":"21","author":"H Chen","year":"2024","unstructured":"Chen, H., Ryu, J., Vinyard, M.E., Lerer, A., Pinello, L.: SIMBA: single-cell embedding along with features. Nat. Methods 21, 1003\u20131013 (2024)","journal-title":"Nat. Methods"},{"issue":"6","key":"864_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3534963","volume":"55","author":"L Chen","year":"2022","unstructured":"Chen, L., Gao, Y., Song, X., Li, Z., Zhu, Y., Miao, X., Jensen, C.S.: Indexing metric spaces for exact similarity search. ACM Comput. Surv. 55(6), 1\u201339 (2022)","journal-title":"ACM Comput. Surv."},{"key":"864_CR43","unstructured":"Chen, Q., Zhao, B., Wang, H., Li, M., Liu, C., Li, Z., Yang, M., Wang, J., Yang, M., Wang, J.: SPANN: highly-efficient billion-scale approximate nearest neighbor search. In: NeurIPS (2021)"},{"key":"864_CR44","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-Tree: an efficient access method for similarity search in metric spaces. In: Proc. VLDB Endow., pp. 426\u2013435 (1997)"},{"key":"864_CR45","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Freund, Y.: Random projection trees and low dimensional manifolds. In: STOC, pp. 537\u2013546 (2008)","DOI":"10.1145\/1374376.1374452"},{"key":"864_CR46","unstructured":"Dasgupta, S., Sinha, K.: Randomized partition trees for exact nearest neighbor search. In: COLT, pp. 317\u2013337 (2013)"},{"key":"864_CR47","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: SCG, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"issue":"3","key":"864_CR48","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/5505.5508","volume":"17","author":"SB Davidson","year":"1985","unstructured":"Davidson, S.B., Garcia-Molina, H., Skeen, D.: Consistency in a partitioned network: a survey. ACM Comput. Surv. 17(3), 341\u2013370 (1985)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"864_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3158661","volume":"51","author":"A Davoudian","year":"2018","unstructured":"Davoudian, A., Chen, L., Liu, M.: A survey on NoSQL stores. ACM Comput. Surv. 51(2), 1\u201343 (2018)","journal-title":"ACM Comput. Surv."},{"key":"864_CR50","doi-asserted-by":"crossref","unstructured":"Dearholt, D., Gonzales, N., Kurup, G.: Monotonic search networks for computer vision databases. In: ACSSC, pp. 548\u2013553 (1988)","DOI":"10.1109\/ACSSC.1988.754602"},{"key":"864_CR51","doi-asserted-by":"crossref","unstructured":"Dong, W., Charikar, M., Li, K.: Efficient $$k$$-nearest neighbor graph construction for generic similarity measures. In: WWW (2011)","DOI":"10.1145\/1963405.1963487"},{"issue":"12","key":"864_CR52","doi-asserted-by":"crossref","first-page":"3198","DOI":"10.14778\/3476311.3476407","volume":"14","author":"K Echihabi","year":"2021","unstructured":"Echihabi, K., Zoumpatianos, K., Palpanas, T.: New trends in high-D vector similarity search: AI-driven, progressive, and distributed. Proc. VLDB Endow. 14(12), 3198\u20133201 (2021)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"864_CR53","doi-asserted-by":"crossref","first-page":"403","DOI":"10.14778\/3368289.3368303","volume":"13","author":"K Echihabi","year":"2019","unstructured":"Echihabi, K., Zoumpatianos, K., Palpanas, T., Benbrahim, H.: Return of the Lernaean Hydra: experimental evaluation of data series approximate similarity search. Proc. VLDB Endow. 13(3), 403\u2013420 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"864_CR54","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01975867","volume":"15","author":"H Edelsbrunner","year":"1996","unstructured":"Edelsbrunner, H., Shah, N.R.: Incremental topological flipping works for regular triangulations. Algorithmica 15, 223\u2013241 (1996)","journal-title":"Algorithmica"},{"key":"864_CR55","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00009293","volume":"17","author":"D Eppstein","year":"1997","unstructured":"Eppstein, D., Paterson, M.S., Yao, F.F.: On nearest-neighbor graphs. Discrete Comput. Geom. 17, 263\u2013282 (1997)","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"864_CR56","doi-asserted-by":"crossref","first-page":"461","DOI":"10.14778\/3303753.3303754","volume":"12","author":"C Fu","year":"2019","unstructured":"Fu, C., Xiang, C., Wang, C., Cai, D.: Fast approximate nearest neighbor search with the navigating spreading-out graph. Proc. VLDB Endow. 12(5), 461\u2013474 (2019)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"864_CR57","first-page":"1","volume":"2","author":"J Gao","year":"2024","unstructured":"Gao, J., Long, C.: RaBitQ: quantizing high-dimensional vectors with a theoretical error bound for approximate nearest neighbor search. Proc. ACM Manag. Data 2(3), 1\u201327 (2024)","journal-title":"Proc. ACM Manag. Data"},{"key":"864_CR58","doi-asserted-by":"crossref","unstructured":"Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization for approximate nearest neighbor search. In: CVPR, pp. 2946\u20132953 (2013)","DOI":"10.1109\/CVPR.2013.379"},{"issue":"2","key":"864_CR59","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/564585.564601","volume":"33","author":"S Gilbert","year":"2002","unstructured":"Gilbert, S., Lynch, N.: Brewer\u2019s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51\u201359 (2002)","journal-title":"SIGACT News"},{"key":"864_CR60","doi-asserted-by":"crossref","unstructured":"Gollapudi, S., Karia, N., Sivashankar, V., Krishnaswamy, R., Begwani, N., Raz, S., Lin, Y., Zhang, Y., Mahapatro, N., Srinivasan, P., Singh, A., Simhadri, H.V.: Filtered-DiskANN: graph algorithms for approximate nearest neighbor search with filters. In: WWW (2023)","DOI":"10.1145\/3543507.3583552"},{"issue":"12","key":"864_CR61","doi-asserted-by":"crossref","first-page":"3548","DOI":"10.14778\/3554821.3554843","volume":"15","author":"R Guo","year":"2022","unstructured":"Guo, R., Luan, X., Xiang, L., Yan, X., Yi, X., Luo, J., Cheng, Q., Xu, W., Luo, J., Liu, F., Cao, Z., Qiao, Y., Wang, T., Tang, B., Xie, C.: Manu: a cloud native vector database management system. Proc. VLDB Endow. 15(12), 3548\u20133561 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"864_CR62","unstructured":"Guo, R., Sun, P., Lindgren, E., Geng, Q., Simcha, D., Chern, F., Kumar, S.: Accelerating large-scale inference with anisotropic vector quantization. In: ICML (2020)"},{"key":"864_CR63","unstructured":"Hambardzumyan, S., Tuli, A., Ghukasyan, L., Rahman, F., Topchyan, H., Isayan, D., McQuade, M., Harutyunyan, M., Hakobyan, T., Stranic, I., Buniatyan, D.: Deep Lake: a lakehouse for deep learning. In: CIDR (2023)"},{"key":"864_CR64","doi-asserted-by":"crossref","unstructured":"Harwood, B., Drummond, T.: FANNG: fast approximate nearest neighbour graphs. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.616"},{"key":"864_CR65","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"issue":"1","key":"864_CR66","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"864_CR67","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/TBDATA.2019.2921572","volume":"7","author":"J Johnson","year":"2021","unstructured":"Johnson, J., Douze, M., J\u00e9gou, H.: Billion-scale similarity search with GPUs. IEEE Trans. Big Data 7(3), 535\u2013547 (2021)","journal-title":"IEEE Trans. Big Data"},{"key":"864_CR68","volume-title":"Speech and Language Processing","author":"D Jurafsky","year":"2009","unstructured":"Jurafsky, D., Martin, J.H.: Speech and Language Processing, 2nd edn. Prentice-Hall, Hoboken (2009)","edition":"2"},{"key":"864_CR69","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1007\/s10994-018-5711-7","volume":"107","author":"O Keivani","year":"2018","unstructured":"Keivani, O., Sinha, K., Ram, P.: Improved maximum inner product search with better theoretical guarantee using randomized partition trees. Mach. Learn. 107, 1069\u20131094 (2018)","journal-title":"Mach. Learn."},{"key":"864_CR70","doi-asserted-by":"crossref","unstructured":"Kim, Y.: Applications and future of dense retrieval in industry. In: SIGIR, pp. 3373\u20133374 (2022)","DOI":"10.1145\/3477495.3536324"},{"key":"864_CR71","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"JM Kleinberg","year":"2000","unstructured":"Kleinberg, J.M.: Navigation in a small world. Nature 406, 845 (2000)","journal-title":"Nature"},{"issue":"2","key":"864_CR72","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/1773912.1773922","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. SIGOPS Oper. Syst. Rev. 44(2), 35\u201340 (2010)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"864_CR73","first-page":"23","volume":"9","author":"D Lee","year":"1977","unstructured":"Lee, D., Wong, C.: Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees. Acta Inform. 9, 23\u201329 (1977)","journal-title":"Acta Inform."},{"key":"864_CR74","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.: Mining of Massive Datasets, 3rd edn. Cambridge University Press, Cambridge (2014)","edition":"3"},{"issue":"12","key":"864_CR75","doi-asserted-by":"crossref","first-page":"4140","DOI":"10.14778\/3611540.3611639","volume":"16","author":"F Li","year":"2023","unstructured":"Li, F.: Modernization of databases in the cloud era: building databases that run like Legos. Proc. VLDB Endow. 16(12), 4140\u20134151 (2023)","journal-title":"Proc. VLDB Endow."},{"key":"864_CR76","doi-asserted-by":"crossref","unstructured":"Li, H., Ai, Q., Zhan, J., Mao, J., Liu, Y., Liu, Z., Cao, Z.: Constructing tree-based index for efficient and effective dense retrieval. In: SIGIR (2023)","DOI":"10.1145\/3539618.3591651"},{"key":"864_CR77","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, H., Gui, C., Chen, J., Ni, Z., Wang, N., Chen, Y.: The design and implementation of a real time visual search system on JD e-commerce platform. In: Middleware, pp. 9\u201316 (2018)","DOI":"10.1145\/3284028.3284030"},{"issue":"8","key":"864_CR78","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1109\/TKDE.2019.2909204","volume":"32","author":"W Li","year":"2020","unstructured":"Li, W., Zhang, Y., Sun, Y., Wang, W., Li, M., Zhang, W., Lin, X.: Approximate nearest neighbor search on high dimensional data\u2014experiments, analyses, and improvement. IEEE Trans. Knowl. Data Eng. 32(8), 1475\u20131488 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"864_CR79","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MM.2008.31","volume":"28","author":"E Lindholm","year":"2008","unstructured":"Lindholm, E., Nickolls, J., Oberman, S., Montrym, J.: NVIDIA Tesla: a unified graphics and computing architecture. IEEE Micro 28(2), 39\u201355 (2008)","journal-title":"IEEE Micro"},{"issue":"3","key":"864_CR80","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"864_CR81","unstructured":"Liu, T., Moore, A.W., Gray, A., Yang, K.: An investigation of practical approximate nearest neighbor algorithms. In: NeurIPS, pp. 825\u2013832 (2004)"},{"issue":"1","key":"864_CR82","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s00778-019-00555-y","volume":"29","author":"C Luo","year":"2019","unstructured":"Luo, C., Carey, M.J.: LSM-Based storage techniques: a survey. VLDB J. 29(1), 393\u2013418 (2019)","journal-title":"VLDB J."},{"key":"864_CR83","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi- probe LSH: efficient indexing for high-dimensional similarity search. In: Proc. VLDB Endow. pp. 950\u2013961 (2007)"},{"key":"864_CR84","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inform. Syst. 45, 61\u201368 (2014)","journal-title":"Inform. Syst."},{"issue":"4","key":"864_CR85","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"Y Malkov","year":"2020","unstructured":"Malkov, Y., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2020)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"864_CR86","first-page":"2","volume":"6","author":"Y Matsui","year":"2018","unstructured":"Matsui, Y., Uchida, Y., J\u00e9gou, H., Satoh, S.: A survey of product quantization. ITE Trans. Media Technol. Appl. 6(1), 2\u201310 (2018)","journal-title":"ITE Trans. Media Technol. Appl."},{"issue":"2","key":"864_CR87","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1006\/inco.1993.1057","volume":"106","author":"S Meiser","year":"1993","unstructured":"Meiser, S.: Point location in arrangements of hyperplanes. Inform. Comput. 106(2), 286\u2013303 (1993)","journal-title":"Inform. Comput."},{"issue":"13","key":"864_CR88","doi-asserted-by":"crossref","first-page":"3937","DOI":"10.14778\/3565838.3565847","volume":"15","author":"J Meng","year":"2022","unstructured":"Meng, J., Wang, H., Xu, J., Ogihara, M.: ONe index for all kernels (ONIAK): a zero re-indexing LSH solution to ANNS-ALT (After Linear Transformation). Proc. VLDB Endow. 15(13), 3937\u20133949 (2022)","journal-title":"Proc. VLDB Endow."},{"issue":"10","key":"864_CR89","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.3390\/e22101105","volume":"22","author":"EM Mirkes","year":"2020","unstructured":"Mirkes, E.M., Allohibi, J., Gorban, A.: Fractional norms and quasinorms do not help to overcome the curse of dimensionality. Entropy 22(10), 1105 (2020)","journal-title":"Entropy"},{"issue":"1","key":"864_CR90","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/1500000061","volume":"13","author":"B Mitra","year":"2018","unstructured":"Mitra, B., Craswell, N.: An introduction to neural information retrieval. Found. Trends Inf. Retr. 13(1), 1\u2013126 (2018)","journal-title":"Found. Trends Inf. Retr."},{"issue":"4","key":"864_CR91","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3626754","volume":"1","author":"O Moll","year":"2023","unstructured":"Moll, O., Favela, M., Madden, S., Gadepally, V., Cafarella, M.: SeeSaw: interactive ad-hoc search over image databases. Proc. ACM Manag. Data 1(4), 1\u201326 (2023)","journal-title":"Proc. ACM Manag. Data"},{"key":"864_CR92","unstructured":"Muja, M., Lowe., D.G.: FLANN: fast library for approximate nearest neighbors. In: VISAPP (2009)"},{"issue":"1","key":"864_CR93","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. VLDB J. 11(1), 28\u201346 (2002)","journal-title":"VLDB J."},{"key":"864_CR94","doi-asserted-by":"crossref","unstructured":"Norouzi, M., Fleet, D.J.: Cartesian $$k$$-means. In: CVPR (2013)","DOI":"10.1109\/CVPR.2013.388"},{"key":"864_CR95","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P., Cheng, E., Gawlick, D., O\u2019Neil, E.: The log-structured merge-tree (LSM-tree). Acta Inform. 33, 351\u2013385 (1996)","journal-title":"Acta Inform."},{"key":"864_CR96","doi-asserted-by":"crossref","unstructured":"Paredes, R., Ch\u00e1vez, E.: Using the $$k$$-nearest neighbor graph for proximity searching in metric spaces. In: SPIRE, pp. 127\u2013138 (2005)","DOI":"10.1007\/11575832_14"},{"key":"864_CR97","doi-asserted-by":"crossref","unstructured":"Paredes, R., Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Practical construction of $$k$$-nearest neighbor graphs in metric spaces. In: WEA (2006)","DOI":"10.1007\/11764298_8"},{"issue":"5","key":"864_CR98","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3234150","volume":"51","author":"S Pouyanfar","year":"2018","unstructured":"Pouyanfar, S., Sadiq, S., Yan, Y., Tian, H., Tao, Y., Reyes, M.P., Shyu, M.L., Chen, S.C., Iyengar, S.S.: A survey on deep learning: algorithms, techniques, and applications. ACM Comput. Surv. 51(5), 1\u201336 (2018)","journal-title":"ACM Comput. Surv."},{"key":"864_CR99","doi-asserted-by":"crossref","unstructured":"Prout, A., Wang, S.P., Victor, J., Sun, Z., Li, Y., Chen, J., Bergeron, E., Hanson, E., Walzer, R., Gomes, R., Shamgunov, N.: Cloud-native transactions and analytics in SingleStore. In: SIGMOD, pp. 2340\u20132352 (2022)","DOI":"10.1145\/3514221.3526055"},{"issue":"12","key":"864_CR100","doi-asserted-by":"crossref","first-page":"3437","DOI":"10.14778\/3415478.3415564","volume":"13","author":"J Qin","year":"2020","unstructured":"Qin, J., Wang, W., Xiao, C., Zhang, Y.: Similarity query processing for high-dimensional data. Proc. VLDB Endow. 13(12), 3437\u20133440 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"864_CR101","doi-asserted-by":"crossref","unstructured":"Qin, J., Wang, W., Xiao, C., Zhang, Y., Wang, Y.: High-dimensional similarity query processing for data science. In: KDD, pp. 4062\u20134063 (2021)","DOI":"10.1145\/3447548.3470811"},{"key":"864_CR102","doi-asserted-by":"crossref","unstructured":"Ram, P., Sinha, K.: Revisiting $$kd$$-tree for nearest neighbor search. In: KDD, pp. 1378\u20131388 (2019)","DOI":"10.1145\/3292500.3330875"},{"key":"864_CR103","volume-title":"Spatial Databases: With Application to GIS","author":"P Rigaux","year":"2001","unstructured":"Rigaux, P., Scholl, M., Voisard, A.: Spatial Databases: With Application to GIS. Morgan Kaufmann Publishers Inc., Burlington (2001)"},{"key":"864_CR104","doi-asserted-by":"crossref","unstructured":"Rubinstein, A.: Hardness of approximate nearest neighbor search. In: STOC, pp. 1260\u20131268 (2018)","DOI":"10.1145\/3188745.3188916"},{"key":"864_CR105","unstructured":"Salakhutdinov, R.R., Hinton, G.E.: Learning a nonlinear embedding by preserving class neighbourhood structure. In: AISTATS (2007)"},{"key":"864_CR106","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: Multidimensional access methods: trees have grown everywhere. Proc. VLDB Endow., pp. 13\u201314 (1997)"},{"key":"864_CR107","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised KD-trees for fast image descriptor matching. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"864_CR108","doi-asserted-by":"crossref","unstructured":"Sivic, Z.: Video Google: a text retrieval approach to object matching in videos. In: ICCV, pp. 1470\u20131477 (2003)","DOI":"10.1109\/ICCV.2003.1238663"},{"key":"864_CR109","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02239166","volume":"46","author":"TH Su","year":"1991","unstructured":"Su, T.H., Chang, R.C.: On constructing the relative neighborhood graphs in Euclidean $$k$$-dimensional spaces. Computing 46, 121\u2013130 (1991)","journal-title":"Computing"},{"issue":"3","key":"864_CR110","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3654990","volume":"2","author":"Y Su","year":"2024","unstructured":"Su, Y., Sun, Y., Zhang, M., Wang, J.: Vexless: a serverless vector data management system using cloud functions. Proc. ACM Manag. Data 2(3), 1\u201326 (2024)","journal-title":"Proc. ACM Manag. Data"},{"key":"864_CR111","unstructured":"Subramanya, S.J., Devvrit, Kadekodi, R., Krishnaswamy, R., Simhadri, H.: DiskANN: Fast accurate billion-point nearest neighbor search on a single node. In: NeurIPS (2019)"},{"key":"864_CR112","unstructured":"Tagliabue, J., Greco, C.: (Vector) Space is not the final frontier: product search as program synthesis. In: SIGIR (2023)"},{"key":"864_CR113","doi-asserted-by":"crossref","first-page":"101216","DOI":"10.1016\/j.cogsys.2024.101216","volume":"85","author":"T Taipalus","year":"2024","unstructured":"Taipalus, T.: Vector database management systems: fundamental concepts, use-cases, and current challenges. Cognitive Syst. Res. 85, 101216 (2024)","journal-title":"Cognitive Syst. Res."},{"issue":"1","key":"864_CR114","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2996452","volume":"42","author":"C Teflioudi","year":"2016","unstructured":"Teflioudi, C., Gemulla, R.: Exact and approximate maximum inner product search with LEMP. ACM Trans. Database Syst. 42(1), 1\u201349 (2016)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"864_CR115","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognit. 12(4), 261\u2013268 (1980)","journal-title":"Pattern Recognit."},{"key":"864_CR116","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","volume":"4","author":"PM Vaidya","year":"1989","unstructured":"Vaidya, P.M.: An $$O(n\\log n)$$ algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom. 4, 101\u2013115 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"864_CR117","unstructured":"Vempala, S.S.: Randomly-oriented $$k$$-$$d$$ trees adapt to intrinsic dimension. In: LIPIcs (2012)"},{"key":"864_CR118","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1007\/s10618-014-0356-z","volume":"29","author":"F Wang","year":"2015","unstructured":"Wang, F., Sun, J.: Survey on distance metric learning and dimensionality reduction in data mining. Data Min. Knowl. Disc. 29, 534\u2013564 (2015)","journal-title":"Data Min. Knowl. Disc."},{"key":"864_CR119","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, S.: Query-driven iterated neighborhood graph search for large scale indexing. In: MM, pp. 179\u2013188 (2012)","DOI":"10.1145\/2393347.2393378"},{"key":"864_CR120","doi-asserted-by":"crossref","unstructured":"Wang, J., Wang, J., Zeng, G., Tu, Z., Gan, R., Li, S.: Scalable $$k$$-NN graph construction for visual descriptors. In: CVPR, pp. 1106\u20131113 (2012)","DOI":"10.1109\/CVPR.2012.6247790"},{"issue":"2","key":"864_CR121","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/TPAMI.2013.125","volume":"36","author":"J Wang","year":"2014","unstructured":"Wang, J., Wang, N., Jia, Y., Li, J., Zeng, G., Zha, H., Hua, X.S.: Trinary-projection trees for approximate nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 36(2), 388\u2013403 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"864_CR122","doi-asserted-by":"crossref","unstructured":"Wang, J., Yi, X., Guo, R., Jin, H., Xu, P., Li, S., Wang, X., Guo, X., Li, C., Xu, X., Yu, K., Yuan, Y., Zou, Y., Long, J., Cai, Y., Li, Z., Zhang, Z., Mo, Y., Gu, J., Jiang, R., Wei, Y., Xie, C.: Milvus: A purpose-built vector data management system. In: SIGMOD, pp. 2614\u20132627 (2021)","DOI":"10.1145\/3448016.3457550"},{"key":"864_CR123","doi-asserted-by":"crossref","unstructured":"Wang, J., Zhang, Q.: Disaggregated database systems. In: SIGMOD, pp. 37\u201344 (2023)","DOI":"10.1145\/3555041.3589403"},{"issue":"4","key":"864_CR124","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TPAMI.2017.2699960","volume":"40","author":"J Wang","year":"2018","unstructured":"Wang, J., Zhang, T., Song, J., Sebe, N., Shen, H.T.: A survey on learning to hash. IEEE Trans. Pattern Anal. Mach. Intell. 40(4), 769\u2013790 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"864_CR125","first-page":"1","volume":"2","author":"M Wang","year":"2024","unstructured":"Wang, M., Xu, W., Yi, X., Wu, S., Peng, Z., Ke, X., Gao, Y., Xu, X., Guo, R., Xie, C.: Starling: an I\/O-efficient disk-resident graph index framework for high-dimensional vector similarity search on data segment. Proc. ACM Manag. Data 2(1), 1\u201327 (2024)","journal-title":"Proc. ACM Manag. Data"},{"issue":"11","key":"864_CR126","doi-asserted-by":"crossref","first-page":"1964","DOI":"10.14778\/3476249.3476255","volume":"14","author":"M Wang","year":"2021","unstructured":"Wang, M., Xu, X., Yue, Q., Wang, Y.: A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. Proc. VLDB Endow. 14(11), 1964\u20131978 (2021)","journal-title":"Proc. VLDB Endow."},{"issue":"13","key":"864_CR127","doi-asserted-by":"crossref","first-page":"3603","DOI":"10.14778\/3424573.3424580","volume":"13","author":"R Wang","year":"2020","unstructured":"Wang, R., Deng, D.: DeltaPQ: lossless product quantization code compression for high dimensional similarity search. Proc. VLDB Endow. 13(13), 3603\u20133616 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"864_CR128","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"864_CR129","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. Proc. VLDB Endow. pp. 194\u2013205 (1998)"},{"issue":"12","key":"864_CR130","doi-asserted-by":"crossref","first-page":"3152","DOI":"10.14778\/3415478.3415541","volume":"13","author":"C Wei","year":"2020","unstructured":"Wei, C., Wu, B., Wang, S., Lou, R., Zhan, C., Li, F., Cai, Y.: AnalyticDB-V: a hybrid analytical engine towards query fusion for structured and unstructured data. Proc. VLDB Endow. 13(12), 3152\u20133165 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"864_CR131","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NeurIPS, pp. 1753\u20131760 (2008)"},{"key":"864_CR132","doi-asserted-by":"crossref","unstructured":"Williams, R.: On the difference between closest, furthest, and orthogonal pairs: Nearly-linear vs barely-subquadratic complexity. In: SODA, pp. 1207\u20131215 (2018)","DOI":"10.1137\/1.9781611975031.78"},{"key":"864_CR133","doi-asserted-by":"crossref","unstructured":"Wu, W., He, J., Qiao, Y., Fu, G., Liu, L., Yu, J.: HQANN: Efficient and robust similarity search for hybrid queries with structured and unstructured constraints. In: CIKM (2022)","DOI":"10.1145\/3511808.3557610"},{"issue":"4","key":"864_CR134","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/TBDATA.2017.2740954","volume":"4","author":"W Xue","year":"2018","unstructured":"Xue, W., Li, H., Peng, Y., Cui, J., Shi, Y.: Secure $$k$$ nearest neighbors query for high-dimensional vectors in outsourced environments. IEEE Trans. Big Data 4(4), 586\u2013599 (2018)","journal-title":"IEEE Trans. Big Data"},{"key":"864_CR135","doi-asserted-by":"crossref","unstructured":"Yandex, A.B., Lempitsky, V.: Efficient indexing of billion-scale datasets of deep descriptors. In: CVPR, pp. 2055\u20132063 (2016)","DOI":"10.1109\/CVPR.2016.226"},{"key":"864_CR136","doi-asserted-by":"crossref","unstructured":"Yang, W., Li, T., Fang, G., Wei, H.: PASE: PostgreSQL ultra-high-dimensional approximate nearest neighbor search extension. In: SIGMOD, pp. 2241\u20132253 (2020)","DOI":"10.1145\/3318464.3386131"},{"key":"864_CR137","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA, pp. 311\u2013321 (1993)"},{"issue":"12","key":"864_CR138","doi-asserted-by":"crossref","first-page":"2059","DOI":"10.14778\/3352063.3352124","volume":"12","author":"C Zhan","year":"2019","unstructured":"Zhan, C., Su, M., Wei, C., Peng, X., Lin, L., Wang, S., Chen, Z., Li, F., Pan, Y., Zheng, F., Chai, C.: AnalyticDB: real-time OLAP database system at Alibaba Cloud. Proc. VLDB Endow. 12(12), 2059\u20132070 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"864_CR139","doi-asserted-by":"crossref","unstructured":"Zhang, H., Cao, L., Yan, Y., Madden, S., Rundensteiner, E.A.: Continuously adaptive similarity search. In: SIGMOD, pp. 2601\u20132616 (2020)","DOI":"10.1145\/3318464.3380601"},{"key":"864_CR140","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.knosys.2016.01.022","volume":"97","author":"W Zhang","year":"2016","unstructured":"Zhang, W., Ji, J., Zhu, J., Li, J., Xu, H., Zhang, B.: BitHash: an efficient bitwise locality sensitive hashing method with applications. Knowl. Based Syst. 97, 40\u201347 (2016)","journal-title":"Knowl. Based Syst."},{"key":"864_CR141","doi-asserted-by":"crossref","unstructured":"Zhang, X., Wang, Q., Xu, C., Peng, Y., Xu, J.: FedKNN: secure federated k-nearest neighbor search. Proc. ACM Manag. Data 2(1), 1\u201326 (2024)","DOI":"10.1145\/3639266"},{"key":"864_CR142","doi-asserted-by":"crossref","first-page":"1909","DOI":"10.1109\/TMM.2021.3073811","volume":"24","author":"WL Zhao","year":"2022","unstructured":"Zhao, W.L., Wang, H., Ngo, C.W.: Approximate k-NN graph construction: a generic online approach. IEEE Trans. Multimed. 24, 1909\u20131921 (2022)","journal-title":"IEEE Trans. Multimed."},{"issue":"1","key":"864_CR143","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s00778-021-00691-4","volume":"31","author":"Y Zhu","year":"2022","unstructured":"Zhu, Y., Chen, L., Gao, Y., Jensen, C.S.: Pivot selection algorithms in metric spaces: a survey and experimental study. VLDB J. 31(1), 23\u201347 (2022)","journal-title":"VLDB J."},{"issue":"3","key":"864_CR144","first-page":"1","volume":"2","author":"Y Zhu","year":"2024","unstructured":"Zhu, Y., Ma, R., Zheng, B., Ke, X., Chen, L., Gao, Y.: GTS: GPU-based tree index for fast similarity search. Proc. ACM Manag. Data 2(3), 1\u201327 (2024)","journal-title":"Proc. ACM Manag. Data"},{"issue":"1","key":"864_CR145","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3639324","volume":"2","author":"C Zuo","year":"2024","unstructured":"Zuo, C., Qiao, M., Zhou, W., Li, F., Deng, D.: SeRF: segment graph for range-filtering approximate nearest neighbor search. Proc. ACM Manag. Data 2(1), 1\u201326 (2024)","journal-title":"Proc. ACM Manag. Data"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00864-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00864-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00864-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T00:43:37Z","timestamp":1732409017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00864-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,15]]},"references-count":145,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["864"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00864-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,15]]},"assertion":[{"value":"12 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}