{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T00:17:14Z","timestamp":1720743434211},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T00:00:00Z","timestamp":1711324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T00:00:00Z","timestamp":1711324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s12065-024-00926-7","type":"journal-article","created":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T06:01:40Z","timestamp":1711346500000},"page":"3031-3041","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A nearest neighbor query method for searching objects with time and location informations based on spatiotemporal similarity"],"prefix":"10.1007","volume":"17","author":[{"given":"Shenyi","family":"Qian","sequence":"first","affiliation":[]},{"given":"Ziqiao","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,25]]},"reference":[{"key":"926_CR1","unstructured":"Peng Y (2019) Research on Spatio-temporal Keywords Query Algorithm for Massive Short Texts. Central South University for Nationalities."},{"issue":"5","key":"926_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.3390\/ijgi7050179","volume":"7","author":"A Elashry","year":"2018","unstructured":"Elashry A, Shehab A, Riad AM, Aboul-Fotouh A (2018) 2DPR-Tree: two-dimensional priority R-tree algorithm for spatial partitioning in spatial hadoop. ISPRS Int J Geo Inf 7(5):179\u2013187. https:\/\/doi.org\/10.3390\/ijgi7050179","journal-title":"ISPRS Int J Geo Inf"},{"issue":"1","key":"926_CR3","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.14778\/1920841.1920994","volume":"3","author":"M Sharifzadeh","year":"2010","unstructured":"Sharifzadeh M, Shahabi C (2010) Vo R-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries. Proc VLDB Endowment 3(1):1231\u20131242","journal-title":"Proc VLDB Endowment"},{"key":"926_CR4","unstructured":"Liu QF (2018) Research on the similarity measurement of multi-scale spatial targets. Changsha University of Science and Technology"},{"issue":"1","key":"926_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.16451\/j.cnki.issn1003-6059.201701007","volume":"30","author":"C Li","year":"2017","unstructured":"Li C, Shen DR, Kou Y, Nie TZ, Yu G (2017) Diversity-aware KNN query processing approaches for temporal spatial textual content. Pattern Recognit Artif Intell 30(1):64\u201372. https:\/\/doi.org\/10.16451\/j.cnki.issn1003-6059.201701007","journal-title":"Pattern Recognit Artif Intell"},{"issue":"5","key":"926_CR6","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TPDS.2017.2787747","volume":"29","author":"Z Deng","year":"2017","unstructured":"Deng Z, Wang L, Han W, Ranjan R, Zomaya A (2017) G-ML-Octree: an update-efficient index structure for simulating 3D moving objects across GPUs. IEEE Trans Parallel Distrib Syst 29(5):1075\u20131088. https:\/\/doi.org\/10.1109\/TPDS.2017.2787747","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"42","key":"926_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.19101\/IJACR.2019.940030","volume":"9","author":"X Wang","year":"2019","unstructured":"Wang X, Meng W, Zhang M (2019) A novel information retrieval method based on R-tree index for smart hospital information system. Int J Adv Comput Res (IJACR) 9(42):133\u2013145. https:\/\/doi.org\/10.19101\/IJACR.2019.940030","journal-title":"Int J Adv Comput Res (IJACR)"},{"issue":"7","key":"926_CR8","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.3724\/SP.J.1016.2011.01155","volume":"34","author":"AY Zhou","year":"2011","unstructured":"Zhou AY, Yang B, Jin CQ, Ma Q (2011) Location-Based services: architecture and progress. Chin J Comput 34(7):1155\u20131171","journal-title":"Chin J Comput"},{"key":"926_CR9","doi-asserted-by":"publisher","unstructured":"Zhang D, Chee YM, Mondal A, Tung AK, Kitsuregawa M (2009) Keyword search in spatial databases: Towards searching by document. In: 2009 IEEE 25th International Conference on Data Engineering, Shanghai, China, IEEE, pp 688\u2013699. https:\/\/doi.org\/10.1109\/ICDE.2009.77","DOI":"10.1109\/ICDE.2009.77"},{"issue":"2","key":"926_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1177\/0165551518785561","volume":"45","author":"E Al-Nsour","year":"2019","unstructured":"Al-Nsour E, Sleit A, Alshraideh M (2019) SOLD: A node-Splitting algorithm for R-tree base on objects\u2019 locations distribution. J Inf Sci 45(2):169\u2013195. https:\/\/doi.org\/10.1177\/0165551518785561","journal-title":"J Inf Sci"},{"issue":"9","key":"926_CR11","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1478\/3397230.3397243","volume":"13","author":"L Gong","year":"2020","unstructured":"Gong L, Wang H, Ogihara M, Xu J (2020) IDEC: Index able distance estimating codes for approximate nearest neighbor search. Proc VLDB Endow 13(9):1483\u20131497. https:\/\/doi.org\/10.1478\/3397230.3397243","journal-title":"Proc VLDB Endow"},{"issue":"5","key":"926_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.14778\/3377369.3377374","volume":"13","author":"B Zheng","year":"2020","unstructured":"Zheng B, Xi Z, Weng L, Hung NQV, Liu H, Jensen CS (2020) PM-LSH: A fast and accurate LSH framework for high-dimensional approximate NN search. Proc VLDB Endow 13(5):643\u2013655. https:\/\/doi.org\/10.14778\/3377369.3377374","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"926_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1748-7188-2-3","volume":"2","author":"H Yang","year":"2007","unstructured":"Yang H, Parthasarathy S, Ucar D (2007) A spatio-temporal mining approach towards summarizing and analyzing protein folding trajectories. Algorithms Mol Biol 2(1):1\u201316. https:\/\/doi.org\/10.1186\/1748-7188-2-3","journal-title":"Algorithms Mol Biol"},{"key":"926_CR14","doi-asserted-by":"publisher","unstructured":"Huang Q, Ma G, Feng J, Fang Q, Tung AK (2018) Accurate and Fast Asymmetric Locality-Sensitive Hashing Scheme for Maximum Inner Product Search. In: Proceedings of the 24thACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2018, London, UK, pp 1561\u20131570. https:\/\/doi.org\/10.1145\/3219819.3219971","DOI":"10.1145\/3219819.3219971"},{"key":"926_CR15","doi-asserted-by":"publisher","unstructured":"Silva YN, Aref WG, Ali MH (2010) The similarity join database operator. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), Long Beach, California, USA, IEEE, pp 892\u2013903. https:\/\/doi.org\/10.1109\/ICDE.2010.5447873","DOI":"10.1109\/ICDE.2010.5447873"},{"key":"926_CR16","doi-asserted-by":"publisher","unstructured":"Xiao C, Wang W, Lin X, Shang H (2009) Top-k set similarity joins. In: 2009 IEEE 25th International Conference on Data Engineering, Shanghai, China, IEEE, pp 916\u2013927. https:\/\/doi.org\/10.1109\/ICDE.2009.111","DOI":"10.1109\/ICDE.2009.111"},{"key":"926_CR17","doi-asserted-by":"publisher","unstructured":"Skovsgaard A, Sidlauskas D, Jensen CS (2014) Scalable top-k spatio-temporal term querying. In: 2014 IEEE 30th International Conference on Data Engineering, Chicago, IL, USA, IEEE, pp 148\u2013159. https:\/\/doi.org\/10.1109\/ICDE.2014.6816647","DOI":"10.1109\/ICDE.2014.6816647"},{"key":"926_CR18","doi-asserted-by":"publisher","unstructured":"Chen L, Cong G, Cao X, Tan KL (2015) Temporal spatial-keyword top-k publish\/subscribe. In: 2015 IEEE 31st International Conference on Data Engineering, Seoul, Korea (South), IEEE, pp 255\u2013266. https:\/\/doi.org\/10.1109\/ICDE.2015.7113289","DOI":"10.1109\/ICDE.2015.7113289"},{"key":"926_CR19","volume-title":"Research on key technologies for spatiotemporal database query processing","author":"YJ Gao","year":"2008","unstructured":"Gao YJ (2008) Research on key technologies for spatiotemporal database query processing. Zhejiang University, Hangzhou"},{"key":"926_CR20","doi-asserted-by":"publisher","first-page":"72","DOI":"10.19580\/j.cnki.1007-3000.2017.06.017","volume":"6","author":"TM Wang","year":"2017","unstructured":"Wang TM, Li Y, Liang JP (2017) Design and research of spatio-temporal database for smart city. Beijing Surv Mapp 6:72\u201376. https:\/\/doi.org\/10.19580\/j.cnki.1007-3000.2017.06.017","journal-title":"Beijing Surv Mapp"},{"issue":"3","key":"926_CR21","first-page":"262","volume":"25","author":"S Li","year":"2019","unstructured":"Li S, Zhang LP, Li S, Hao XH (2019) Spatial skyline query method based on Hilbert R-tree in multi-dimensional space. High Technol Lett 25(3):262\u2013270","journal-title":"High Technol Lett"},{"issue":"4","key":"926_CR22","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1109\/TIFS.2018.2868162","volume":"14","author":"G Xu","year":"2019","unstructured":"Xu G, Li H, Dai Y, Yang K, Lin X (2019) Enabling efficient and geometric range query with access control over encrypted spatial data. IEEE Trans Inf Forensics Secur 14(4):870\u2013885. https:\/\/doi.org\/10.1109\/TIFS.2018.2868162","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"926_CR23","doi-asserted-by":"publisher","unstructured":"Theodoridis Y, Vazirgiannis M, Sellis T (1996) Spatio-Temporal Indexing for Large Multimedia Applications. In: Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems, Hiroshima, Japan, IEEE, pp 441\u2013448. https:\/\/doi.org\/10.1109\/MMCS.1996.535011","DOI":"10.1109\/MMCS.1996.535011"},{"key":"926_CR24","unstructured":"Pfoser D, Jensen CS, Theodoridis Y (2000) Novel Approaches in Query Processing for Moving Object Trajectories. In: Proceedings of the 26th International Conference on Very Large Data Bases, pp 395\u2013406"},{"issue":"3","key":"926_CR25","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1080\/1206212X.2018.1514726","volume":"43","author":"A Jiyani","year":"2021","unstructured":"Jiyani A, Mahrishi M, Meena Y, Singh G (2021) NAM: a nearest acquaintance modeling approach for VM allocation using R-Tree. Int J Comput Appl 43(3):218\u2013225. https:\/\/doi.org\/10.1080\/1206212X.2018.1514726","journal-title":"Int J Comput Appl"},{"key":"926_CR26","unstructured":"Tao Y, Papadias D (2001) MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: Proceedings of Very Large Data Bases Conference (VLDB), pp 431\u2013440"},{"key":"926_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105299","volume":"192","author":"M Fort","year":"2019","unstructured":"Fort M, Sellar\u00e8s JA, Valladares N (2019) Nearest and farthest spatial skyline queries under multiplicative weighted Euclidean distances. Knowl-Based Syst 192:105299. https:\/\/doi.org\/10.1016\/j.knosys.2019.105299","journal-title":"Knowl-Based Syst"},{"key":"926_CR28","doi-asserted-by":"publisher","unstructured":"Ma Q, Triantafillou P (2019) DBEst: Revisiting Approximate Query Processing Engines with Machine Learning Models. In: Proceedings of the 2019 International Conference on Management of Data, pp 1553\u20131570. https:\/\/doi.org\/10.1145\/3299869.3324958","DOI":"10.1145\/3299869.3324958"},{"key":"926_CR29","doi-asserted-by":"publisher","unstructured":"\u0160altenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pp 331\u2013342. https:\/\/doi.org\/10.1145\/342009.335427","DOI":"10.1145\/342009.335427"},{"issue":"4","key":"926_CR30","first-page":"741","volume":"25","author":"RH Ke","year":"2023","unstructured":"Ke RH, Wu S, Ke WW (2023) A spatial-temporal model for identifying tidal shared-bicycle stops and bicycle sharing demand prediction based on KNN-Light GBM. J Geo-inf Sci 25(4):741\u2013753","journal-title":"J Geo-inf Sci"},{"issue":"19","key":"926_CR31","first-page":"30","volume":"29","author":"HJ Yang","year":"2023","unstructured":"Yang HJ (2023) A nearest neighbor classification algorithm based on cluster analysis. Comput Knowl Technol 29(19):30\u201334","journal-title":"Comput Knowl Technol"},{"key":"926_CR32","doi-asserted-by":"publisher","unstructured":"Yang W, Li T, Fang G, Wei H (2020) PASE: Postgresql Ultra-High-Dimensional Approximate Nearest Neighbor Search Extension. In: Proceedings of the 2020 Inter-national Conference on Management of Data, pp 2241\u20132253. https:\/\/doi.org\/10.1145\/3318464.3386131","DOI":"10.1145\/3318464.3386131"},{"key":"926_CR33","doi-asserted-by":"publisher","unstructured":"Zhang J, Wang W, Jiang X, Ku WS, Lu H (2019) An MBR-Oriented Approach for Efficient Skyline Query Processing. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), Macao, China, IEEE, pp 806\u2013817. DOI: https:\/\/doi.org\/10.1109\/ICDE.2019.00077","DOI":"10.1109\/ICDE.2019.00077"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00926-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-024-00926-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00926-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T05:32:01Z","timestamp":1720675921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-024-00926-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,25]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["926"],"URL":"https:\/\/doi.org\/10.1007\/s12065-024-00926-7","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,25]]},"assertion":[{"value":"5 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2024","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 they have no financial interests and no Competing Interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}