ACM SIGMOD Anthology DATA BASE dblp.uni-trier.de

Incrementalk View Maintenance in Object-Oriented Databases.

Reda Alhajj, Faruk Polat: Incrementalk View Maintenance in Object-Oriented Databases. DATA BASE 29(3): 52-64(1998)
@article{DBLP:journals/db/AlhajjP98,
  author    = {Reda Alhajj and
               Faruk Polat},
  title     = {Incrementalk View Maintenance in Object-Oriented Databases},
  journal   = {DATA BASE},
  volume    = {29},
  number    = {3},
  year      = {1998},
  pages     = {52-64},
  ee        = {db/journals/db/AlhajjP98.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

A database management system should support views to facilitate filtering of information in order to have only necessary and required information available to users with minimum delay. Although a lot of research efforts concentrated on views within the conventional relational model, much more effort is required when object-oriented models are considered. However, supporting views is only a step forward in achieving the purpose that requires improving the performance of the system by considering incremental maintenance of views instead of recomputing a view from scratch each time it is accessed. In this paper, we introduce a model that facilitates incremental maintenance of single-class-based object-oriented databases in general. For that purpose, we categorize classes into base and brother classes coresponding to classes originally present in the database and those introduced as views, respectively. To each class, we add a modification list that keeps related modifications during different intervals. An interval starts with the creation or update of a view and ends with the creation or update of another view. A modification list is empty as long as no views depend on its class. Further, we introduce some algorithms that locate modifications done on related classes while trying to compute a given view incrementally. Finally, we give a theoretical justification showing that, in general, the introduced algorithms perform much better than doing from scratch computation each time a view is accessed.

Copyright © 1998 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 4 Issue 3, DATA BASE" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX BibTeX
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
DATA BASE, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:56:00 2009