{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:09:58Z","timestamp":1757779798921,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_78","type":"book-chapter","created":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T01:40:34Z","timestamp":1441071634000},"page":"941-952","source":"Crossref","is-referenced-by-count":9,"title":["I\/O-Efficient Similarity Join"],"prefix":"10.1007","author":[{"given":"Rasmus","family":"Pagh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ninh","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"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":[[2015,11,12]]},"reference":[{"key":"78_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Proceedings of FOCS 2006, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"78_CR2","unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: Proceedings of VLDB 2006, pp. 918\u2013929 (2006)"},{"key":"78_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: Proceedings of WWW 2007, pp. 131\u2013140 (2007)","DOI":"10.1145\/1242572.1242591"},{"issue":"8-13","key":"78_CR4","first-page":"1157","volume":"29","author":"A.Z. Broder","year":"1997","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the web. Computer Networks\u00a029(8-13), 1157\u20131166 (1997)","journal-title":"Computer Networks"},{"key":"78_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of STOC 2002, pp. 380\u2013388 (2002)","DOI":"10.1145\/509961.509965"},{"key":"78_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: Proceedings of ICDE 2006, p. 5 (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"78_CR7","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 2004, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"78_CR8","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proceedings of FOCS 1999, pp. 285\u2013297 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"78_CR9","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of VLDB 1999, pp. 518\u2013529 (1999)"},{"key":"78_CR10","unstructured":"Harris, T.E.: The theory of branching processes. Courier Dover Publications (2002)"},{"key":"78_CR11","doi-asserted-by":"crossref","unstructured":"He, B., Luo, Q.: Cache-oblivious nested-loop joins. In: Proceedings of CIKM 2006, pp. 718\u2013727 (2006)","DOI":"10.1145\/1183614.1183717"},{"key":"78_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: Proceedings of STOC 1998, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"78_CR13","doi-asserted-by":"crossref","unstructured":"Pagh, R., Pham, N., Silvestri, F., St\u00f6ckel, M.: I\/O-efficient similarity join. Full version, arXiv:1507.00552 (2015)","DOI":"10.1007\/978-3-662-48350-3_78"},{"key":"78_CR14","unstructured":"Vitter, J.S.: Algorithms and Data Structures for External Memory. Now Publishers Inc. (2008)"},{"key":"78_CR15","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 2008, pp. 131\u2013140 (2008)","DOI":"10.1145\/1367497.1367516"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T09:57:04Z","timestamp":1748599024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}