An Incremental Algorithm to Optimally Maintain Aggregate Views

9 pages•Published: July 28, 2014

Abhijeet Mohapatra and Michael Genesereth

Abstract

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.

Keyphrases: aggregate views, database update, incremental algorithm, view maintenance

In: Ken Mcmillan, Aart Middeldorp, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 26, pages 88-96.

Links:	https://easychair.org/publications/paper/fNs8
	https://doi.org/10.29007/zw67

BibTeX entry

@inproceedings{LPAR-19:Incremental_Algorithm_Optimally_Maintain,
  author    = {Abhijeet Mohapatra and Michael Genesereth},
  title     = {An Incremental Algorithm to Optimally Maintain Aggregate Views},
  booktitle = {LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Ken Mcmillan and Aart Middeldorp and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {26},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/fNs8},
  doi       = {10.29007/zw67},
  pages     = {88-96},
  year      = {2014}}

Download PDF Open PDF in browser