{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:17Z","timestamp":1750307357144,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":4,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,24]],"date-time":"2011-07-24T00:00:00Z","timestamp":1311465600000},"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":[[2011,7,24]]},"DOI":"10.1145\/2009916.2010143","type":"proceedings-article","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T14:09:37Z","timestamp":1311689377000},"page":"1249-1250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SEJoin"],"prefix":"10.1145","author":[{"given":"Junfeng","family":"Zhou","sequence":"first","affiliation":[{"name":"Yanshan University, Qinhuangdao, China"}]},{"given":"Ziyang","family":"Chen","sequence":"additional","affiliation":[{"name":"Yanshan University, Qinhuangdao, China"}]},{"given":"Jingrong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Yanshan University, Qinhuangdao, China"}]}],"member":"320","published-online":{"date-parts":[[2011,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"240","volume-title":"MFCS","author":"Jokinen P.","year":"1991","unstructured":"P. Jokinen and E. Ukkonen . Two algorithms for approximate string matching in static texts . In MFCS , pages 240 -- 248 , 1991 . P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. In MFCS, pages 240--248, 1991."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"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","volume-title":"AAAI","author":"Yang Z.","year":"2010","unstructured":"Z. Yang , J. Yu , and M. Kitsuregawa . Fast algorithms for top-k approximate string matching . In AAAI , 2010 . Z. Yang, J. Yu, and M. Kitsuregawa. Fast algorithms for top-k approximate string matching. In AAAI, 2010."}],"event":{"name":"SIGIR '11: The 34th International ACM SIGIR conference on research and development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Beijing China","acronym":"SIGIR '11"},"container-title":["Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2009916.2010143","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2009916.2010143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:22Z","timestamp":1750245742000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2009916.2010143"}},"subtitle":["an optimized algorithm towards efficient approximate string searches"],"short-title":[],"issued":{"date-parts":[[2011,7,24]]},"references-count":4,"alternative-id":["10.1145\/2009916.2010143","10.1145\/2009916"],"URL":"https:\/\/doi.org\/10.1145\/2009916.2010143","relation":{},"subject":[],"published":{"date-parts":[[2011,7,24]]},"assertion":[{"value":"2011-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}