{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T14:04:21Z","timestamp":1771855461667,"version":"3.50.1"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:00:00Z","timestamp":1768521600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.is.2026.102692","type":"journal-article","created":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T14:10:33Z","timestamp":1768572633000},"page":"102692","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["DynaHash: An efficient blocking structure for streaming record linkage"],"prefix":"10.1016","volume":"138","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3878-5988","authenticated-orcid":false,"given":"Dimitrios","family":"Karapiperis","sequence":"first","affiliation":[]},{"given":"Christos","family":"Tjortjis","sequence":"additional","affiliation":[]},{"given":"Vassilios S.","family":"Verykios","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.is.2026.102692_b1","series-title":"Data-Centric Sys. and Appl","article-title":"Data matching - concepts and techniques for record linkage, entity resolution, and duplicate detection","author":"Christen","year":"2012"},{"key":"10.1016\/j.is.2026.102692_b2","series-title":"SIGMOD","first-page":"1478","article-title":"Online topic-aware entity resolution over incomplete data streams","author":"Ren","year":"2021"},{"key":"10.1016\/j.is.2026.102692_b3","series-title":"PVLDB","first-page":"2783","article-title":"A randomized blocking structure for streaming record linkage","author":"Karapiperis","year":"2023"},{"key":"10.1016\/j.is.2026.102692_b4","series-title":"ICDE","first-page":"1248","article-title":"End-to-end task based parallelization for entity resolution on dynamic data","author":"Gazzari","year":"2021"},{"key":"10.1016\/j.is.2026.102692_b5","series-title":"SAC","first-page":"80","article-title":"Schema-agnostic blocking fir streaming data","author":"Araujo","year":"2020"},{"key":"10.1016\/j.is.2026.102692_b6","series-title":"EDBT","first-page":"73","article-title":"Summarization algorithms for record linkage","author":"Karapiperis","year":"2018"},{"key":"10.1016\/j.is.2026.102692_b7","series-title":"Big Data","first-page":"523","article-title":"Efficient record linkage in data streams","author":"Karapiperis","year":"2020"},{"key":"10.1016\/j.is.2026.102692_b8","series-title":"PVLDB","first-page":"315","article-title":"Schema-agnostic vs schema-based configurations for blocking methods on homogeneous data","author":"Papadakis","year":"2015"},{"issue":"9","key":"10.1016\/j.is.2026.102692_b9","first-page":"1537","article-title":"A survey of indexing techniques for scalable record linkage and deduplication","volume":"12","author":"Christen","year":"2012","journal-title":"TKDE"},{"key":"10.1016\/j.is.2026.102692_b10","series-title":"PVLDB","first-page":"1929","article-title":"Supervised meta-blocking","author":"Papadakis","year":"2014"},{"issue":"8","key":"10.1016\/j.is.2026.102692_b11","first-page":"1946","article-title":"Meta-blocking: Taking entity resolution to the next level","volume":"26","author":"Papadakis","year":"2014","journal-title":"TKDE"},{"key":"10.1016\/j.is.2026.102692_b12","series-title":"ACM STOC","first-page":"327","article-title":"Minwise independent permutations","author":"Broder","year":"1998"},{"issue":"1","key":"10.1016\/j.is.2026.102692_b13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","article-title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","volume":"51","author":"Andoni","year":"2008","journal-title":"CACM"},{"key":"10.1016\/j.is.2026.102692_b14","series-title":"PVLDB","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"Lv","year":"2007"},{"key":"10.1016\/j.is.2026.102692_b15","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s41019-020-00146-w","article-title":"Blocking techniques for entity linkage: A semantics-based approach","author":"Azzalini","year":"2021","journal-title":"Data Sci. Eng."},{"issue":"5","key":"10.1016\/j.is.2026.102692_b16","first-page":"1111","article-title":"Pay\u2013as\u2013you\u2013go entity resolution","volume":"25","author":"Whang","year":"2013","journal-title":"TKDE"},{"issue":"5","key":"10.1016\/j.is.2026.102692_b17","first-page":"1316","article-title":"Progressive duplicate detection","volume":"27","author":"Papenbrock","year":"2015","journal-title":"TKDE"},{"key":"10.1016\/j.is.2026.102692_b18","first-page":"384","article-title":"Online entity resolution using an oracle","volume":"vol. 9","author":"Firmani","year":"2016"},{"key":"10.1016\/j.is.2026.102692_b19","series-title":"ICDE","first-page":"53","article-title":"Schema-agnostic progressive entity resolution","author":"Simonini","year":"2018"},{"key":"10.1016\/j.is.2026.102692_b20","series-title":"EDBT","first-page":"80","article-title":"Progressive entity resolution over incremental data","author":"Gazzari","year":"2022"},{"key":"10.1016\/j.is.2026.102692_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.is.2023.102307","article-title":"GSM: A generalized approach to supervised meta-blocking for scalable entity resolution","volume":"120","author":"Gagliardelli","year":"2024","journal-title":"Inf. Syst."},{"key":"10.1016\/j.is.2026.102692_b22","series-title":"PVLDB","first-page":"697","article-title":"Incremental record linkage","author":"Gruenheid","year":"2014"},{"issue":"1","key":"10.1016\/j.is.2026.102692_b23","first-page":"429","article-title":"On-the-fly entity-aware query processing in the presence of linkage","volume":"3","author":"Ioannou","year":"2010","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2026.102692_b24","first-page":"1846","article-title":"Query-driven approach to entity resolution","volume":"vol. 6","author":"Altwaijry","year":"2013"},{"key":"10.1016\/j.is.2026.102692_b25","series-title":"KDD","first-page":"529","article-title":"Query-time entity resolution","author":"Bhattacharya","year":"2006"},{"issue":"7","key":"10.1016\/j.is.2026.102692_b26","first-page":"2803","article-title":"A suite of efficent randomized algorithms for streaming record linkage","volume":"36","author":"Karapiperis","year":"2024","journal-title":"TKDE"},{"key":"10.1016\/j.is.2026.102692_b27","series-title":"PVLDB","first-page":"1507","article-title":"Sparkly: A simple yet surprisingly strong TF\/IDF blocker for entity matching","author":"Paulsen","year":"2023"},{"key":"10.1016\/j.is.2026.102692_b28","series-title":"PVLDB","first-page":"2459","article-title":"Deep learning for blocking in entity matching: a design space exploration","author":"Thirumuruganathan","year":"2021"},{"key":"10.1016\/j.is.2026.102692_b29","series-title":"ICDE","first-page":"1502","article-title":"Sudowoodo: Contrastive self-supervised learning for multi-purpose data integration and preparation","author":"Wang","year":"2023"},{"key":"10.1016\/j.is.2026.102692_b30","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/3584014.3584017","article-title":"A graph-based blocking approach for entity matching using contrastively learned embeddings","volume":"22","author":"Mugeni","year":"2023","journal-title":"SIGAPP Appl. Comput. Rev."},{"key":"10.1016\/j.is.2026.102692_b31","series-title":"SAC","first-page":"357","article-title":"A graph-based blocking approach for entity matching using pre-trained contextual embedding models","author":"Mugeni","year":"2022"},{"key":"10.1016\/j.is.2026.102692_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.is.2024.102506","article-title":"TREATS: Fairness-aware entity resolution over streaming data","volume":"129","author":"Ara\u00fajo","year":"2025","journal-title":"Inf. Syst."},{"issue":"11","key":"10.1016\/j.is.2026.102692_b33","first-page":"3279","article-title":"Through the fairness lens: Experimental analysis and evaluation of entity matching","volume":"16","author":"Shahbazi","year":"2023","journal-title":"PVLDB"},{"key":"10.1016\/j.is.2026.102692_b34","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s11704-015-5900-5","article-title":"String similarity search and join : A survey","volume":"10","author":"Yu","year":"2016","journal-title":"Front. Comput. Sci."},{"key":"10.1016\/j.is.2026.102692_b35","doi-asserted-by":"crossref","first-page":"2604","DOI":"10.1109\/JPROC.2012.2193849","article-title":"Optimal parameters for locality-sensitive hashing","volume":"100","author":"Slaney","year":"2012","journal-title":"Proc. IEEE"},{"issue":"7","key":"10.1016\/j.is.2026.102692_b36","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","article-title":"Space\/time trade-offs in hash coding with allowable errors","volume":"13","author":"Bloom","year":"1970","journal-title":"CACM"},{"key":"10.1016\/j.is.2026.102692_b37","first-page":"276","article-title":"A new data structure for efficient spatial query processing: The kb-tree","volume":"35","author":"L\u00f3pez","year":"2021","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"10.1016\/j.is.2026.102692_b38","series-title":"WWW","first-page":"243","article-title":"An overview of microsoft academic service (MAS) and applications","author":"Sinha","year":"2015"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437926000062?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437926000062?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T13:05:19Z","timestamp":1771851919000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437926000062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":38,"alternative-id":["S0306437926000062"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2026.102692","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"DynaHash: An efficient blocking structure for streaming record linkage","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2026.102692","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"102692"}}