{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:09:59Z","timestamp":1762272599749,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":96,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["IIS-1762268"],"award-info":[{"award-number":["IIS-1762268"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3383132","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"2659-2665","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Optimal Join Algorithms Meet Top-k"],"prefix":"10.1145","author":[{"given":"Nikolaos","family":"Tziavelis","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]},{"given":"Wolfgang","family":"Gatterbauer","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]},{"given":"Mirek","family":"Riedewald","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Mahmoud Abo Khamis Ryan R. Curtin Benjamin Moseley Hung Q. Ngo Xu-anLong Nguyen Dan Olteanu and Maximilian Schleich. 2019. On Functional Aggregate Queries with Additive Inequalities. In PODS. 414--431. https:\/\/doi.org\/10.1145\/3294052.3319694  Mahmoud Abo Khamis Ryan R. Curtin Benjamin Moseley Hung Q. Ngo Xu-anLong Nguyen Dan Olteanu and Maximilian Schleich. 2019. On Functional Aggregate Queries with Additive Inequalities. In PODS. 414--431. https:\/\/doi.org\/10.1145\/3294052.3319694","DOI":"10.1145\/3294052.3319694"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Mahmoud Abo Khamis Hung Q Ngo XuanLong Nguyen Dan Olteanu and Maximilian Schleich. 2018. In-database learning with sparse tensors. In PODS. 325--340. https:\/\/doi.org\/10.1145\/3196959.3196960  Mahmoud Abo Khamis Hung Q Ngo XuanLong Nguyen Dan Olteanu and Maximilian Schleich. 2018. In-database learning with sparse tensors. In PODS. 325--340. https:\/\/doi.org\/10.1145\/3196959.3196960","DOI":"10.1145\/3196959.3196960"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Mahmoud Abo Khamis Hung Q Ngo and Atri Rudra. 2016. FAQ: questionsasked frequently. In PODS. 13--28. https:\/\/doi.org\/10.1145\/2902251.2902280  Mahmoud Abo Khamis Hung Q Ngo and Atri Rudra. 2016. FAQ: questionsasked frequently. In PODS. 13--28. https:\/\/doi.org\/10.1145\/2902251.2902280","DOI":"10.1145\/2902251.2902280"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Mahmoud Abo Khamis Hung Q. Ngo and Dan Suciu. 2016. Computing join queries with functional dependencies. In PODS. 327--342. https:\/\/doi.org\/10.1145\/2902251.2902289  Mahmoud Abo Khamis Hung Q. Ngo and Dan Suciu. 2016. Computing join queries with functional dependencies. In PODS. 327--342. https:\/\/doi.org\/10.1145\/2902251.2902289","DOI":"10.1145\/2902251.2902289"},{"key":"e_1_3_2_1_6_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 withone another?. In PODS. 429--444. https:\/\/doi.org\/10.1145\/3034786.3056105  Mahmoud Abo Khamis Hung Q Ngo and Dan Suciu. 2017. What do Shannon-type Inequalities Submodular Width and Disjunctive Datalog have to do withone another?. In PODS. 429--444. https:\/\/doi.org\/10.1145\/3034786.3056105","DOI":"10.1145\/3034786.3056105"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_3_2_1_8_1","volume-title":"International Workshop on Computer Science Logic (CSL). 208--222","author":"Bagan Guillaume","year":"2007","unstructured":"Guillaume Bagan , Arnaud Durand , and Etienne Grandjean . 2007 . On a cyclic conjunctive queries and constant delay enumeration . In International Workshop on Computer Science Logic (CSL). 208--222 . https:\/\/doi.org\/10.1007\/978--3--540--74915--8_18 Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. 2007. On a cyclic conjunctive queries and constant delay enumeration. In International Workshop on Computer Science Logic (CSL). 208--222. https:\/\/doi.org\/10.1007\/978--3--540--74915--8_18"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556579"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350242"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108044"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Christoph Berkholz Jens Keppeler and Nicole Schweikardt. 2017. Answering Conjunctive Queries Under Updates. In PODS. 303--318. https:\/\/doi.org\/10.1145\/3034786.3034789  Christoph Berkholz Jens Keppeler and Nicole Schweikardt. 2017. Answering Conjunctive Queries Under Updates. In PODS. 303--318. https:\/\/doi.org\/10.1145\/3034786.3034789","DOI":"10.1145\/3034786.3034789"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322238"},{"edition":"3","volume-title":"Dimitri P. Bertsekas. 2005.Dynamic Programming and Optimal Control","key":"e_1_3_2_1_14_1","unstructured":"Dimitri P. Bertsekas. 2005.Dynamic Programming and Optimal Control ( 3 rd ed.). Vol. I . Athena Scientific . http:\/\/www.athenasc.com\/dpbook.html Dimitri P. Bertsekas. 2005.Dynamic Programming and Optimal Control(3rd ed.). Vol. I. Athena Scientific. http:\/\/www.athenasc.com\/dpbook.html"},{"key":"e_1_3_2_1_15_1","unstructured":"Mark Boddy. 1991. Anytime Problem Solving Using Dynamic Programming. In AAAI. 738--743. http:\/\/dl.acm.org\/citation.cfm?id=1865756.1865791  Mark Boddy. 1991. Anytime Problem Solving Using Dynamic Programming. In AAAI. 738--743. http:\/\/dl.acm.org\/citation.cfm?id=1865756.1865791"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735486"},{"key":"e_1_3_2_1_17_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein .2009. Introduction to Algorithms ( 3 rd ed.). The MIT Press . https:\/\/dl.acm.org\/doi\/book\/10.5555\/1614191 Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.2009. Introduction to Algorithms(3rd ed.). The MIT Press. https:\/\/dl.acm.org\/doi\/book\/10.5555\/1614191","edition":"3"},{"volume-title":"Algorithms","author":"Dasgupta Sanjoy","key":"e_1_3_2_1_18_1","unstructured":"Sanjoy Dasgupta , Christos H Papadimitriou , and Umesh Virkumar Vazirani . 2008. Algorithms . McGraw-Hill Higher Education . https:\/\/dl.acm.org\/doi\/book\/10.5555\/1177299 Sanjoy Dasgupta, Christos H Papadimitriou, and Umesh Virkumar Vazirani. 2008. Algorithms. McGraw-Hill Higher Education. https:\/\/dl.acm.org\/doi\/book\/10.5555\/1177299"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90043-W"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Shaleen Deep and Paraschos Koutris. 2018. Compressed representations of conjunctive query results. In PODS. 307--322. https:\/\/doi.org\/10.1145\/3196959.3196979  Shaleen Deep and Paraschos Koutris. 2018. Compressed representations of conjunctive query results. In PODS. 307--322. https:\/\/doi.org\/10.1145\/3196959.3196979","DOI":"10.1145\/3196959.3196979"},{"key":"e_1_3_2_1_21_1","volume-title":"Ranked Enumeration of Conjunctive Query Results. CoRRabs\/1902.02698","author":"Deep Shaleen","year":"2019","unstructured":"Shaleen Deep and Paraschos Koutris . 2019. Ranked Enumeration of Conjunctive Query Results. CoRRabs\/1902.02698 ( 2019 ). http:\/\/arxiv.org\/abs\/1902.02698 Shaleen Deep and Paraschos Koutris. 2019. Ranked Enumeration of Conjunctive Query Results. CoRRabs\/1902.02698 (2019). http:\/\/arxiv.org\/abs\/1902.02698"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Maarten Van den Heuvel Peter Ivanov Wolfgang Gatterbauer Floris Geerts and Martin Theobald. 2019. Anytime Approximation in Probabilistic Databases via Scaled Dissociations. In SIGMOD. 1295--1312. https:\/\/doi.org\/10.1145\/3299869.3319900  Maarten Van den Heuvel Peter Ivanov Wolfgang Gatterbauer Floris Geerts and Martin Theobald. 2019. Anytime Approximation in Probabilistic Databases via Scaled Dissociations. In SIGMOD. 1295--1312. https:\/\/doi.org\/10.1145\/3299869.3319900","DOI":"10.1145\/3299869.3319900"},{"key":"e_1_3_2_1_23_1","volume-title":"An appraisal of some shortest-path algorithms. Operations research 17, 3","author":"Dreyfus Stuart E","year":"1969","unstructured":"Stuart E Dreyfus . 1969. An appraisal of some shortest-path algorithms. Operations research 17, 3 ( 1969 ), 395--412. https:\/\/doi.org\/10.1287\/opre.17.3.395 Stuart E Dreyfus. 1969. An appraisal of some shortest-path algorithms. Operations research 17, 3 (1969), 395--412. https:\/\/doi.org\/10.1287\/opre.17.3.395"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276920.1276923"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"volume-title":"k-Best Enumeration","author":"Eppstein David","key":"e_1_3_2_1_26_1","unstructured":"David Eppstein . 2016. k-Best Enumeration . Springer , Encyclopedia of Algorithms, 1003--1006. https:\/\/doi.org\/10.1007\/978--1--4939--2864--4_733 David Eppstein. 2016. k-Best Enumeration. Springer, Encyclopedia of Algorithms, 1003--1006. https:\/\/doi.org\/10.1007\/978--1--4939--2864--4_733"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Ronald Fagin. 1996. Combining fuzzy information from multiple systems. In PODS. 216--226. https:\/\/doi.org\/10.1145\/237661.237715  Ronald Fagin. 1996. Combining fuzzy information from multiple systems. In PODS. 216--226. https:\/\/doi.org\/10.1145\/237661.237715","DOI":"10.1145\/237661.237715"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Ronald Fagin. 1998. Fuzzy queries in multimedia database systems. In PODS. 1--10. https:\/\/doi.org\/10.1145\/275487.275488  Ronald Fagin. 1998. Fuzzy queries in multimedia database systems. In PODS. 1--10. https:\/\/doi.org\/10.1145\/275487.275488","DOI":"10.1145\/275487.275488"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1600"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Jonathan Finger and Neoklis Polyzotis. 2009. Robust and efficient algorithms for rank join evaluation. In SIGMOD. 415--428. https:\/\/doi.org\/10.1145\/1559845.1559890  Jonathan Finger and Neoklis Polyzotis. 2009. Robust and efficient algorithms for rank join evaluation. In SIGMOD. 415--428. https:\/\/doi.org\/10.1145\/1559845.1559890","DOI":"10.1145\/1559845.1559890"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0310-5"},{"key":"e_1_3_2_1_33_1","volume-title":"Hypertree Decompositions: Questions and Answers. In PODS. 57--74.https:\/\/doi.org\/10.1145\/2902251.2902309","author":"Gottlob Georg","year":"2016","unstructured":"Georg Gottlob , Gianluigi Greco , Nicola Leone , and Francesco Scarcello . 2016 . Hypertree Decompositions: Questions and Answers. In PODS. 57--74.https:\/\/doi.org\/10.1145\/2902251.2902309 Georg Gottlob, Gianluigi Greco, Nicola Leone, and Francesco Scarcello. 2016. Hypertree Decompositions: Questions and Answers. In PODS. 57--74.https:\/\/doi.org\/10.1145\/2902251.2902309"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.11.005"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2220357.2220363"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00030-8"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568320"},{"key":"e_1_3_2_1_39_1","volume-title":"Structural Tractability of Constraint Optimization. In International Conference on Principles and Practice of Constraint Programming (CP). 340--355","author":"Greco Gianluigi","year":"2011","unstructured":"Gianluigi Greco and Francesco Scarcello . 2011 . Structural Tractability of Constraint Optimization. In International Conference on Principles and Practice of Constraint Programming (CP). 340--355 .https:\/\/doi.org\/10.1007\/978--3--642--23786--7_27 Gianluigi Greco and Francesco Scarcello. 2011. Structural Tractability of Constraint Optimization. In International Conference on Principles and Practice of Constraint Programming (CP). 340--355.https:\/\/doi.org\/10.1007\/978--3--642--23786--7_27"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.11.004"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1090272"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"e_1_3_2_1_43_1","unstructured":"Ulrich G\u00fcntzer Wolf-Tilo Balke and Werner Kie\u00dfling. 2000. Optimizing multi-feature queries for image databases. InVLDB. 419--428. https:\/\/dl.acm.org\/doi\/10.5555\/645926.671875  Ulrich G\u00fcntzer Wolf-Tilo Balke and Werner Kie\u00dfling. 2000. Optimizing multi-feature queries for image databases. InVLDB. 419--428. https:\/\/dl.acm.org\/doi\/10.5555\/645926.671875"},{"key":"e_1_3_2_1_44_1","volume-title":"A Method for the Solution of the Nth Best Path Problem. J. ACM6, 4","author":"Hoffman Walter","year":"1959","unstructured":"Walter Hoffman and Richard Pavley . 1959. A Method for the Solution of the Nth Best Path Problem. J. ACM6, 4 ( 1959 ), 506--514. https:\/\/doi.org\/10.1145\/320998.321004 Walter Hoffman and Richard Pavley. 1959. A Method for the Solution of the Nth Best Path Problem. J. ACM6, 4 (1959), 506--514. https:\/\/doi.org\/10.1145\/320998.321004"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Aidan Hogan Cristian Riveros Carlos Rojas and Adri\u00e1n Soto. 2019. A Worst-Case Optimal Join Algorithm for SPARQL. In ISWC. 258--275. https:\/\/doi.org\/10.1007\/978--3-030--30793--6_15  Aidan Hogan Cristian Riveros Carlos Rojas and Adri\u00e1n Soto. 2019. A Worst-Case Optimal Join Algorithm for SPARQL. In ISWC. 258--275. https:\/\/doi.org\/10.1007\/978--3-030--30793--6_15","DOI":"10.1007\/978-3-030-30793-6_15"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371316.3371325"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00590-9"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0128-2"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189769.1189772"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_3_2_1_51_1","volume-title":"International Workshop on Algorithm Engineering (WAE). Springer, 15--29","author":"Jim\u00e9nez V\u00edctor M","year":"1999","unstructured":"V\u00edctor M Jim\u00e9nez and Andr\u00e9s Marzal . 1999 . Computing the k shortest paths:A new algorithm and an experimental comparison . In International Workshop on Algorithm Engineering (WAE). Springer, 15--29 . https:\/\/doi.org\/10.1007\/3--540--48318--7_4 V\u00edctor M Jim\u00e9nez and Andr\u00e9s Marzal. 1999. Computing the k shortest paths:A new algorithm and an experimental comparison. In International Workshop on Algorithm Engineering (WAE). Springer, 15--29. https:\/\/doi.org\/10.1007\/3--540--48318--7_4"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44867-5_14"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9811-8"},{"key":"e_1_3_2_1_54_1","unstructured":"Oren Kalinsky Yoav Etsion and Benny Kimelfeld. 2016. Flexible Caching in Trie Joins. In EDBT. 282--293. https:\/\/doi.org\/10.5441\/002\/edbt.2017.26  Oren Kalinsky Yoav Etsion and Benny Kimelfeld. 2016. Flexible Caching in Trie Joins. In EDBT. 282--293. https:\/\/doi.org\/10.5441\/002\/edbt.2017.26"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Oren Kalinsky Benny Kimelfeld and Yoav Etsion. 2020. The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins. In ASPLOS. 1217--1231. https:\/\/doi.org\/10.1145\/3373376.3378524  Oren Kalinsky Benny Kimelfeld and Yoav Etsion. 2020. The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins. In ASPLOS. 1217--1231. https:\/\/doi.org\/10.1145\/3373376.3378524","DOI":"10.1145\/3373376.3378524"},{"key":"e_1_3_2_1_56_1","first-page":"1","article-title":"Counting Triangles under Updates in Worst-Case Optimal Time","volume":"4","author":"Kara Ahmet","year":"2019","unstructured":"Ahmet Kara , Hung Q. Ngo , Milos Nikolic , Dan Olteanu , and Haozhe Zhang . 2019 . Counting Triangles under Updates in Worst-Case Optimal Time . In ICDT. 4 : 1 -- 4 :18. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2019.4 Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang. 2019. Counting Triangles under Updates in Worst-Case Optimal Time. In ICDT. 4:1--4:18. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2019.4","journal-title":"ICDT."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209889.3209896"},{"key":"e_1_3_2_1_58_1","first-page":"1","article-title":"Boolean Tensor Decomposition for Conjunctive Queries with Negation","volume":"21","author":"Khamis Mahmoud Abo","year":"2019","unstructured":"Mahmoud Abo Khamis , Hung Q. Ngo , Dan Olteanu , and Dan Suciu . 2019 . Boolean Tensor Decomposition for Conjunctive Queries with Negation . In ICDT. 21 : 1 -- 21 :19. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2019.21 Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, and Dan Suciu. 2019. Boolean Tensor Decomposition for Conjunctive Queries with Negation. In ICDT. 21:1--21:19. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2019.21","journal-title":"ICDT."},{"key":"e_1_3_2_1_59_1","volume-title":"Article 22","author":"Khamis Mahmoud Abo","year":"2016","unstructured":"Mahmoud Abo Khamis , Hung Q. Ngo , Christopher R\u00e9 , and Atri Rudra . 2016. Joins via Geometric Resolutions: Worst Case and Beyond. TODS 41, 4 , Article 22 ( 2016 ), 45 pages. https:\/\/doi.org\/10.1145\/2967101 Mahmoud Abo Khamis, Hung Q. Ngo, Christopher R\u00e9, and Atri Rudra. 2016. Joins via Geometric Resolutions: Worst Case and Beyond. TODS 41, 4, Article 22 (2016), 45 pages. https:\/\/doi.org\/10.1145\/2967101"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093754.3093757"},{"key":"e_1_3_2_1_61_1","volume-title":"Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. In International Workshop on Next Generation Information Technologies and Systems (NGITS). 141--152","author":"Kimelfeld Benny","year":"2006","unstructured":"Benny Kimelfeld and Yehoshua Sagiv . 2006 . Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. In International Workshop on Next Generation Information Technologies and Systems (NGITS). 141--152 . https:\/\/doi.org\/10.1007\/11780991_13 Benny Kimelfeld and Yehoshua Sagiv. 2006. Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries. In International Workshop on Next Generation Information Technologies and Systems (NGITS). 141--152. https:\/\/doi.org\/10.1007\/11780991_13"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Arun Kumar Jeffrey Naughton and Jignesh M Patel. 2015. Learning generalized linear models over normalized data. In SIGMOD. 1969--1984. https:\/\/doi.org\/10.1145\/2723372.2723713  Arun Kumar Jeffrey Naughton and Jignesh M Patel. 2015. Learning generalized linear models over normalized data. In SIGMOD. 1969--1984. https:\/\/doi.org\/10.1145\/2723372.2723713","DOI":"10.1145\/2723372.2723713"},{"key":"e_1_3_2_1_63_1","volume-title":"A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management science 18, 7","author":"Lawler Eugene L","year":"1972","unstructured":"Eugene L Lawler . 1972. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management science 18, 7 ( 1972 ), 401--405. https:\/\/doi.org\/10.1287\/mnsc.18.7.401 Eugene L Lawler. 1972. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management science 18, 7 (1972), 401--405. https:\/\/doi.org\/10.1287\/mnsc.18.7.401"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0485-2"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272743.1272749"},{"key":"e_1_3_2_1_66_1","first-page":"47","article-title":"A new improvement for a K shortest paths algorithm","volume":"21","author":"de Queir\u00f3s Vieira Martins Ernesto","year":"2001","unstructured":"Ernesto de Queir\u00f3s Vieira Martins , Marta Madalena Braz Pascoal , and Jos\u00e9Lu\u00eds Esteves Santos . 2001 . A new improvement for a K shortest paths algorithm . Investiga\u00e7\u00e3o Operacional 21 , 1 (2001), 47 -- 60 . http:\/\/apdio.pt\/documents\/10180\/15407\/IOvol21n1.pdf Ernesto de Queir\u00f3s Vieira Martins, Marta Madalena Braz Pascoal, and Jos\u00e9Lu\u00eds Esteves Santos. 2001. A new improvement for a K shortest paths algorithm. Investiga\u00e7\u00e3o Operacional 21, 1 (2001), 47--60. http:\/\/apdio.pt\/documents\/10180\/15407\/IOvol21n1.pdf","journal-title":"Investiga\u00e7\u00e3o Operacional"},{"key":"e_1_3_2_1_67_1","volume-title":"Article 42","author":"Marx D\u00e1niel","year":"2013","unstructured":"D\u00e1niel Marx . 2013. Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries. J. ACM60, 6 , Article 42 ( 2013 ), 51 pages. https:\/\/doi.org\/10.1145\/2535926 D\u00e1niel Marx. 2013. Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries. J. ACM60, 6, Article 42 (2013), 51 pages. https:\/\/doi.org\/10.1145\/2535926"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137826"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"crossref","unstructured":"Barzan Mozafari. 2017. Approximate Query Engines: Commercial Challenges and Research Opportunities. In SIGMOD. 521--524. https:\/\/doi.org\/10.1145\/3035918.3056098  Barzan Mozafari. 2017. Approximate Query Engines: Commercial Challenges and Research Opportunities. In SIGMOD. 521--524. https:\/\/doi.org\/10.1145\/3035918.3056098","DOI":"10.1145\/3035918.3056098"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.682"},{"key":"e_1_3_2_1_71_1","unstructured":"Apostol Natsev Yuan-Chi Chang John R Smith Chung-Sheng Li and Jeffrey Scott Vitter. 2001. Supporting incremental join queries on ranked inputs. In VLDB. 281--290. http:\/\/www.vldb.org\/conf\/2001\/P281.pdf  Apostol Natsev Yuan-Chi Chang John R Smith Chung-Sheng Li and Jeffrey Scott Vitter. 2001. Supporting incremental join queries on ranked inputs. In VLDB. 281--290. http:\/\/www.vldb.org\/conf\/2001\/P281.pdf"},{"key":"e_1_3_2_1_72_1","unstructured":"Gonzalo Navarro Juan L Reutter and Javiel Rojas-Ledesma. 2020. Optimal Joins using Compact Data Structures. In ICDT. https:\/\/arxiv.org\/abs\/1908.01812  Gonzalo Navarro Juan L Reutter and Javiel Rojas-Ledesma. 2020. Optimal Joins using Compact Data Structures. In ICDT. https:\/\/arxiv.org\/abs\/1908.01812"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"crossref","unstructured":"Surya Nepal and M. V. Ramakrishna. 1999. Query processing issues in image (multimedia) databases. In ICDE. 22--29. https:\/\/doi.org\/10.1109\/ICDE.1999.754894  Surya Nepal and M. V. Ramakrishna. 1999. Query processing issues in image (multimedia) databases. In ICDE. 22--29. https:\/\/doi.org\/10.1109\/ICDE.1999.754894","DOI":"10.1109\/ICDE.1999.754894"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"crossref","unstructured":"Hung Q Ngo. 2018. Worst-case optimal join algorithms: Techniques results and open problems. In PODS. 111--124. https:\/\/doi.org\/10.1145\/3196959.3196990  Hung Q Ngo. 2018. Worst-case optimal join algorithms: Techniques results and open problems. In PODS. 111--124. https:\/\/doi.org\/10.1145\/3196959.3196990","DOI":"10.1145\/3196959.3196990"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Hung Q Ngo Dung T Nguyen Christopher Re and Atri Rudra. 2014. Beyond worst-case analysis for joins with minesweeper. In PODS. 234--245. https:\/\/doi.org\/10.1145\/2594538.2594547  Hung Q Ngo Dung T Nguyen Christopher Re and Atri Rudra. 2014. Beyond worst-case analysis for joins with minesweeper. In PODS. 234--245. https:\/\/doi.org\/10.1145\/2594538.2594547","DOI":"10.1145\/2594538.2594547"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"crossref","unstructured":"Hung Q. Ngo Ely Porat Christopher R\u00e9 and Atri Rudra. 2012. Worst-case Optimal Join Algorithms: [Extended Abstract]. In PODS. 37--48. https:\/\/doi.org\/10.1145\/2213556.2213565  Hung Q. Ngo Ely Porat Christopher R\u00e9 and Atri Rudra. 2012. Worst-case Optimal Join Algorithms: [Extended Abstract]. In PODS. 37--48. https:\/\/doi.org\/10.1145\/2213556.2213565","DOI":"10.1145\/2213556.2213565"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180143"},{"key":"e_1_3_2_1_78_1","first-page":"4","article-title":"Skew Strikes Back","volume":"42","author":"Ngo Hung Q","year":"2014","unstructured":"Hung Q Ngo , Christopher R\u00e9 , and Atri Rudra . 2014 . Skew Strikes Back : New Developments in the Theory of Join Algorithms. SIGMOD Rec. 42 , 4 (Feb. 2014), 5--16. https:\/\/doi.org\/10.1145\/2590989.2590991 Hung Q Ngo, Christopher R\u00e9, and Atri Rudra. 2014. Skew Strikes Back: New Developments in the Theory of Join Algorithms. SIGMOD Rec. 42, 4 (Feb. 2014), 5--16. https:\/\/doi.org\/10.1145\/2590989.2590991","journal-title":"New Developments in the Theory of Join Algorithms. SIGMOD Rec."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007312"},{"key":"e_1_3_2_1_80_1","volume-title":"Factorized databases. SIGMOD Record 45, 2","author":"Olteanu Dan","year":"2016","unstructured":"Dan Olteanu and Maximilian Schleich . 2016. Factorized databases. SIGMOD Record 45, 2 ( 2016 ). https:\/\/doi.org\/10.1145\/3003665.3003667 Dan Olteanu and Maximilian Schleich. 2016. Factorized databases. SIGMOD Record 45, 2 (2016). https:\/\/doi.org\/10.1145\/3003665.3003667"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"crossref","unstructured":"Dan Olteanu and Jakub Z\u00e1vodny. 2012. Factorised representations of query results: size bounds and readability. In ICDT. 285--298.https:\/\/doi.org\/10.1145\/2274576.2274607  Dan Olteanu and Jakub Z\u00e1vodny. 2012. Factorised representations of query results: size bounds and readability. In ICDT. 285--298.https:\/\/doi.org\/10.1145\/2274576.2274607","DOI":"10.1145\/2274576.2274607"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656335"},{"key":"e_1_3_2_1_83_1","volume-title":"A Guide to Designing Top-k Indexes. SIGMOD Record 48, 2","author":"Rahul Saladi","year":"2019","unstructured":"Saladi Rahul and Yufei Tao . 2019. A Guide to Designing Top-k Indexes. SIGMOD Record 48, 2 ( 2019 ). https:\/\/doi.org\/10.1145\/3377330.3377332 Saladi Rahul and Yufei Tao. 2019. A Guide to Designing Top-k Indexes. SIGMOD Record 48, 2 (2019). https:\/\/doi.org\/10.1145\/3377330.3377332"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35514-2_32"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"crossref","unstructured":"Maximilian Schleich Dan Olteanu and Radu Ciucanu. 2016. Learning linear regression models over factorized joins. In SIGMOD. 3--18. https:\/\/doi.org\/10.1145\/2882903.2882939  Maximilian Schleich Dan Olteanu and Radu Ciucanu. 2016. Learning linear regression models over factorized joins. In SIGMOD. 3--18. https:\/\/doi.org\/10.1145\/2882903.2882939","DOI":"10.1145\/2882903.2882939"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"crossref","unstructured":"Karl Schnaitter and Neoklis Polyzotis. 2008. Evaluating rank joins with optimal cost. In PODS. 43--52. https:\/\/doi.org\/10.1145\/1376916.1376924  Karl Schnaitter and Neoklis Polyzotis. 2008. Evaluating rank joins with optimal cost. In PODS. 43--52. https:\/\/doi.org\/10.1145\/1376916.1376924","DOI":"10.1145\/1376916.1376924"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0124-z"},{"key":"e_1_3_2_1_89_1","volume-title":"Constant Delay Enumeration for Conjunctive Queries. SIG-MOD record 44, 1","author":"Segoufin Luc","year":"2015","unstructured":"Luc Segoufin . 2015. Constant Delay Enumeration for Conjunctive Queries. SIG-MOD record 44, 1 ( 2015 ), 10--17. https:\/\/doi.org\/10.1145\/2783888.2783894 Luc Segoufin. 2015. Constant Delay Enumeration for Conjunctive Queries. SIG-MOD record 44, 1 (2015), 10--17. https:\/\/doi.org\/10.1145\/2783888.2783894"},{"key":"e_1_3_2_1_90_1","volume-title":"Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. CoRRabs\/1902.02698","author":"Tziavelis Nikolaos","year":"2019","unstructured":"Nikolaos Tziavelis , Deepak Ajwani , Wolfgang Gatterbauer , Mirek Riedewald , and Xiaofeng Yang . 2019. Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. CoRRabs\/1902.02698 ( 2019 ). https:\/\/arxiv.org\/abs\/1911.05582 Nikolaos Tziavelis, Deepak Ajwani, Wolfgang Gatterbauer, Mirek Riedewald, and Xiaofeng Yang. 2019. Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. CoRRabs\/1902.02698 (2019). https:\/\/arxiv.org\/abs\/1911.05582"},{"key":"e_1_3_2_1_91_1","volume-title":"Triejoin: A Simple, Worst-Case Optimal Join Algorithm. In ICDT. 96--106. https:\/\/doi.org\/10.5441\/002\/icdt.2014.13","author":"Veldhuizen Todd L.","year":"2014","unstructured":"Todd L. Veldhuizen . 2014 . Triejoin: A Simple, Worst-Case Optimal Join Algorithm. In ICDT. 96--106. https:\/\/doi.org\/10.5441\/002\/icdt.2014.13 Todd L. Veldhuizen. 2014. Triejoin: A Simple, Worst-Case Optimal Join Algorithm. In ICDT. 96--106. https:\/\/doi.org\/10.5441\/002\/icdt.2014.13"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920951"},{"key":"e_1_3_2_1_93_1","volume-title":"Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs. In WWW. 489--498. https:\/\/doi.org\/10.1145\/3178876.3186115","author":"Yang Xiaofeng","year":"2018","unstructured":"Xiaofeng Yang , Deepak Ajwani , Wolfgang Gatterbauer , Patrick K Nicholson , Mirek Riedewald , and Alessandra Sala . 2018 . Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs. In WWW. 489--498. https:\/\/doi.org\/10.1145\/3178876.3186115 Xiaofeng Yang, Deepak Ajwani, Wolfgang Gatterbauer, Patrick K Nicholson, Mirek Riedewald, and Alessandra Sala. 2018. Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs. In WWW. 489--498. https:\/\/doi.org\/10.1145\/3178876.3186115"},{"key":"e_1_3_2_1_94_1","volume-title":"Any-k Algorithms for Exploratory Analysis with Conjunctive Queries. In International Workshop on Exploratory Search in Databases and the Web (Explore DB). 1--3. https:\/\/doi.org\/10","author":"Yang Xiaofeng","year":"2018","unstructured":"Xiaofeng Yang , Mirek Riedewald , Rundong Li , and Wolfgang Gatterbauer . 2018 . Any-k Algorithms for Exploratory Analysis with Conjunctive Queries. In International Workshop on Exploratory Search in Databases and the Web (Explore DB). 1--3. https:\/\/doi.org\/10 .1145\/3214708.3214711 Xiaofeng Yang, Mirek Riedewald, Rundong Li, and Wolfgang Gatterbauer. 2018. Any-k Algorithms for Exploratory Analysis with Conjunctive Queries. In International Workshop on Exploratory Search in Databases and the Web (Explore DB). 1--3. https:\/\/doi.org\/10.1145\/3214708.3214711"},{"key":"e_1_3_2_1_95_1","unstructured":"Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In VLDB. 82--94. https:\/\/dl.acm.org\/doi\/10.5555\/1286831.1286840  Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In VLDB. 82--94. https:\/\/dl.acm.org\/doi\/10.5555\/1286831.1286840"},{"key":"e_1_3_2_1_96_1","first-page":"73","article-title":"Using Anytime Algorithms in Intelligent Systems","volume":"17","author":"Zilberstein Shlomo","year":"1996","unstructured":"Shlomo Zilberstein . 1996 . Using Anytime Algorithms in Intelligent Systems . AI Magazine 17 , 3 (1996), 73 -- 83 . http:\/\/rbr.cs.umass.edu\/shlomo\/papers\/Zaimag96.html Shlomo Zilberstein. 1996. Using Anytime Algorithms in Intelligent Systems. AI Magazine 17, 3 (1996), 73--83. http:\/\/rbr.cs.umass.edu\/shlomo\/papers\/Zaimag96.html","journal-title":"AI Magazine"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Portland OR USA","acronym":"SIGMOD\/PODS '20"},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3383132","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3383132","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3383132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:23Z","timestamp":1750199903000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3383132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":96,"alternative-id":["10.1145\/3318464.3383132","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3383132","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}