{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:34Z","timestamp":1750307494483,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T00:00:00Z","timestamp":1288051200000},"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":[[2010,10,26]]},"DOI":"10.1145\/1871437.1871714","type":"proceedings-article","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T12:36:11Z","timestamp":1288096571000},"page":"1725-1728","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["CasJoin"],"prefix":"10.1145","author":[{"given":"Xiaoxun","family":"Zhang","sequence":"first","affiliation":[{"name":"IBM Research - China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhili","family":"Guo","sequence":"additional","affiliation":[{"name":"IBM Research - China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honglei","family":"Guo","sequence":"additional","affiliation":[{"name":"IBM Research - China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huijia","family":"Zhu","sequence":"additional","affiliation":[{"name":"IBM Research - China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Su","sequence":"additional","affiliation":[{"name":"IBM Research - China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"918","author":"Arasu A.","year":"2006","unstructured":"A. Arasu , V. Ganti and R. Kaushik . Efficient Exact Set Similarity Joins. In Proc. of VLDB 2006 , pp. 918 -- 929 . A. Arasu, V. Ganti and R. Kaushik. Efficient Exact Set Similarity Joins. In Proc. of VLDB2006, pp. 918--929.","journal-title":"Efficient Exact Set Similarity Joins. In Proc. of VLDB"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007652"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_5_1","first-page":"1311","volume-title":"Proc. of NIPS","author":"Paul V.","year":"2001","unstructured":"V. Paul and J. Michael , Fast and Robust Classification Using Asymmetric AdaBoost and a Detector Cascade . In Proc. of NIPS 2001 . pp. 1311 -- 1318 . V. Paul and J. Michael, Fast and Robust Classification Using Asymmetric AdaBoost and a Detector Cascade. In Proc. of NIPS 2001. pp. 1311--1318."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000013087.49260.fb"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367508"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"},{"key":"e_1_3_2_1_9_1","unstructured":"ODP. Open Directory Project. http:\/\/www.dmoz.org  ODP. Open Directory Project. http:\/\/www.dmoz.org"}],"event":{"name":"CIKM '10: International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Toronto ON Canada","acronym":"CIKM '10"},"container-title":["Proceedings of the 19th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871714","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1871437.1871714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:37Z","timestamp":1750249057000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1871437.1871714"}},"subtitle":["a cascade chain for text similarity joins"],"short-title":[],"issued":{"date-parts":[[2010,10,26]]},"references-count":9,"alternative-id":["10.1145\/1871437.1871714","10.1145\/1871437"],"URL":"https:\/\/doi.org\/10.1145\/1871437.1871714","relation":{},"subject":[],"published":{"date-parts":[[2010,10,26]]},"assertion":[{"value":"2010-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}