{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:56Z","timestamp":1750307576679,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T00:00:00Z","timestamp":1257120000000},"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":[[2009,11,2]]},"DOI":"10.1145\/1645953.1645995","type":"proceedings-article","created":{"date-parts":[[2009,11,10]],"date-time":"2009-11-10T18:36:45Z","timestamp":1257878205000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Efficient algorithms for approximate member extraction using signature-based inverted lists"],"prefix":"10.1145","author":[{"given":"Jiaheng","family":"Lu","sequence":"first","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Jialong","family":"Han","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"given":"Xiaofeng","family":"Meng","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2009,11,2]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"918","volume-title":"VLDB","author":"Arasu A.","year":"2006","unstructured":"A. Arasu , V. Ganti , R. Kaushik . Efficient exact set-similarity joins . In VLDB , pages 918 -- 929 , 2006 . A. Arasu, V. Ganti, R. Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918--929, 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1376616.1376697"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/ICDE.2006.55"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/ICDE.2006.9"},{"unstructured":"M.R.Garey and D.S.Johnson. Computers and Intractability: Guidance to the Theory of NP-Completeness.   M.R.Garey and D.S.Johnson. Computers and Intractability: Guidance to the Theory of NP-Completeness.","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","first-page":"491","volume-title":"VLDB","author":"Gravano L.","year":"2001","unstructured":"L. Gravano , P. G. Ipeirotis , H. V. Jagadish , N. Koudas , S. Muthukrishnan , and D. Srivastava . Approximate string joins in a database (almost) for free . In VLDB , pages 491 -- 500 , 2001 . L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB, pages 491--500, 2001."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_1_8_1","volume-title":"VLDB","author":"Li C.","year":"2007","unstructured":"C. Li , B,Wang, X. Yang , VGRAM : Improving performance of approximate queries on string collections using variable length grams . In VLDB 2007 . C. Li, B,Wang, X. Yang, VGRAM: Improving performance of approximate queries on string collections using variable length grams. In VLDB 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/375360.375365"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1007568.1007652"},{"issue":"4","key":"e_1_3_2_1_11_1","first-page":"35","article-title":"Modern information retrieval: A brief overview","volume":"24","author":"Singhal A.","year":"2001","unstructured":"A. Singhal . Modern information retrieval: A brief overview . Bulletin of the IEEE Computer Society Technical Committee on Data Engineering , 24 ( 4 ): 35 -- 43 , 2001 . A. Singhal. Modern information retrieval: A brief overview. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 24(4):35--43, 2001.","journal-title":"Bulletin of the IEEE Computer Society Technical Committee on Data Engineering"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/647905.739616"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1559845.1559925"},{"key":"e_1_3_2_1_14_1","volume-title":"Morgan Kaufmann","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 , 1999 . I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, 1999."},{"key":"e_1_3_2_1_15_1","first-page":"387","volume-title":"CPM","author":"Yao A. C.","year":"1995","unstructured":"A. C. Yao and F. F. Yao . Dictionary loop-up with small errors . In CPM , pages 387 -- 394 , 1995 A. C. Yao and F. F. Yao. Dictionary loop-up with small errors. In CPM, pages 387--394, 1995"}],"event":{"sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"CIKM '09","name":"CIKM '09: Conference on Information and Knowledge Management","location":"Hong Kong China"},"container-title":["Proceedings of the 18th ACM conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1645953.1645995","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1645953.1645995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:09Z","timestamp":1750250469000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1645953.1645995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,2]]},"references-count":15,"alternative-id":["10.1145\/1645953.1645995","10.1145\/1645953"],"URL":"https:\/\/doi.org\/10.1145\/1645953.1645995","relation":{},"subject":[],"published":{"date-parts":[[2009,11,2]]},"assertion":[{"value":"2009-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}