{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:17Z","timestamp":1725544877774},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We propose an algorithm called CReaM to incrementally maintain materialized aggregate views with user-defined aggregates in response to changes to the database tables from which the views are derived. We show that when the physical design of the underlying database is optimized, the time taken by CReaM to update an aggregate view is optimal.<\/jats:p>","DOI":"10.29007\/zw67","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:02:53Z","timestamp":1516730573000},"page":"88-78","source":"Crossref","is-referenced-by-count":0,"title":["An Incremental Algorithm to Optimally Maintain Aggregate Views"],"prefix":"10.29007","volume":"26","author":[{"given":"Abhijeet","family":"Mohapatra","sequence":"first","affiliation":[]},{"given":"Michael","family":"Genesereth","sequence":"additional","affiliation":[]}],"member":"11545","event":{"name":"LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:04:56Z","timestamp":1516730696000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/fNs8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/zw67","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}