{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:59Z","timestamp":1740109319812,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T00:00:00Z","timestamp":1631145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T00:00:00Z","timestamp":1631145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JST AIP-PRISM","award":["JPMJCR18Y5"],"award-info":[{"award-number":["JPMJCR18Y5"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10115-021-01611-2","type":"journal-article","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T04:02:31Z","timestamp":1631160151000},"page":"2815-2840","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DyFT: a dynamic similarity search method on integer sketches"],"prefix":"10.1007","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5462-122X","authenticated-orcid":false,"given":"Shunsuke","family":"Kanda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuo","family":"Tabei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"1611_CR1","doi-asserted-by":"crossref","unstructured":"Arslan AN, E\u01e7ecio\u01e7lu \u00d6 (2002) Dictionary look-up within small edit distance. In: Proceedings of the 8th international computing and combinatorics conference (COCOON). pp 127\u2013136","DOI":"10.1007\/3-540-45655-4_15"},{"issue":"5","key":"1611_CR2","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s00778-010-0183-9","volume":"19","author":"N Askitis","year":"2010","unstructured":"Askitis N, Sinha R (2010) Engineering scalable, cache and space efficient tries for strings. VLDB J 19(5):633\u2013660","journal-title":"VLDB J"},{"issue":"3","key":"1611_CR3","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s11042-009-0339-z","volume":"47","author":"M Batko","year":"2010","unstructured":"Batko M, Falchi F, Lucchese C, Novak D, Perego R, Rabitti F, Sedmidubsky J, Zezula P (2010) Building a web-scale image similarity search system. Multimedia Tools Appl 47(3):599\u2013629","journal-title":"Multimedia Tools Appl"},{"key":"1611_CR4","doi-asserted-by":"crossref","unstructured":"Belazzougui D, Venturini R (2012) Compressed string dictionary look-up with edit distance one. In: Proceedings of the 23rd annual symposium on combinatorial pattern matching (CPM). pp 280\u2013292","DOI":"10.1007\/978-3-642-31265-6_23"},{"key":"1611_CR5","doi-asserted-by":"crossref","unstructured":"Binna R, Zangerle E, Pichl M, Specht G, Leis V (2018) HOT: a height optimized trie index for main-memory database systems. In: Proceedings of the 2018 ACM SIGMOD international conference on management of data. pp 521\u2013534","DOI":"10.1145\/3183713.3196896"},{"key":"1611_CR6","unstructured":"Boehm M, Schlegel B, Volk PB, Fischer U, Habich D, Lehner W (2011) Efficient in-memory indexing with generalized prefix trees. In: Proceedings of the 14th BTW conference on database systems for business, technology, and web. pp 227\u2013246"},{"key":"1611_CR7","first-page":"1","volume":"16","author":"L Boytsov","year":"2011","unstructured":"Boytsov L (2011) Indexing methods for approximate dictionary searching: comparative analysis. J Exp Algorithm (JEA) 16:1","journal-title":"J Exp Algorithm (JEA)"},{"key":"1611_CR8","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1109\/ACCESS.2017.2781360","volume":"6","author":"Y Cao","year":"2018","unstructured":"Cao Y, Qi H, Zhou W, Kato J, Li K, Liu X, Gui J (2018) Binary hashing for approximate nearest neighbor search on big data: a survey. IEEE Access 6:2039\u20132054","journal-title":"IEEE Access"},{"issue":"2","key":"1611_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00453-008-9263-2","volume":"58","author":"H-L Chan","year":"2010","unstructured":"Chan H-L, Lam T-W, Sung W-K, Tam S-L, Wong S-S (2010) Compressed indexes for approximate string matching. Algorithmica 58(2):263\u2013281","journal-title":"Algorithmica"},{"key":"1611_CR10","doi-asserted-by":"crossref","unstructured":"Charikar MS (2002) Similarity estimation techniques from rounding algorithms. In: Proceedings of the 34th annual ACM symposium on theory of computing (STOC). pp 380\u2013388","DOI":"10.1145\/509907.509965"},{"key":"1611_CR11","doi-asserted-by":"crossref","unstructured":"Chuang J-C, Cho C-W, Chen ALP (2006) Similarity search in transaction databases with a two-level bounding mechanism. In: Proceedings of the international conference on database systems for advanced applications (DASFAA). pp 572\u2013586","DOI":"10.1007\/11733836_40"},{"key":"1611_CR12","doi-asserted-by":"crossref","unstructured":"Cole R, Gottlieb L-A, Lewenstein M (2004) Dictionary matching and indexing with errors and don\u2019t cares. In: Proceedings of the 36th annual ACM symposium on theory of computing (STOC). pp 91\u2013100","DOI":"10.1145\/1007352.1007374"},{"key":"1611_CR13","unstructured":"Driemel A, Silvestri F (2017) Locality-sensitive hashing of curves. In: Proceedings of the 33rd international symposium on computational geometry (SoCG)"},{"issue":"7","key":"1611_CR14","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1109\/TPAMI.2019.2902391","volume":"42","author":"S Eghbali","year":"2020","unstructured":"Eghbali S, Ashtiani H, Tahvildari L (2020) Online nearest neighbor search using Hamming weight trees. IEEE Trans Pattern Anal Mach Intell 42(7):1729\u20131740","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"9","key":"1611_CR15","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin E (1960) Trie memory. Commun ACM 3(9):490\u2013499","journal-title":"Commun ACM"},{"key":"1611_CR16","doi-asserted-by":"crossref","unstructured":"Gog S, Venturini R (2016) Fast and compact Hamming distance index. In: Proceedings of the 39th international ACM SIGIR conference on research and development in information retrieval. pp 285\u2013294","DOI":"10.1145\/2911451.2911523"},{"key":"1611_CR17","doi-asserted-by":"crossref","unstructured":"Greene D, Parnas M, Yao F (1994) Multi-index hashing for information retrieval. In: Proceedings of the 35th annual symposium on foundations of computer science (FOCS). pp 722\u2013731","DOI":"10.1109\/SFCS.1994.365720"},{"issue":"2","key":"1611_CR18","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/506309.506312","volume":"20","author":"S Heinz","year":"2002","unstructured":"Heinz S, Zobel J, Williams HE (2002) Burst tries: a fast, efficient data structure for string keys. ACM Trans Inf Syst 20(2):192\u2013223","journal-title":"ACM Trans Inf Syst"},{"key":"1611_CR19","doi-asserted-by":"crossref","unstructured":"Henzinger M (2006) Finding near-duplicate web pages: a large-scale evaluation of algorithms. In: Proceedings of the 29th annual international ACM SIGIR conference on research and development in information retrieval. pp 284\u2013291","DOI":"10.1145\/1148170.1148222"},{"key":"1611_CR20","doi-asserted-by":"publisher","first-page":"D541","DOI":"10.1093\/nar\/gkr1130","volume":"40","author":"J-I Ito","year":"2012","unstructured":"Ito J-I, Tabei Y, Shimizu K, Tsuda K, Tomii K (2012) PoSSuM: a database of similar protein-ligand binding and putative pockets. Nucleic Acids Res 40:D541\u2013D548","journal-title":"Nucleic Acids Res"},{"key":"1611_CR21","doi-asserted-by":"crossref","unstructured":"Kanda S, Tabei Y (2019) b-bit sketch trie: scalable similarity search on integer sketches. In: Proceedings of the 2019 IEEE international conference on big data. pp 810\u2013819","DOI":"10.1109\/BigData47090.2019.9006324"},{"key":"1611_CR22","doi-asserted-by":"crossref","unstructured":"Kanda S, Tabei Y (2020) Dynamic similarity search on integer sketches. In: Proceedings of the 20th IEEE international conference on data mining (ICDM). pp 242\u2013251","DOI":"10.1109\/ICDM50108.2020.00033"},{"key":"1611_CR23","doi-asserted-by":"crossref","unstructured":"Kanda S, Takeuchi K, Fujii K, Tabei Y (2020) Succinct trit-array trie for scalable trajectory similarity search. In: Proceedings of the 28th ACM SIGSPATIAL international conference on advances in geographic information systems (SIGSPATIAL). pp 518\u2013529","DOI":"10.1145\/3397536.3422210"},{"issue":"suppl-1","key":"1611_CR24","first-page":"D552","volume":"38","author":"M Kuhn","year":"2009","unstructured":"Kuhn M, Szklarczyk D, Franceschini A, Campillos M, von Mering C, Jensen LJ, Beyer A, Bork P (2009) STITCH 2: an interaction network database for small molecules and proteins. Nucleic Acids Res 38(suppl-1):D552\u2013D556","journal-title":"Nucleic Acids Res"},{"key":"1611_CR25","doi-asserted-by":"crossref","unstructured":"Leis V, Kemper A, Neumann T (2013) The adaptive radix tree: ARTful indexing for main-memory databases. In: Proceedings of the IEEE 29th international conference on data engineering (ICDE). pp 38\u201349","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"1611_CR26","doi-asserted-by":"crossref","unstructured":"Li P (2015) 0-bit consistent weighted sampling. In: Proceedings of the 21th ACM SIGKDD International conference on knowledge discovery and data mining. pp 665\u2013674","DOI":"10.1145\/2783258.2783406"},{"key":"1611_CR27","doi-asserted-by":"crossref","unstructured":"Li P (2017) Linearized GMM kernels and normalized random Fourier features. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. pp 315\u2013324","DOI":"10.1145\/3097983.3098081"},{"key":"1611_CR28","doi-asserted-by":"crossref","unstructured":"Li P, K\u00f6nig C (2010) b-Bit minwise hashing. In: Proceedings of the 19th international conference on World Wide Web (WWW). pp 671\u2013680","DOI":"10.1145\/1772690.1772759"},{"key":"1611_CR29","doi-asserted-by":"crossref","unstructured":"Li P, Lu H, Zheng Q, Yang L, Pan G (2020) LISA: a learned index structure for spatial data. In: Proceedings of the 2020 ACM SIGMOD international conference on management of data. pp 2119\u20132133","DOI":"10.1145\/3318464.3389703"},{"key":"1611_CR30","doi-asserted-by":"crossref","unstructured":"Loosli G, Canu S, Bottou L (2007) Training invariant support vector machines using selective sampling. In: Large scale kernel machines. pp 301\u2013320","DOI":"10.7551\/mitpress\/7496.003.0015"},{"key":"1611_CR31","doi-asserted-by":"crossref","unstructured":"McAuley J, Leskovec J (2013) Hidden factors and hidden topics: understanding rating dimensions with review text. In: Proceedings of the 7th ACM conference on recommender systems (RecSys). pp 165\u2013172","DOI":"10.1145\/2507157.2507163"},{"key":"1611_CR32","unstructured":"Mikolov T, Grave E, Bojanowski P, Puhrsch C, Joulin A (2018) Advances in pre-training distributed word representations. In: Proceedings of the international conference on language resources and evaluation (LREC)\u2019"},{"issue":"6","key":"1611_CR33","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/TPAMI.2013.231","volume":"36","author":"M Norouzi","year":"2014","unstructured":"Norouzi M, Punjani A, Fleet DJ (2014) Fast exact search in Hamming space with multi-index hashing. IEEE Trans Pattern Anal Mach Intell 36(6):1107\u20131119","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"1611_CR34","first-page":"489","volume":"33","author":"J Qin","year":"2021","unstructured":"Qin J, Xiao C, Wang Y, Wang W (2021) Generalizing the pigeonhole principle for similarity search in Hamming space. IEEE Trans Knowl Data Eng 33(2):489\u2013505","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1611_CR35","doi-asserted-by":"crossref","unstructured":"Song J, Yang Y, Yang Y, Huang Z, Shen HT (2013) Inter-media hashing for large-scale retrieval from heterogeneous data sources. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data. pp 785\u2013796","DOI":"10.1145\/2463676.2465274"},{"issue":"14","key":"1611_CR36","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.14778\/2556549.2556574","volume":"6","author":"N Sundaram","year":"2013","unstructured":"Sundaram N, Turmukhametova A, Satish N, Mostak T, Indyk P, Madden S, Dubey P (2013) Streaming similarity search over one billion tweets using parallel locality-sensitive hashing. Proc VLDB Endow 6(14):1930\u20131941","journal-title":"Proc VLDB Endow"},{"issue":"9","key":"1611_CR37","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1002\/minf.201100050","volume":"30","author":"Y Tabei","year":"2011","unstructured":"Tabei Y, Tsuda K (2011) Sketchsort: fast all pairs similarity search for large databases of molecular fingerprints. Mol Inform 30(9):801\u2013807","journal-title":"Mol Inform"},{"key":"1611_CR38","doi-asserted-by":"publisher","first-page":"88369","DOI":"10.1109\/ACCESS.2019.2926303","volume":"7","author":"Z Weng","year":"2019","unstructured":"Weng Z, Zhu Y (2019) Online supervised sketching hashing for large-scale image retrieval. IEEE Access 7:88369\u201388379","journal-title":"IEEE Access"},{"issue":"11","key":"1611_CR39","doi-asserted-by":"publisher","first-page":"694","DOI":"10.3390\/ijgi9110694","volume":"9","author":"R Yang","year":"2020","unstructured":"Yang R, Niu B (2020) Continuous K nearest neighbor queries over large-scale spatial-textual data streams. ISPRS Int J Geo-Inf 9(11):694","journal-title":"ISPRS Int J Geo-Inf"},{"key":"1611_CR40","unstructured":"Yoshinaga N, Kitsuregawa M (2014) A self-adaptive classifier for efficient text-stream processing. In: Proceedings of the 24th international conference on computational linguistics (COLING). pp 1091\u20131102"},{"key":"1611_CR41","doi-asserted-by":"crossref","unstructured":"Zhang H, Lim H, Leis V, Andersen DG, Kaminsky M, Keeton K, Pavlo A (2018) SuRF: practical range query filtering with fast succinct tries. In: Proceedings of the 2018 ACM SIGMOD international conference on management of data. pp 323\u2013336","DOI":"10.1145\/3183713.3196931"},{"key":"1611_CR42","doi-asserted-by":"crossref","unstructured":"Zhang X, Qin J, Wang W, Sun Y, Lu J (2013) HmSearch: an efficient Hamming distance query processing algorithm. In: Proceedings of the 25th international conference on scientific and statistical database management (SSDBM). p 19","DOI":"10.1145\/2484838.2484842"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01611-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-021-01611-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01611-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T15:06:48Z","timestamp":1699456008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-021-01611-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,9]]},"references-count":42,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1611"],"URL":"https:\/\/doi.org\/10.1007\/s10115-021-01611-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2021,9,9]]},"assertion":[{"value":"28 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}