乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:19:47Z","timestamp":1740100787286,"version":"3.37.3"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","funder":[{"name":"EPSRC iCASE","award":["17000156"]},{"DOI":"10.13039\/100018693","name":"Horizon Europe","doi-asserted-by":"publisher","award":["682588"],"id":[{"id":"10.13039\/100018693","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3517804.3524156","type":"proceedings-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:29:54Z","timestamp":1655126994000},"page":"53-65","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of Boolean Conjunctive Queries with Intersection Joins"],"prefix":"10.1145","author":[{"given":"Mahmoud","family":"Abo Khamis","sequence":"first","affiliation":[{"name":"RelationalAI, Berkeley, CA, USA"}]},{"given":"George","family":"Chichirim","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]},{"given":"Antonia","family":"Kormpa","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}]},{"given":"Dan","family":"Olteanu","sequence":"additional","affiliation":[{"name":"University of Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"volume-title":"Foundations of Databases","author":"Abiteboul Serge","key":"e_1_3_2_2_1_1","unstructured":"Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of Databases . Addison-Wesley . Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases .Addison-Wesley."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3426865"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967101"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Mahmoud Abo Khamis Hung Q. Ngo and Dan Suciu. 2017. What Do Shannon-type Inequalities Submodular Width and Disjunctive Datalog Have to Do with One Another?. In PODS. 429--444. Mahmoud Abo Khamis Hung Q. Ngo and Dan Suciu. 2017. What Do Shannon-type Inequalities Submodular Width and Disjunctive Datalog Have to Do with One Another?. In PODS. 429--444.","DOI":"10.1145\/3034786.3056105"},{"key":"e_1_3_2_2_5_1","unstructured":"Lars Arge Octavian Procopiuc Sridhar Ramaswamy Torsten Suel and Jeffrey Scott Vitter. 1998. Scalable Sweeping-Based Spatial Join. In VLDB. 570--581. Lars Arge Octavian Procopiuc Sridhar Ramaswamy Torsten Suel and Jeffrey Scott Vitter. 1998. Scalable Sweeping-Based Spatial Join. In VLDB. 570--581."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137644"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983573"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Thomas Brinkhoff Hans-Peter Kriegel and Bernhard Seeger. 1993. Efficient Processing of Spatial Joins Using R-Trees. In SIGMOD. 237--246. Thomas Brinkhoff Hans-Peter Kriegel and Bernhard Seeger. 1993. Efficient Processing of Spatial Joins Using R-Trees. In SIGMOD. 237--246.","DOI":"10.1145\/170036.170075"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Jost Enderle Matthias Hampel and Thomas Seidl. 2004. Joining Interval Data in Relational Databases. In SIGMOD. 683--694. Jost Enderle Matthias Hampel and Thomas Seidl. 2004. Joining Interval Data in Relational Databases. In SIGMOD. 683--694.","DOI":"10.1145\/1007568.1007645"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322390"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0111-3"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3311967"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206049.1206056"},{"key":"e_1_3_2_2_14_1","volume-title":"The Complexity of Boolean Conjunctive Queries with Intersection Joins. CoRR","author":"Khamis Mahmoud Abo","year":"2021","unstructured":"Mahmoud Abo Khamis , George Chichirim , Antonia Kormpa , and Dan Olteanu . 2021. The Complexity of Boolean Conjunctive Queries with Intersection Joins. CoRR , Vol. abs\/ 2106 .13342 ( 2021 ). https:\/\/arxiv.org\/abs\/2106.13342 Mahmoud Abo Khamis, George Chichirim, Antonia Kormpa, and Dan Olteanu. 2021. The Complexity of Boolean Conjunctive Queries with Intersection Joins. CoRR, Vol. abs\/2106.13342 (2021). https:\/\/arxiv.org\/abs\/2106.13342"},{"key":"e_1_3_2_2_15_1","volume-title":"Sevcik","author":"Koudas Nick","year":"1997","unstructured":"Nick Koudas and Kenneth C . Sevcik . 1997 . Size Separation Spatial Join. In SIGMOD. 324--335. Nick Koudas and Kenneth C. Sevcik. 1997. Size Separation Spatial Join. In SIGMOD. 324--335."},{"key":"e_1_3_2_2_16_1","volume-title":"Ravishankar","author":"Lo Ming-Ling","year":"1994","unstructured":"Ming-Ling Lo and Chinya V . Ravishankar . 1994 . Spatial Joins Using Seeded Trees. In SIGMOD. 209--220. Ming-Ling Lo and Chinya V. Ravishankar. 1994. Spatial Joins Using Seeded Trees. In SIGMOD. 209--220."},{"key":"e_1_3_2_2_17_1","volume-title":"Ravishankar","author":"Lo Ming-Ling","year":"1996","unstructured":"Ming-Ling Lo and Chinya V . Ravishankar . 1996 . Spatial Hash-Joins. In SIGMOD. 247--258. Ming-Ling Lo and Chinya V. Ravishankar. 1996. Spatial Hash-Joins. In SIGMOD. 247--258."},{"volume-title":"Spatial Data Management","author":"Mamoulis Nikos","key":"e_1_3_2_2_18_1","unstructured":"Nikos Mamoulis . 2011. Spatial Data Management . Morgan & Claypool Publishers . Nikos Mamoulis. 2011. Spatial Data Management .Morgan & Claypool Publishers."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/503099.503101"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1161591"},{"key":"e_1_3_2_2_21_1","article-title":"Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries","volume":"60","author":"el Marx D\u00e1","year":"2013","unstructured":"D\u00e1 ni el Marx . 2013 . Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries . J. ACM , Vol. 60 , 6 (2013), 42:1--42:51. D\u00e1 niel Marx. 2013. Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries. J. ACM, Vol. 60, 6 (2013), 42:1--42:51.","journal-title":"J. ACM"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180143"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_3_2_2_24_1","volume-title":"DeWitt","author":"Patel Jignesh M.","year":"1996","unstructured":"Jignesh M. Patel and David J . DeWitt . 1996 . Partition Based Spatial-Merge Join. In SIGMOD. 259--270. Jignesh M. Patel and David J. DeWitt. 1996. Partition Based Spatial-Merge Join. In SIGMOD. 259--270."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Mihai Patrascu. 2010. Towards polynomial lower bounds for dynamic problems. In STOC. 603--610. Mihai Patrascu. 2010. Towards polynomial lower bounds for dynamic problems. In STOC. 603--610.","DOI":"10.1145\/1806689.1806772"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Danila Piatov Sven Helmer and Anton Dign\u00f6 s. 2016. An interval join optimized for modern hardware. In ICDE. 1098--1109. Danila Piatov Sven Helmer and Anton Dign\u00f6 s. 2016. An interval join optimized for modern hardware. In ICDE. 1098--1109.","DOI":"10.1109\/ICDE.2016.7498316"},{"volume-title":"Computational geometry: an introduction","author":"Preparata Franco P","key":"e_1_3_2_2_27_1","unstructured":"Franco P Preparata and Michael I Shamos . 2012. Computational geometry: an introduction . Springer Science & Business Media . Franco P Preparata and Michael I Shamos. 2012. Computational geometry: an introduction .Springer Science & Business Media."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Dimitrios Tsitsigkos Panagiotis Bouros Nikos Mamoulis and Manolis Terrovitis. 2019. Parallel In-Memory Evaluation of Spatial Joins. In SIGSPATIAL. 516--519. Dimitrios Tsitsigkos Panagiotis Bouros Nikos Mamoulis and Manolis Terrovitis. 2019. Parallel In-Memory Evaluation of Spatial Joins. In SIGSPATIAL. 516--519.","DOI":"10.1145\/3347146.3359343"},{"key":"e_1_3_2_2_29_1","unstructured":"Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In VLDB. 82--94. Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In VLDB. 82--94."}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517804.3524156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T20:03:17Z","timestamp":1688068997000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":29,"alternative-id":["10.1145\/3517804.3524156","10.1145\/3517804"],"URL":"https:\/\/doi.org\/10.1145\/3517804.3524156","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}