{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:26Z","timestamp":1740109286991,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T00:00:00Z","timestamp":1486339200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["614331"],"award-info":[{"award-number":["614331"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00453-017-0285-5","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T10:36:53Z","timestamp":1486377413000},"page":"1263-1283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["I\/O-Efficient Similarity Join"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1516-9306","authenticated-orcid":false,"given":"Rasmus","family":"Pagh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ninh","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9077-9921","authenticated-orcid":false,"given":"Francesco","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten","family":"St\u00f6ckel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Proceedings of FOCS\u201906, pp. 459\u2013468 (2006)","key":"285_CR1","DOI":"10.1109\/FOCS.2006.49"},{"unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: Proceedings of VLDB\u201906, pp. 918\u2013929 (2006)","key":"285_CR2"},{"doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: Proceedings of WWW\u201907, pp. 131\u2013140 (2007)","key":"285_CR3","DOI":"10.1145\/1242572.1242591"},{"issue":"8\u201313","key":"285_CR4","first-page":"1157","volume":"29","author":"AZ Broder","year":"1997","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the web. Comput. Netw. 29(8\u201313), 1157\u20131166 (1997)","journal-title":"Comput. Netw."},{"doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of STOC\u201902, pp. 380\u2013388 (2002)","key":"285_CR5","DOI":"10.1145\/509907.509965"},{"doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: Proceedings of ICDE\u201906, p.\u00a05 (2006)","key":"285_CR6","DOI":"10.1109\/ICDE.2006.9"},{"doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of SOCG\u201904, pp. 253\u2013262 (2004)","key":"285_CR7","DOI":"10.1145\/997817.997857"},{"key":"285_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"DP Dubhashi","year":"2009","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge (2009)"},{"doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proceedings of FOCS\u201999, pp. 285\u2013297 (1999)","key":"285_CR9","DOI":"10.1109\/SFFCS.1999.814600"},{"unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of VLDB\u201999, pp. 518\u2013529 (1999)","key":"285_CR10"},{"key":"285_CR11","volume-title":"The Theory of Branching Processes","author":"TE Harris","year":"2002","unstructured":"Harris, T.E.: The Theory of Branching Processes. Courier Dover Publications, New York (2002)"},{"doi-asserted-by":"crossref","unstructured":"He, B., Luo, Q.: Cache-oblivious nested-loop joins. In: Proceedings of CIKM\u201906, pp. 718\u2013727 (2006)","key":"285_CR12","DOI":"10.1145\/1183614.1183717"},{"doi-asserted-by":"crossref","unstructured":"Henzinger, M.R.: Finding near-duplicate web pages: a large-scale evaluation of algorithms. In: Proceedings of SIGIR\u201906, pp. 284\u2013291 (2006)","key":"285_CR13","DOI":"10.1145\/1148170.1148222"},{"doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: Proceedings of STOC\u201998, pp. 604\u2013613 (1998)","key":"285_CR14","DOI":"10.1145\/276698.276876"},{"issue":"4","key":"285_CR15","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/2590989.2590991","volume":"42","author":"HQ Ngo","year":"2013","unstructured":"Ngo, H.Q., R\u00e9, C., Rudra, A.: Skew strikes back: new developments in the theory of join algorithms. SIGMOD Rec. 42(4), 5\u201316 (2013)","journal-title":"SIGMOD Rec."},{"doi-asserted-by":"crossref","unstructured":"Pacuk, A., Sankowski, P., Wegrzycki, K., Wygocki, P.: Locality-sensitive hashing without false negatives for l_p. In: Proceedings of COCOON\u201916, pp. 105\u2013118 (2016)","key":"285_CR16","DOI":"10.1007\/978-3-319-42634-1_9"},{"doi-asserted-by":"crossref","unstructured":"Pagh, R.: Locality-sensitive hashing without false negatives. In: Proceedings of SODA\u201916, pp. 1\u20139 (2016)","key":"285_CR17","DOI":"10.1137\/1.9781611974331.ch1"},{"key":"285_CR18","first-page":"941","volume":"2015","author":"R Pagh","year":"2015","unstructured":"Pagh, R., Pham, N., Silvestri, F., St\u00f6ckel, M.: I\/O-efficient similarity join. Proc. ESA 2015, 941\u2013952 (2015)","journal-title":"Proc. ESA"},{"key":"285_CR19","volume-title":"Algorithms and Data Structures for External Memory","author":"JS Vitter","year":"2008","unstructured":"Vitter, J.S.: Algorithms and Data Structures for External Memory. Now Publishers Inc, Hanover, MA (2008)"},{"doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: Proceedings of WWW\u201908, pp. 131\u2013140 (2008)","key":"285_CR20","DOI":"10.1145\/1367497.1367516"},{"unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: Proceedings of VLDB\u201981, pp. 82\u201394 (1981)","key":"285_CR21"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0285-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0285-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0285-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T15:29:47Z","timestamp":1499959787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0285-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,6]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["285"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0285-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,2,6]]}}}