{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:10Z","timestamp":1740169150852,"version":"3.37.3"},"reference-count":53,"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":[{"DOI":"10.13039\/501100003725","name":"Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Korean Government","doi-asserted-by":"publisher","award":["2019R1F1A1059795","2019R1F1A1058548"],"award-info":[{"award-number":["2019R1F1A1059795","2019R1F1A1058548"]}],"id":[{"id":"10.13039\/501100003725","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.2996945","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T22:35:56Z","timestamp":1590446156000},"page":"98193-98204","source":"Crossref","is-referenced-by-count":0,"title":["Optimized Signature Selection for Efficient String Similarity Search"],"prefix":"10.1109","volume":"8","author":[{"given":"Taegyoung","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5992-1136","authenticated-orcid":false,"given":"Tae-Sun","family":"Chung","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5857-6091","authenticated-orcid":false,"given":"Jongik","family":"Kim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113311"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135834"},{"key":"ref32","first-page":"21","article-title":"Speeding up graph edit distance computation with a bipartite heuristic","author":"riesen","year":"2007","journal-title":"Proc MLG"},{"key":"ref31","first-page":"88","article-title":"Efficient set similarity joins using min-prefix","author":"ribeiro","year":"2009","journal-title":"Proc ADBIS"},{"key":"ref30","first-page":"351","article-title":"Set containment joins: The good, the bad and the ugly","author":"ramasamy","year":"2000","journal-title":"Proc VLDB"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807264"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/359038.359041"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989431"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"ref1","first-page":"918","article-title":"Efficient exact set-similarity joins","author":"arasu","year":"2006","journal-title":"Proc VLDB"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2487259.2487261"},{"key":"ref21","first-page":"303","article-title":"VGRAM: Improving performance of approximate queries on string collections using variable-length grams","author":"li","year":"2007","journal-title":"Proc VLDB"},{"key":"ref24","first-page":"522","article-title":"A wikipedia- based multilingual retrieval model","author":"martin","year":"2008","journal-title":"Proc ECIR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"ref26","first-page":"1","article-title":"Boosting simrank with semantics","author":"milo","year":"2019","journal-title":"Proc EDBT"},{"key":"ref25","first-page":"308","article-title":"Term representation with generalized latent semantic analysis","author":"matveeva","year":"2005","journal-title":"Proc RANLP"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.04.022"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920988"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213896"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646025"},{"key":"ref10","first-page":"491","article-title":"Approximate string joins in a database (almost) for free","author":"gravano","year":"2001","journal-title":"Proc VLDB"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/356827.356830"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767865"},{"key":"ref12","first-page":"547","article-title":"Étude comparative de la distribution florale dans une portion des alpes et des jura","volume":"37","author":"jaccard","year":"1901","journal-title":"Bull Soc Vaudoise Sci Nat"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2014.07.005"},{"key":"ref15","first-page":"229","article-title":"Inves: Incremental partitioning-based verification for graph similarity search","author":"kim","year":"2019","journal-title":"Proc EDBT"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.79"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-42"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498238"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.104.2.211"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767856"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.32"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1319999"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0536-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/1932409"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376655"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0449-y"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.036"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00042"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213847"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.111"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09099253.pdf?arnumber=9099253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:52:15Z","timestamp":1639770735000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9099253\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2996945","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}