Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Efficient View Maintenance Using Version Numbers
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2113/2001
Book
Database and Expert Systems Applications
DOI
10.1007/3-540-44759-8
Copyright
2001
ISBN
978-3-540-42527-4
DOI
10.1007/3-540-44759-8_52
Pages
527-536
Subject Collection
Computer Science
SpringerLink Date
Monday, January 01, 2001
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (136.8 KB)
Free Preview
Efficient View Maintenance Using Version Numbers
Eng Koon Sze
8
and Tok Wang Ling
8
(8)
National University of Singapore, 3 Science Drive 2, Singapore, 117543
Abstract
Maintaining a materialized view in an environment of multiple, distributed, autonomous data sources is a challenging issue. The results of incremental computation are effected by interfering updates and compensation is required. In this paper, we improve the incremental computation proposed in our previous work by making it more efficient through the use of data source and refreshed version numbers. This is achieved by cutting down unnecessary maintenance queries and thus their corresponding query results. The number of times of sending subqueries to a data source with multiple base relations are also reduced, as well as avoiding the execution of cartesian products. Updates that will not affect the view are detected and incremental computation is not applied on them. We also provide a compensation algorithm that resolve the anomalies caused by using the view in the incremental computation.
Eng
Koon Sze
Email:
szeek@comp.nus.edu.sg
Tok
Wang Ling
Email:
lingtw@comp.nus.edu.sg
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.107 • Server: mpweb17
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)