By Topic

Incremental computation of set difference views

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
L. Baekgaard ; Dept. of Inf. Sci., Aarhus Sch. of Bus., Denmark ; L. Mark

Views can be computed by means of recomputation or they can be computed incrementally. Incremental view computation outperforms view recomputation in many situations. This is particularly true in distributed database environments such as data warehousing environments. The authors present and analyze two algorithms for the incremental computation of relational set difference views. Set differences occur naturally in the definition of the set-division operator and in rewritten nested queries. The I/O efficiency of the incremental algorithms is compared to each other and to efficient recomputation algorithms. The cost analysis strongly indicates that incremental computation of set difference views outperforms recomputation of set difference views in many situations

Published in:

IEEE Transactions on Knowledge and Data Engineering  (Volume:9 ,  Issue: 2 )