{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:57Z","timestamp":1750220697772,"version":"3.41.0"},"reference-count":0,"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 column concerns the complexity of evaluating database queries. In particular, for which conjunctive queries can we, after linear preprocessing, enumerate the query answer with only constant delay between entries? There is a beautiful answer, plus some lower bounds, extensions to dynamic databases and more.<\/jats:p>\n          <jats:p>I thank Christoph Berkholz, Fabian Gerhardt and Nicole Schweikardt for their clearly written tutorial. It is a wonderful, self-contained introduction to this area.<\/jats:p>","DOI":"10.1145\/3385634.3385635","type":"journal-article","created":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T21:19:35Z","timestamp":1582579175000},"page":"3-3","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity column"],"prefix":"10.1145","volume":"7","author":[{"given":"Neil","family":"Immerman","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,2,24]]},"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385634.3385635","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"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.3385635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,24]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2,24]]}},"alternative-id":["10.1145\/3385634.3385635"],"URL":"https:\/\/doi.org\/10.1145\/3385634.3385635","relation":{},"ISSN":["2372-3491"],"issn-type":[{"type":"electronic","value":"2372-3491"}],"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"}}]}}