{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:41Z","timestamp":1750306901106,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"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":[[2013,3,18]]},"DOI":"10.1145\/2457317.2457391","type":"proceedings-article","created":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T12:25:54Z","timestamp":1364300754000},"page":"404-412","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Cache-aware parallel approximate matching and join algorithms using BWT"],"prefix":"10.1145","author":[{"given":"Jiaying","family":"Wang","sequence":"first","affiliation":[{"name":"Northeastern University, Liaoning, China"}]},{"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[{"name":"Northeastern University, Liaoning, China"}]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University, Liaoning, China"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/362003.362025"},{"key":"e_1_3_2_1_2_1","first-page":"311","volume-title":"SODA","author":"Yianilos Peter N.","year":"1993","unstructured":"Peter N. Yianilos . Data structures and algorithms for nearest neighbor search in general metric spaces . In SODA , pages 311 -- 321 , 1993 . Peter N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In SODA, pages 311--321, 1993."},{"key":"e_1_3_2_1_3_1","first-page":"65","volume-title":"Australasian Database Conference","author":"Ciaccia Paolo","year":"1999","unstructured":"Paolo Ciaccia , A. Nanni , and Marco Patella . A query-sensitive cost model for similarity queries with m-tree . In Australasian Database Conference , pages 65 -- 76 , 1999 . Paolo Ciaccia, A. Nanni, and Marco Patella. A query-sensitive cost model for similarity queries with m-tree. In Australasian Database Conference, pages 65--76, 1999."},{"key":"e_1_3_2_1_4_1","first-page":"918","volume-title":"VLDB","author":"Arasu Arvind","year":"2006","unstructured":"Arvind Arasu , Venkatesh Ganti , and Raghav Kaushik . Efficient exact set-similarity joins . In VLDB , pages 918 -- 929 , 2006 . Arvind Arasu, Venkatesh Ganti, and Raghav Kaushik. Efficient exact set-similarity joins. In VLDB, pages 918--929, 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"e_1_3_2_1_7_1","first-page":"303","volume-title":"VLDB","author":"Li Chen","year":"2007","unstructured":"Chen Li , Bin Wang , and Xiaochun Yang . Vgram : Improving performance of approximate queries on string collections using variable-length grams . In VLDB , pages 303 -- 314 , 2007 . Chen Li, Bin Wang, and Xiaochun Yang. Vgram: Improving performance of approximate queries on string collections using variable-length grams. In VLDB, pages 303--314, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376655"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989431"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0252-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796543"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082039"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240243"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216370.1216372"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89097-3_17"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp336"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/647891.739587"}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","acronym":"EDBT\/ICDT '13","location":"Genoa Italy"},"container-title":["Proceedings of the Joint EDBT\/ICDT 2013 Workshops"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457317.2457391","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2457317.2457391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:19:12Z","timestamp":1750234752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457317.2457391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":20,"alternative-id":["10.1145\/2457317.2457391","10.1145\/2457317"],"URL":"https:\/\/doi.org\/10.1145\/2457317.2457391","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}