{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:14:28Z","timestamp":1778807668554,"version":"3.51.4"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T00:00:00Z","timestamp":1582502400000},"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":["ACM SIGLOG News"],"published-print":{"date-parts":[[2020,2,24]]},"abstract":"<jats:p>This paper is the tutorial we wish we had had available when starting our own research on constant delay enumeration for conjunctive queries. It provides precise statements and detailed, self-contained proofs of the fundamental results in this area.<\/jats:p>","DOI":"10.1145\/3385634.3385636","type":"journal-article","created":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T21:19:35Z","timestamp":1582579175000},"page":"4-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Constant delay enumeration for conjunctive queries"],"prefix":"10.1145","volume":"7","author":[{"given":"Christoph","family":"Berkholz","sequence":"first","affiliation":[{"name":"Humboldt-Universit\u00e4t, zu Berlin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Gerhardt","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t, zu Berlin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"Schweikardt","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t, zu Berlin"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,2,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915213"},{"key":"e_1_2_1_3_1","unstructured":"Serge Abiteboul Richard Hull and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley. http:\/\/webdam.inria.fr\/Alice\/  Serge Abiteboul Richard Hull and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley. http:\/\/webdam.inria.fr\/Alice\/"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056105"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2018.5"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2019.22"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319702"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514909"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11874683\\_11"},{"key":"e_1_2_1_12_1","unstructured":"Guillaume Bagan. 2009. Algorithmes et complexit\u00e9 des probl\u00e8mes d'\u00e9num\u00e9ration pour l'\u00e9valuation de requ\u00eates logiques. (Algorithms and complexity of enumeration problems for the evaluation of logical queries). Ph.D. Dissertation. University of Caen Normandy France. https:\/\/tel.archives-ouvertes.fr\/tel-00424232  Guillaume Bagan. 2009. Algorithmes et complexit\u00e9 des probl\u00e8mes d'\u00e9num\u00e9ration pour l'\u00e9valuation de requ\u00eates logiques. (Algorithms and complexity of enumeration problems for the evaluation of logical queries). Ph.D. Dissertation. University of Caen Normandy France. https:\/\/tel.archives-ouvertes.fr\/tel-00424232"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74915-8_18"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322389"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034789"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232056"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2018.8"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.MFCS.2019.58"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210059"},{"key":"e_1_2_1_20_1","unstructured":"Johann Brault-Baron. 2013. De la pertinence de l'\u00e9num\u00e9ration : complexit\u00e9 en logiques propositionnelle et du premier ordre. (The relevance of the list: propositional logic and complexity of the first order). Ph.D. Dissertation. University of Caen Normandy France. https:\/\/tel.archives-ouvertes.fr\/tel-01081392  Johann Brault-Baron. 2013. De la pertinence de l'\u00e9num\u00e9ration : complexit\u00e9 en logiques propositionnelle et du premier ordre. (The relevance of the list: propositional logic and complexity of the first order). Ph.D. Dissertation. University of Caen Normandy France. https:\/\/tel.archives-ouvertes.fr\/tel-01081392"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983573"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.04.007"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.39"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238217"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265571"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196979"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276920.1276923"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594539"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Martin Charles Golumbic. 2004. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics Vol 57). North-Holland Publishing Co. Amsterdam The Netherlands The Netherlands.  Martin Charles Golumbic. 2004. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics Vol 57). North-Holland Publishing Co. Amsterdam The Netherlands The Netherlands.","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902309"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064027"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192966"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371316.3371325"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-7(2:20)2011"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2463667"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528928"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005133"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.80"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603137"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1721837.1721845"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535926"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180143"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209144"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196961"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656335"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402147"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196971"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448498"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2014.13"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783888.2783894"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2017.20"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2421119.2421134"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_2_1_59_1","volume-title":"Proc. 7th International Conference on Very Large Data Bases (VLDB 1981)","author":"Yannakakis Mihalis","year":"1981"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/CMPSAC.1979.762509"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077466"}],"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385634.3385636","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3385634.3385636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:49Z","timestamp":1750199569000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385634.3385636"}},"subtitle":["a tutorial"],"short-title":[],"issued":{"date-parts":[[2020,2,24]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2,24]]}},"alternative-id":["10.1145\/3385634.3385636"],"URL":"https:\/\/doi.org\/10.1145\/3385634.3385636","relation":{},"ISSN":["2372-3491"],"issn-type":[{"value":"2372-3491","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,24]]},"assertion":[{"value":"2020-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}