{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:44:34Z","timestamp":1771699474789,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007568.1007652","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"743-754","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":235,"title":["Efficient set joins on similarity predicates"],"prefix":"10.1145","author":[{"given":"Sunita","family":"Sarawagi","sequence":"first","affiliation":[{"name":"IIT Bombay"}]},{"given":"Alok","family":"Kirpal","sequence":"additional","affiliation":[{"name":"IIT Bombay"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672836"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287420"},{"key":"e_1_3_2_1_3_1","volume-title":"SEQS: Sequences '91","year":"1998","unstructured":"Broder. On the resemblance and containment of documents . In SEQS: Sequences '91 , 1998 . Broder. On the resemblance and containment of documents. In SEQS: Sequences '91, 1998."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/283554.283370"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335225"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908981"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0989"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/352595.352598"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 17th Conference on Very Large Databases, Morgan Kaufman pubs. (Los Altos CA)","author":"DeWitt D.","year":"1991","unstructured":"D. DeWitt , J. Naughton , and D. Schneider . An evaluation of non-equijoin algorithms . In Proceedings of the 17th Conference on Very Large Databases, Morgan Kaufman pubs. (Los Altos CA) , Barcelona , 1991 . D. DeWitt, J. Naughton, and D. Schneider. An evaluation of non-equijoin algorithms. In Proceedings of the 17th Conference on Very Large Databases, Morgan Kaufman pubs. (Los Altos CA), Barcelona, 1991."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. of the 27th Int'l Conference on Very Large Databases (VLDB)","author":"Gravano L.","year":"2001","unstructured":"L. Gravano , P. Ipeirotis , H. V. Jagadish , N. Koudas , S. Muthukrishnan , and D. Srivastava . Approximate string joins in a database (almost) for free . In Proc. of the 27th Int'l Conference on Very Large Databases (VLDB) , Rome, Italy , 2001 . L. Gravano, P. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In Proc. of the 27th Int'l Conference on Very Large Databases (VLDB), Rome, Italy, 2001."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260850"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.10268"},{"key":"e_1_3_2_1_15_1","first-page":"386","volume-title":"The VLDB Journal","author":"Helmer S.","year":"1997","unstructured":"S. Helmer and G. Moerkotte . Evaluation of main memory join algorithms for joins with set comparison join predicates . In The VLDB Journal , pages 386 -- 395 , 1997 . S. Helmer and G. Moerkotte. Evaluation of main memory join algorithms for joins with set comparison join predicates. In The VLDB Journal, pages 386--395, 1997."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009761603038"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872778"},{"key":"e_1_3_2_1_18_1","volume-title":"Adaptive algorithms for set containment joins. Technical report","author":"Melnik S.","year":"2001","unstructured":"S. Melnik and H. Garcia-Molina . Adaptive algorithms for set containment joins. Technical report , Stanford University , 2001 . S. Melnik and H. Garcia-Molina. Adaptive algorithms for set containment joins. Technical report, Stanford University, 2001."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.591454"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96)","author":"Monge A. E.","year":"1996","unstructured":"A. E. Monge and C. P. Elkan . The field matching problem: Algorithms and applications . In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96) , 1996 . A. E. Monge and C. P. Elkan. The field matching problem: Algorithms and applications. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), 1996."},{"key":"e_1_3_2_1_21_1","volume-title":"VLDB","author":"Ramasamy K.","year":"2000","unstructured":"K. Ramasamy , J. M. Patel , J. F. Naughton , and R. Kaushik . Set containment joins: The good, the bad and the ugly . In VLDB , 2000 . K. Ramasamy, J. M. Patel, J. F. Naughton, and R. Kaushik. Set containment joins: The good, the bad and the ugly. In VLDB, 2000."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775087"},{"key":"e_1_3_2_1_23_1","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"Witten I. H.","year":"1999","unstructured":"I. H. Witten , A. Moffat , and T. C. Bell . Managing Gigabytes: Compressing and Indexing Documents and Images . Morgan Kaufmann Publishing , San Francisco , 1999 . I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishing, San Francisco, 1999."}],"event":{"name":"SIGMOD\/PODS04: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Paris France","acronym":"SIGMOD\/PODS04","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2004 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007568.1007652","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007568.1007652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:32Z","timestamp":1750264292000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007568.1007652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":23,"alternative-id":["10.1145\/1007568.1007652","10.1145\/1007568"],"URL":"https:\/\/doi.org\/10.1145\/1007568.1007652","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}