{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:16:02Z","timestamp":1779174962025,"version":"3.51.4"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,8]]},"abstract":"<jats:p>Identifying records that refer to the same entity is a fundamental step for data integration. Since it is prohibitively expensive to compare every pair of records, blocking techniques are typically employed to reduce the complexity of this task. These techniques partition records into blocks and limit the comparison to records co-occurring in a block. Generally, to deal with highly heterogeneous and noisy data (e.g. semi-structured data of the Web), these techniques rely on redundancy to reduce the chance of missing matches.<\/jats:p>\n          <jats:p>Meta-blocking is the task of restructuring blocks generated by redundancy-based blocking techniques, removing superfluous comparisons. Existing meta-blocking approaches rely exclusively on schema-agnostic features.<\/jats:p>\n          <jats:p>\n            In this paper, we demonstrate how \"loose\" schema information (i.e., statistics collected directly from the data) can be exploited to enhance the quality of the blocks in a holistic\n            <jats:italic>loosely schema-aware<\/jats:italic>\n            (meta-)blocking approach that can be used to speed up your favorite Entity Resolution algorithm. We call it B\n            <jats:sc>last<\/jats:sc>\n            (Blocking with Loosely-Aware Schema Techniques). We show how B\n            <jats:sc>last<\/jats:sc>\n            can automatically extract this loose information by adopting a LSH-based step for efficiently scaling to large datasets. We experimentally demonstrate, on real-world datasets, how B\n            <jats:sc>last<\/jats:sc>\n            outperforms the state-of-the-art unsupervised meta-blocking approaches, and, in many cases, also the supervised one.\n          <\/jats:p>","DOI":"10.14778\/2994509.2994533","type":"journal-article","created":{"date-parts":[[2016,9,6]],"date-time":"2016-09-06T15:27:03Z","timestamp":1473175623000},"page":"1173-1184","source":"Crossref","is-referenced-by-count":52,"title":["BLAST"],"prefix":"10.14778","volume":"9","author":[{"given":"Giovanni","family":"Simonini","sequence":"first","affiliation":[{"name":"Universit\u00e0 degli Studi di, Modena e Reggio Emilia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia","family":"Bergamaschi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di, Modena e Reggio Emilia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. V.","family":"Jagadish","sequence":"additional","affiliation":[{"name":"Univ. of Michigan, Ann Arbor"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04898-2_161"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13740-016-0063-6"},{"issue":"3","key":"e_1_2_1_3_1","first-page":"1","article-title":"Linked data-the story so far. Semantic Services","volume":"5","author":"Bizer C.","year":"2009","unstructured":"C. Bizer , T. Heath , and T. Berners-Lee . Linked data-the story so far. Semantic Services , Interoperability and Web Applications: Emerging Concepts , 5 ( 3 ): 1 -- 22 , 2009 . C. Bizer, T. Heath, and T. Berners-Lee. Linked data-the story so far. Semantic Services, Interoperability and Web Applications: Emerging Concepts, 5(3):1--22, 2009.","journal-title":"Interoperability and Web Applications: Emerging Concepts"},{"key":"e_1_2_1_4_1","first-page":"21","volume-title":"Proceedings of the Compression and Complexity of Sequences 1997, SEQUENCES '97","author":"Broder A.","unstructured":"A. Broder . On the resemblance and containment of documents . In Proceedings of the Compression and Complexity of Sequences 1997, SEQUENCES '97 , pages 21 --. IEEE Computer Society, 1997. A. Broder. On the resemblance and containment of documents. In Proceedings of the Compression and Complexity of Sequences 1997, SEQUENCES '97, pages 21--. IEEE Computer Society, 1997."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.127"},{"key":"e_1_2_1_6_1","volume-title":"Elements of information theory","author":"Cover T. M.","year":"2012","unstructured":"T. M. Cover and J. A. Thomas . Elements of information theory . John Wiley & Sons , 2012 . T. M. Cover and J. A. Thomas. Elements of information theory. John Wiley & Sons, 2012."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921635"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00578ED1V01Y201404DTM040"},{"key":"e_1_2_1_9_1","first-page":"491","volume-title":"VLDB","author":"Gravano L.","year":"2001","unstructured":"L. Gravano , P. G. Ipeirotis , H. V. Jagadish , N. Koudas , S. Muthukrishnan , and D. Srivastava . Approximate string joins in a database (almost) for free . In VLDB , pages 491 -- 500 , 2001 . L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB, pages 491--500, 2001."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2009.10.003"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2787930"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433439"},{"key":"e_1_2_1_13_1","first-page":"342","volume-title":"CIDR","author":"Madhavan J.","year":"2007","unstructured":"J. Madhavan , S. Cohen , X. L. Dong , A. Y. Halevy , S. R. Jeffery , D. Ko , and C. Yu . Web-scale data integration: You can afford to pay as you go . In CIDR , pages 342 -- 350 , 2007 . J. Madhavan, S. Cohen, X. L. Dong, A. Y. Halevy, S. R. Jeffery, D. Ko, and C. Yu. Web-scale data integration: You can afford to pay as you go. In CIDR, pages 342--350, 2007."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1841211"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283696.2283783"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856326"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.150"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733098"},{"key":"e_1_2_1_20_1","first-page":"221","volume-title":"EDBT","author":"Papadakis G.","year":"2016","unstructured":"G. Papadakis , G. Papastefanatos , T. Palpanas , and M. Koubarakis . Scaling entity resolution to large, heterogeneous data with enhanced meta-blocking . In EDBT , pages 221 -- 232 , 2016 . G. Papadakis, G. Papastefanatos, T. Palpanas, and M. Koubarakis. Scaling entity resolution to large, heterogeneous data with enhanced meta-blocking. In EDBT, pages 221--232, 2016."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.253"},{"key":"e_1_2_1_22_1","volume-title":"ERCIM","author":"Vandenbussche P.","year":"2014","unstructured":"P. Vandenbussche and B. Vatant . Linked open vocabularies . ERCIM , 2014(96), 2014 . P. Vandenbussche and B. Vatant. Linked open vocabularies. ERCIM, 2014(96), 2014."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2994509.2994533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:54:30Z","timestamp":1672224870000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2994509.2994533"}},"subtitle":["a loosely schema-aware meta-blocking approach for entity resolution"],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":22,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.14778\/2994509.2994533"],"URL":"https:\/\/doi.org\/10.14778\/2994509.2994533","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,8]]}}}