ACM Home Page
Please provide us with feedback. Feedback
Maintaining views incrementally
Full text PdfPdf (1.00 MB)
Source International Conference on Management of Data archive
Proceedings of the 1993 ACM SIGMOD international conference on Management of data table of contents
Washington, D.C., United States
Pages: 157 - 166  
Year of Publication: 1993
ISBN:0-89791-592-5
Also published in ...
Authors
Ashish Gupta  Stanford University
Inderpal Singh Mumick  AT&T Bell Laboratories
V. S. Subrahmanian  University of Maryland
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 107,   Citation Count: 131
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/170035.170066
What is a DOI?

ABSTRACT

We present incremental evaluation algorithms to compute changes to materialized views in relational and deductive database systems, in response to changes (insertions, deletions, and updates) to the relations. The view definitions can be in SQL or Datalog, and may use UNION, negation, aggregation (e.g. SUM, MIN), linear recursion, and general recursion. We first present a counting algorithm that tracks the number of alternative derivations (counts) for each derived tuple in a view. The algorithm works with both set and duplicate semantics. We present the algorithm for nonrecursive views (with negation and aggregation), and show that the count for a tuple can be computed at little or no cost above the cost of deriving the tuple. The algorithm is optimal in that it computes exactly those view tuples that are inserted or deleted. Note that we store only the number of derivations, not the derivations themselves. We then present the Delete and Rederive algorithm, DRed, for incremental maintenance of recursive views (negation and aggregation are permitted). The algorithm works by first deleting a superset of the tuples that need to be deleted, and then rederiving some of them. The algorithm can also be used when the view definition is itself altered.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
ABW88
BC79
BCL89
 
BLR91
Veronique Benzaken, Christophe Lecluse, and Philippe Richard. Enforcing Integrity Constraints in Database Programming Languages. TR Altair 68-91, Altair, France, 1991.
BLT86
 
BMM92
 
BT88
 
CW91
 
CW92
Stefano Ceri and Jennifer Widom. Deriving Incremental Production Rules for Deductive Data. IBM RJ 9071, IBM Almaden, 1992.
 
DAJ91
 
DS92
Guozhu Dong and Jianwen Su. Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries. TRCS 92-18, University of California, Santa Barbara, 1992.
 
DT92
 
GKM92
Ashish Gupta, Dinesh Katiyar, and Inderpal Singh Mumick. Counting Solutions to the View Maintenance Problem. In Workshop on Deductive Databases, JICSLP, 1992.
 
GMS92
Ashish Gupta, Inderpal Singh Mumick, and V. S. Subrahmanian. Maintaining views incrementally. TR 921214-19-TM, AT&T Bell Labs, 1992.
 
HD92
John V. Harrison and Suzanne Dietrich. Maintenance of Materialized Views in a Deductive Database: An Update Propagation Approach. In Workshop on Deductive Databases, JICSLP, 1992.
 
ISO90
ISO_ANSI. ISO-ANSI Working Draft: Database Language SQL2 and SQL3; X3H2; ISO/IEC JTC1/SC21/WG3, 1990.
 
Kuc91
V. Kuchenhoff. On the Efficient Computation of the Difference Between Consecutive Database States. In DOOD, LNCS 566, 1991.
 
MS93a
Inderpal Singh Mumick and Oded Shmueli. Finiteness Properties of Database Queries. In Fourth Australian Database Conference, 1993.
 
Mum91
Inderpal Singh Mumick. Query Optimization in Deductive and Relational Databases. Ph.D. Thesis, Stanford University, CA 94305, 1991.
 
NY83
J.M. Nicolas and Yazdanian. An Outline of BDGEN: A Deductive DBMS. In In}ormation Processing, pages 705-717, 1983.
 
QW91
 
RS93
Torre Risch and Martin SkSld. Active rules based on object-oriented queries. To Appear, A CM TKDE, 1993.
SI84
 
SPAM91
 
Ull89
 
UO92
 
VG86
Allen Van Gelder. Negation as failure using tight derivations for general logic programs. In Third IEEE Symposium on Logic Programming, 1986. Springer-Verlag.
WDSY91

CITED BY  131

Collaborative Colleagues:
Ashish Gupta: colleagues
Inderpal Singh Mumick: colleagues
V. S. Subrahmanian: colleagues