{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:37Z","timestamp":1740169177913,"version":"3.37.3"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Training Plan for Young Backbone Teachers of Colleges and Universities in Henan","award":["2017GGJS134"],"award-info":[{"award-number":["2017GGJS134"]}]},{"name":"Science and Technology Research Plan Project of Henan Province","award":["202102210357"],"award-info":[{"award-number":["202102210357"]}]},{"name":"Science and Technology Opening Up Cooperation Project of Henan Province","award":["172106000077","152106000048"],"award-info":[{"award-number":["172106000077","152106000048"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602231"],"award-info":[{"award-number":["61602231"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Outstanding Talents of Scientific and Technological Innovation in Henan","award":["184200510011"],"award-info":[{"award-number":["184200510011"]}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2016YFE0104600"],"award-info":[{"award-number":["2016YFE0104600"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3007028","type":"journal-article","created":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T20:27:58Z","timestamp":1593808078000},"page":"121665-121677","source":"Crossref","is-referenced-by-count":4,"title":["Projection Based Large Scale High-Dimensional Data Similarity Join Using MapReduce Framework"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7359-6592","authenticated-orcid":false,"given":"Youzhong","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiling","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanyou","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunjie","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2014.16"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452390"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5339"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14257\/ijdta.2015.8.3.06"},{"key":"ref31","first-page":"86","article-title":"Parallel top-K join on massive high-dimensional vectors","volume":"38","author":"ma","year":"2015","journal-title":"Chin J Comput"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.87"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1001.2013.04377"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33050-6_15"},{"key":"ref35","first-page":"163","article-title":"Parallel top-K spatial join Query processing on massive spatial data","volume":"48","author":"liu","year":"2011","journal-title":"J Comput Res Develop"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTR.2009.5289178"},{"key":"ref60","first-page":"1993","article-title":"Chi-square distribution based similarity join Query algorithm on high-dimensional data","volume":"7","author":"ma","year":"2016","journal-title":"J Comput Appl"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336674"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247602"},{"key":"ref29","first-page":"99","article-title":"MapReduce Based Fast kNN Join","volume":"38","author":"dai","year":"2015","journal-title":"Chin J Comput"},{"key":"ref2","first-page":"1","article-title":"Research advance on similarity join queries","volume":"7","author":"pang","year":"2013","journal-title":"Journal of Frontiers of Computer Science and Technology"},{"key":"ref1","first-page":"137","article-title":"Mapreduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proc 10th USENIX Symp Oper Syst Des Implement (OSDI)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2012.25"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816701"},{"key":"ref21","first-page":"37","article-title":"MR-DSJ: Distance-based self-join for large-scale vector data analysis with mapReduce","author":"seidl","year":"2013","journal-title":"Proc BTW"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3663"},{"key":"ref23","first-page":"3369","article-title":"MapReduce-based similaroty join for incremental data set","volume":"31","author":"xu","year":"2014","journal-title":"Appl Res Comput"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-1536-6_61"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3952"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08010-9_43"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.Congress.2014.25"},{"key":"ref59","first-page":"1779","article-title":"Distributed similarity join over data streams based on Earth mover’s distance","volume":"42","author":"xu","year":"2019","journal-title":"Chin J Comput"},{"key":"ref58","article-title":"Pivot-based approximate K-NN similarity joins for big high-dimensional data","volume":"87","author":"?ech","year":"2020","journal-title":"Inf Syst"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101510"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274949"},{"key":"ref55","first-page":"1798","article-title":"Similarity join on time series under dynamic time warping","volume":"41","author":"zhou","year":"2018","journal-title":"Chin J Comput"},{"key":"ref54","first-page":"3150","article-title":"Method for similarity join on uncertain graph database","volume":"29","author":"miu","year":"2018","journal-title":"J Softw"},{"key":"ref53","first-page":"299","article-title":"Methodof similarityJoinon uncertain graphs using mapReduce","volume":"45","author":"miu","year":"2018","journal-title":"Comput Sci"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_16"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.427-429.2618"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.195"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26075-0_19"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3115\/1557690.1557767"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212353"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.70"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.151"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856330"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/217216"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00078"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.101485"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-015-5900-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2011.01853"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46759-7_14"},{"key":"ref5","first-page":"1","article-title":"Similarity joins on massive data based on mapReduce framework","volume":"42","author":"pang","year":"2015","journal-title":"Comput Sci"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571970"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824049"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807222"},{"key":"ref46","first-page":"13","article-title":"Scalable sequence similarity search and join in main memory on multi-cores","author":"rheinlander","year":"2011","journal-title":"Proc Euro-Par Workshops"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-013-7137-3"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05813-9_22"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816663"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.08.007"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2948388"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816702"},{"key":"ref43","first-page":"188","article-title":"Parallel top-K similarity join algorithm on probabilistic data based on Earth mover’s distance","volume":"24","author":"lei","year":"2013","journal-title":"J Softw"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09133060.pdf?arnumber=9133060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:09:39Z","timestamp":1641949779000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9133060\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3007028","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}