ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Efficient view maintenance at data warehouses
Full text PdfPdf (1.30 MB)
Source ACM SIGMOD Record archive
Volume 26 ,  Issue 2  (June 1997) table of contents
Pages: 417 - 427  
Year of Publication: 1997
ISSN:0163-5808
Also published in ...
Authors
D. Agrawal  Department of Computer Science, University of California
A. El Abbadi  Department of Computer Science, University of California
A. Singh  Department of Computer Science, University of California
T. Yurek  Department of Computer Science, University of California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 84,   Citation Count: 46
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/253262.253355
What is a DOI?

ABSTRACT

We present incremental view maintenance algorithms for a data warehouse derived from multiple distributed autonomous data sources. We begin with a detailed framework for analyzing view maintenance algorithms for multiple data sources with concurrent updates. Earlier approaches for view maintenance in the presence of concurrent updates typically require two types of messages: one to compute the view change due to the initial update and the other to compensate the view change due to interfering concurrent updates. The algorithms developed in this paper instead perform the compensation locally by using the information that is already available at the data warehouse. The first algorithm, termed SWEEP, ensures complete consistency of the view at the data warehouse in the presence of concurrent updates. Previous algorithms for incremental view maintenance either required a quiescent state at the data warehouse or required an exponential number of messages in terms of the data sources. In contrast, this algorithm does not require that the data warehouse be in a quiescent state for incorporating the new views and also the message complexity is linear in the number of data sources. The second algorithm, termed Nested SWEEP, attempts to compute a composite view change for multiple updates that occur concurrently while maintaining strong consistency.


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.

 
BCP96
Elena Baralis, Stefano Ceri, and Stefaao Parabosc2fi. Conservative Timestamp Revisited for Materialized View Maintenance in a Data Warehouse. In Workshop on VIEWS'96, 1996.
BLT86
CGL+96
 
CW91
GHJ96
 
GJM96
GL95
 
GM95
A. Gupta and I. S. Mumick. Maintenance of Materialized Views: Problems, Techniques, and Applications. IEEE Bulletin of the Technical Committee on Data Engineerin9, 18(2):3-18, june 1995.
GMS93
 
HGMW+95
J. Hammer, H. Garcia-Molina, J. Widom, W. Labio, and Y. Zhuge. The Stanford Data Warehousing Project. IEEE Bulletin of the Technical Committee on Data Engineering, 18(2):41-48, June 1995.
 
HJ91
HZ96a
 
HZ96b
Richard Hull and Gang Zhou. Towards the Study of Performance T~ade-offs Between Materialized and Virtual Integrated Views. In Workahop on VIEWS'96, 1996.
 
QGMW96
 
QW91
 
RBS96
RBS. Data Warehouse Applications. Red Brick Systems, 1996.
SI84
 
Yur97
T. Yurek. Efficient View Maintenance at Data Warehouses. Master's thesis, University of California at Santa Barbara, Department of Computer Science, UCSB, Santa Barbara, CA 93106, 1997.
ZGMHW95
 
ZGMW96

CITED BY  46

Collaborative Colleagues:
D. Agrawal: colleagues
A. El Abbadi: colleagues
A. Singh: colleagues
T. Yurek: colleagues