{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:32Z","timestamp":1750306352605,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T00:00:00Z","timestamp":1468800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GK METRIK"],"award-info":[{"award-number":["GK METRIK"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["BioBankCloud"],"award-info":[{"award-number":["BioBankCloud"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,18]]},"DOI":"10.1145\/2949689.2949694","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["PIEJoin"],"prefix":"10.1145","author":[{"given":"Anja","family":"Kunkel","sequence":"first","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Astrid","family":"Rheinl\u00e4nder","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Schiefer","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Helmer","sequence":"additional","affiliation":[{"name":"Free University of Bozen-Bolzano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Bouros","sequence":"additional","affiliation":[{"name":"Aarhus University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"Leser","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0895-7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581239"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/253168.253189"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645923.673667"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0106-0"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00063-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11408079_69"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113293"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872778"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1394399"},{"key":"e_1_3_2_1_14_1","first-page":"427","volume-title":"8th International Conference on Extending Database Technology","author":"Melnik S.","year":"2002","unstructured":"S. Melnik and H. Garcia-Molina . Divide-and-conquer algorithm for computing set containment joins. In Advances in Database Technology - EDBT 2002 , 8th International Conference on Extending Database Technology , Proceedings , pages 427 -- 444 , 2002 . S. Melnik and H. Garcia-Molina. Divide-and-conquer algorithm for computing set containment joins. In Advances in Database Technology - EDBT 2002, 8th International Conference on Extending Database Technology, Proceedings, pages 427--444, 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762474"},{"key":"e_1_3_2_1_16_1","first-page":"351","volume-title":"Proc. of the Int. Conf. on Very Large Databases","author":"Ramasamy K.","year":"2000","unstructured":"K. Ramasamy , J. M. Patel , J. F. Naughton , and R. Kaushik . Set containment joins: The good, the bad and the ugly . In Proc. of the Int. Conf. on Very Large Databases , pages 351 -- 362 , 2000 . K. Ramasamy, J. M. Patel, J. F. Naughton, and R. Kaushik. Set containment joins: The good, the bad and the ugly. In Proc. of the Int. Conf. on Very Large Databases, pages 351--362, 2000."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1979.11543"},{"key":"e_1_3_2_1_18_1","volume-title":"Object Relational DBMSs: The Next Great Wave","author":"Stonebraker M.","year":"1995","unstructured":"M. Stonebraker and D. Moore . Object Relational DBMSs: The Next Great Wave . Morgan Kaufmann Publishers Inc ., 1995 . M. Stonebraker and D. Moore. Object Relational DBMSs: The Next Great Wave. Morgan Kaufmann Publishers Inc., 1995."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39429-7_10"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502572"}],"event":{"name":"SSDBM '16: Conference on Scientific and Statistical Database Management","acronym":"SSDBM '16","location":"Budapest Hungary"},"container-title":["Proceedings of the 28th International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949689.2949694","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2949689.2949694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:00Z","timestamp":1750222560000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2949689.2949694"}},"subtitle":["Towards Parallel Set Containment Joins"],"short-title":[],"issued":{"date-parts":[[2016,7,18]]},"references-count":19,"alternative-id":["10.1145\/2949689.2949694","10.1145\/2949689"],"URL":"https:\/\/doi.org\/10.1145\/2949689.2949694","relation":{},"subject":[],"published":{"date-parts":[[2016,7,18]]},"assertion":[{"value":"2016-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}