{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:20Z","timestamp":1750221320422,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T00:00:00Z","timestamp":1509926400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502511,61602492"],"award-info":[{"award-number":["61502511,61602492"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,11,6]]},"DOI":"10.1145\/3132847.3133082","type":"proceedings-article","created":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T13:30:29Z","timestamp":1509975029000},"page":"2311-2314","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["SIMD-Based Multiple Sets Intersection with Dual-Scale Search Algorithm"],"prefix":"10.1145","author":[{"given":"Xingshen","family":"Song","sequence":"first","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"given":"Yuexiang","family":"Yang","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]},{"given":"Xiaoyong","family":"Li","sequence":"additional","affiliation":[{"name":"National University of Defense Technology, Changsha, China"}]}],"member":"320","published-online":{"date-parts":[[2017,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575832_2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Ricardo Baeza-Yates and Alejandro Salinger. 2010. Fast Intersection Algorithms for Sorted Sequences. Algorithms and Applications. 45--61 pages.   Ricardo Baeza-Yates and Alejandro Salinger. 2010. Fast Intersection Algorithms for Sorted Sequences. Algorithms and Applications. 45--61 pages.","DOI":"10.1007\/978-3-642-12476-1_3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_13"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1564507"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"J. Shane Culpepper and Alistair Moffat. 2007. Compact set representation for information retrieval SPIRE. 137--148.   J. Shane Culpepper and Alistair Moffat. 2007. Compact set representation for information retrieval SPIRE. 137--148.","DOI":"10.1007\/978-3-540-75530-2_13"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1877766.1877767"},{"key":"e_1_3_2_1_7_1","unstructured":"Erik D. Demaine and J. Ian Munro. 2000. Adaptive set intersections unions and differences SODA. 743--752.   Erik D. Demaine and J. Ian Munro. 2000. Adaptive set intersections unions and differences SODA. 743--752."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Erik D. Demaine Alejandro Pez-Ortiz and J. Ian Munro. 2001. Experiments on Adaptive Set Intersections for Text Retrieval Systems ALENEX@SODA. 91--104.   Erik D. Demaine Alejandro Pez-Ortiz and J. Ian Munro. 2001. Experiments on Adaptive Set Intersections for Text Retrieval Systems ALENEX@SODA. 91--104.","DOI":"10.1007\/3-540-44808-X_7"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1938545.1938550"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735518"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2326"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609615"},{"volume-title":"ALENEX@SODA","author":"Sanders Peter","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","unstructured":"Benjamin Schlegel Thomas Willhalm and Wolfgang Lehner. 2011. Fast Sorted-Set Intersection using SIMD Instructions. ADMS@VLDB. 1--8.  Benjamin Schlegel Thomas Willhalm and Wolfgang Lehner. 2011. Fast Sorted-Set Intersection using SIMD Instructions. ADMS@VLDB. 1--8."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484065"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"event":{"name":"CIKM '17: ACM Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Singapore Singapore","acronym":"CIKM '17"},"container-title":["Proceedings of the 2017 ACM on Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132847.3133082","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3132847.3133082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:52Z","timestamp":1750212832000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132847.3133082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,6]]},"references-count":16,"alternative-id":["10.1145\/3132847.3133082","10.1145\/3132847"],"URL":"https:\/\/doi.org\/10.1145\/3132847.3133082","relation":{},"subject":[],"published":{"date-parts":[[2017,11,6]]},"assertion":[{"value":"2017-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}