{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:56:53Z","timestamp":1747810613885},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:p>Similarity joins are important operations with a broad range of applications. In this paper, we study the problem of vector similarity join size estimation (VSJ). It is a generalization of the previously studied set similarity join size estimation (SSJ) problem and can handle more interesting cases such as TF-IDF vectors. One of the key challenges in similarity join size estimation is that the join size can change dramatically depending on the input similarity threshold.<\/jats:p>\n          <jats:p>\n            We propose a sampling based algorithm that uses Locality-Sensitive-Hashing (LSH). The proposed algorithm\n            <jats:italic>LSH-SS<\/jats:italic>\n            uses an LSH index to enable effective sampling even at high thresholds. We compare the proposed technique with random sampling and the state-of-the-art technique for SSJ (adapted to VSJ) and demonstrate\n            <jats:italic>LSH-SS<\/jats:italic>\n            offers more accurate estimates throughout the similarity threshold range and small variance using real-world data sets.\n          <\/jats:p>","DOI":"10.14778\/1978665.1978666","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"338-349","source":"Crossref","is-referenced-by-count":26,"title":["Similarity join size estimation using locality sensitive hashing"],"prefix":"10.14778","volume":"4","author":[{"given":"Hongrae","family":"Lee","sequence":"first","affiliation":[{"name":"University of British Columbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond T.","family":"Ng","sequence":"additional","affiliation":[{"name":"University of British Columbia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyuseok","family":"Shim","sequence":"additional","affiliation":[{"name":"Seoul National University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303978"},{"key":"e_1_2_1_2_1","first-page":"918","volume-title":"Proc. VLDB","author":"Arasu A.","year":"2006","unstructured":"A. Arasu , V. Ganti , and R. Kaushik . Efficient Exact Set-Similarity Joins . In Proc. VLDB , pages 918 -- 929 , 2006 . A. Arasu, V. Ganti, and R. Kaushik. Efficient Exact Set-Similarity Joins. In Proc. VLDB, pages 918--929, 2006."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_2_1_4_1","first-page":"21","volume-title":"On the Resemblance and Containment of Documents. In Proc. SEQUENCES","author":"Broder A. Z.","year":"1997","unstructured":"A. Z. Broder . On the Resemblance and Containment of Documents. In Proc. SEQUENCES , pages 21 -- 29 , 1997 . A. Z. Broder. On the Resemblance and Containment of Documents. In Proc. SEQUENCES, pages 21--29, 1997."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304206"},{"key":"e_1_2_1_8_1","volume-title":"Sampling Techniques","author":"Cochran W. G.","year":"1977","unstructured":"W. G. Cochran . Sampling Techniques . John Wiley & amp;amp; Sons, 1977 . W. G. Cochran. Sampling Techniques. John Wiley &amp;amp; Sons, 1977."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233340"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/153850.153875"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453883"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115835"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687702"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.93611"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1978665.1978666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:18:44Z","timestamp":1672222724000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1978665.1978666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["10.14778\/1978665.1978666"],"URL":"https:\/\/doi.org\/10.14778\/1978665.1978666","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}