{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T20:33:27Z","timestamp":1780086807203,"version":"3.54.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>\n            We developed T\n            <jats:sc>oronto<\/jats:sc>\n            O\n            <jats:sc>pen<\/jats:sc>\n            D\n            <jats:sc>ata<\/jats:sc>\n            S\n            <jats:sc>earch<\/jats:sc>\n            to support the\n            <jats:italic>ad hoc<\/jats:italic>\n            , interactive discovery of connections or\n            <jats:italic>linkages<\/jats:italic>\n            between datasets. It can be used to efficiently navigate through the open data cloud. Our system consists of three parts: a user-interface provided by a Web application; a scalable backend infrastructure that supports navigational queries; and a dynamic repository of open data tables. Our system uses LSH Ensemble, an efficient index structure, to compute linkages (attributes in two datasets with high containment score) in real time at Internet scale. Our application allows users to navigate along these linkages by joining datasets.\n          <\/jats:p>\n          <jats:p>LSH Ensemble is scalable, providing millisecond response times for linkage discovery queries even over millions of datasets. Our system offers users a highly interactive experience making unrelated (and unlinked) dynamic collections of datasets appear as a richly connected cloud of data that can be navigated and combined easily in real time.<\/jats:p>","DOI":"10.14778\/3137765.3137788","type":"journal-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T13:35:53Z","timestamp":1504791353000},"page":"1837-1840","source":"Crossref","is-referenced-by-count":17,"title":["Interactive navigation of open data linkages"],"prefix":"10.14778","volume":"10","author":[{"given":"Erkang","family":"Zhu","sequence":"first","affiliation":[{"name":"University of Toronto"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ken Q.","family":"Pu","sequence":"additional","affiliation":[{"name":"UOIT"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fatemeh","family":"Nargesian","sequence":"additional","affiliation":[{"name":"University of Toronto"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ren\u00e9e J.","family":"Miller","sequence":"additional","affiliation":[{"name":"University of Toronto"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"21","volume-title":"Compression and Complexity of Sequences","author":"Broder A.","year":"1997","unstructured":"A. Broder . On the resemblance and containment of documents . In Compression and Complexity of Sequences , pages 21 -- 28 , 1997 . A. Broder. On the resemblance and containment of documents. In Compression and Complexity of Sequences, pages 21--28, 1997."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213962"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536345"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2889386"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2015.05.001"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139058452","volume-title":"Mining of Massive Datasets","author":"Rajaraman A.","year":"2011","unstructured":"A. Rajaraman and J. D. Ullman . Mining of Massive Datasets . 2011 . A. Rajaraman and J. D. Ullman. Mining of Massive Datasets. 2011."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994534"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3137765.3137788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:09:43Z","timestamp":1672222183000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3137765.3137788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":8,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.14778\/3137765.3137788"],"URL":"https:\/\/doi.org\/10.14778\/3137765.3137788","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}