ACM Home Page
Please provide us with feedback. Feedback
Content-based filtering for efficient online materialized view maintenance
Full text PdfPdf (237 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
SESSION: DB: efficient maintenance and query optimization table of contents
Pages 163-172  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Gang Luo  IBM T.J. Watson Research Center, Hawthorne, NY, USA
Philip S. Yu  IBM T.J. Watson Research Center, Hawthorne, NY, USA
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 132,   Citation Count: 1
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/1458082.1458107
What is a DOI?

ABSTRACT

Real-time materialized view maintenance has become increasingly popular, especially in real-time data warehousing and data streaming environments. Upon updates to base relations, maintaining the corresponding materialized views can bring a heavy burden to the RDBMS. A traditional method to mitigate this problem is to use the where clause condition in the materialized view definition to detect whether an update to a base relation is relevant and can affect the materialized view. However, this detection method does not consider the content in the base relations and hence misses a large number of filtering opportunities. In this paper, we propose a content-based method for detecting irrelevant updates to base relations of a materialized view. At the cost of using more space, this method increases the probability of catching irrelevant updates by judiciously designing filtering relations to capture the content in the base relations. Based on the content-based method, a prototype real-time data warehouse has been implemented on top of IBM's System S using IBM DB2. Using an analytical model and our prototype, we show that the content-based method can catch most (or all) irrelevant updates to base relations that are missed by the traditional method. Thus, when the fraction of irrelevant updates is non-negligible, the load on the RDBMS due to materialized view maintenance can be significantly reduced.


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.

1
2
3
4
 
5
 
6
G. Luo, J. F. Naughton, and C. J. Ellmann et al. A Comparison of Three Methods for Join View Maintenance in Parallel RDBMS. ICDE 2003: 177--188.
7
 
8
G. Luo, J. F. Naughton, and C. J. Ellmann et al. Transaction Reordering and Grouping for Continuous Data Loading. BIRTE 2006.
 
9
 
10
R. Ramamurthy, D. J. Dewitt. Buffer-pool Aware Query Optimization. CIDR 2005.
11
12
 
13
M. Stonebraker. Stream Applications. telegraph.cs.berkeley.edu/swim/stonebraker-swim-app.ppt, 2003.
 
14
TPC Homepage. TPC-R benchmark, www.tpc.org.
15
 
16