{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:35:23Z","timestamp":1780346123218,"version":"3.54.1"},"reference-count":58,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1109\/icde53745.2022.00299","type":"proceedings-article","created":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T23:18:41Z","timestamp":1659482321000},"page":"3205-3208","source":"Crossref","is-referenced-by-count":7,"title":["Toward Responsive DBMS: Optimal Join Algorithms, Enumeration, Factorization, Ranking, and Dynamic Programming"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8342-2177","authenticated-orcid":false,"given":"Nikolaos","family":"Tziavelis","sequence":"first","affiliation":[{"name":"Northeastern University,Boston,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9614-0504","authenticated-orcid":false,"given":"Wolfgang","family":"Gatterbauer","sequence":"additional","affiliation":[{"name":"Northeastern University,Boston,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6102-7472","authenticated-orcid":false,"given":"Mirek","family":"Riedewald","sequence":"additional","affiliation":[{"name":"Northeastern University,Boston,USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"5:1","article-title":"Ranked enumeration of conjunctive query results","volume":"186","author":"deep","year":"0","journal-title":"ICDT"},{"key":"ref38","article-title":"Ranked enumeration of MSO logic on words","volume":"abs 2010 8042","author":"bourhis","year":"2020","journal-title":"CoRR"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196990"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2535926"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/16M1090272"},{"key":"ref37","first-page":"96","article-title":"Triejoin: A simple, worst-case optimal join algorithm","author":"veldhuizen","year":"0","journal-title":"ICDT"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"ref35","first-page":"21:1","article-title":"Optimal Joins Using Compact Data Structures","volume":"155","author":"navarro","year":"0","journal-title":"ICDT"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568320"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00030-8"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.11.004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3003665.3003667"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74915-8_18"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319700"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3371316.3371325"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034789"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-019-09937-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"ref50","article-title":"Optimal algorithms for ranked enumeration of answers to full conjunctive queries","volume":"abs 1911 5582","author":"tziavelis","year":"2019","journal-title":"CoRR"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2656335"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137826"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3377330.3377332"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387662"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3452021.3458331"},{"key":"ref53","first-page":"21:1","article-title":"Boolean tensor decomposition for conjunctive queries with negation","author":"khamis","year":"0","journal-title":"ICDT"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3426865"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3383132"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/11780991_13"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/256303.256306"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902280"},{"key":"ref14","author":"bertele","year":"1972","journal-title":"Nonserial Dynamic Programming"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"key":"ref16","first-page":"321","article-title":"Semiring frameworks and algorithms for shortest-distance problems","volume":"7","author":"mohri","year":"2002","journal-title":"J Autom Lang Comb"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265535"},{"key":"ref18","author":"gondran","year":"2008","journal-title":"Graphs Dioids and Semirings New Models and Algorithms (Operations Research\/Computer Science Interfaces Series)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322238"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397250"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3180143"},{"key":"ref5","first-page":"82","article-title":"Algorithms for acyclic database schemes","author":"yannakakis","year":"0","journal-title":"VLDB"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476306"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3385634.3385636"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48318-7_4"},{"key":"ref9","volume":"60","author":"bellman","year":"1954","journal-title":"The Theory of Dynamic Programming"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.682"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.7.401"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735486"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3214708.3214711"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186115"},{"key":"ref44","first-page":"73","article-title":"Using anytime algorithms in intelligent systems","volume":"17","author":"zilberstein","year":"1996","journal-title":"AI Magazine"},{"key":"ref43","article-title":"Progressive join algorithms considering user preference","author":"ding","year":"0","journal-title":"CIDR"}],"event":{"name":"2022 IEEE 38th International Conference on Data Engineering (ICDE)","location":"Kuala Lumpur, Malaysia","start":{"date-parts":[[2022,5,9]]},"end":{"date-parts":[[2022,5,12]]}},"container-title":["2022 IEEE 38th International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9835153\/9835154\/09835500.pdf?arnumber=9835500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T20:04:00Z","timestamp":1661198640000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9835500\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":58,"URL":"https:\/\/doi.org\/10.1109\/icde53745.2022.00299","relation":{},"subject":[],"published":{"date-parts":[[2022,5]]}}}