{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T19:48:27Z","timestamp":1759693707251,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,28]],"date-time":"2013-07-28T00:00:00Z","timestamp":1374969600000},"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,7,28]]},"DOI":"10.1145\/2484028.2484065","type":"proceedings-article","created":{"date-parts":[[2013,7,30]],"date-time":"2013-07-30T13:40:50Z","timestamp":1375191650000},"page":"703-712","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Faster upper bounding of intersection sizes"],"prefix":"10.1145","author":[{"given":"Daisuke","family":"Takuma","sequence":"first","affiliation":[{"name":"IBM Research - Tokyo, Tokyo, Japan"}]},{"given":"Hiroki","family":"Yanagisawa","sequence":"additional","affiliation":[{"name":"IBM Research - Tokyo, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2013,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"National Highway Traffic Safety Administration. http:\/\/www.nhtsa.gov\/.  National Highway Traffic Safety Administration. http:\/\/www.nhtsa.gov\/."},{"key":"e_1_3_2_1_2_1","first-page":"487","volume-title":"VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules . In VLDB , pages 487 -- 499 , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, pages 487--499, 1994."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2011.03.010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_30"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_13"},{"key":"e_1_3_2_1_6_1","first-page":"475","volume-title":"VLDB","author":"Bast H.","year":"2006","unstructured":"H. Bast , D. Majumdar , R. Schenkel , M. Theobald , and G. Weikum . Io-top-k: Index-access optimized top-k query processing . In VLDB , pages 475 -- 486 , 2006 . H. Bast, D. Majumdar, R. Schenkel, M. Theobald, and G. Weikum. Io-top-k: Index-access optimized top-k query processing. In VLDB, pages 475--486, 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562764.1562787"},{"key":"e_1_3_2_1_8_1","first-page":"739","volume-title":"ISAAC","author":"Bille P.","year":"2007","unstructured":"P. Bille , A. Pagh , and R. Pagh . Fast evaluation of union-intersection expressions . In ISAAC , pages 739 -- 750 , 2007 . P. Bille, A. Pagh, and R. Pagh. Fast evaluation of union-intersection expressions. In ISAAC, pages 739--750, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277660"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/322123.322127"},{"key":"e_1_3_2_1_12_1","first-page":"743","volume-title":"SODA","author":"Demaine E. D.","year":"2000","unstructured":"E. D. Demaine , A. L\u00f3pez-Ortiz , and J. I. Munro . Adaptive set intersections, unions, and differences . In SODA , pages 743 -- 752 , 2000 . E. D. Demaine, A. L\u00f3pez-Ortiz, and J. I. Munro. Adaptive set intersections, unions, and differences. In SODA, pages 743--752, 2000."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1938545.1938550"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201004"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497512"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972900.8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-010-7067-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453929"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572104"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687722"},{"key":"e_1_3_2_1_23_1","unstructured":"H. S. Warren. Hacker's Delight. Addison-Wesley Professional 2002.   H. S. Warren. Hacker's Delight. Addison-Wesley Professional 2002."}],"event":{"name":"SIGIR '13: The 36th International ACM SIGIR conference on research and development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Dublin Ireland","acronym":"SIGIR '13"},"container-title":["Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484028.2484065","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2484028.2484065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:33Z","timestamp":1750235973000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484028.2484065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,28]]},"references-count":23,"alternative-id":["10.1145\/2484028.2484065","10.1145\/2484028"],"URL":"https:\/\/doi.org\/10.1145\/2484028.2484065","relation":{},"subject":[],"published":{"date-parts":[[2013,7,28]]},"assertion":[{"value":"2013-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}