Issue No.02 - March-April (1997 vol.9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.591450
<p><b>Abstract</b>—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, in particular, true in distributed database environments like data warehousing environments. We 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. Our cost analysis strongly indicates that incremental computation of set difference views outperforms recomputation of set difference views in many situations.</p>
Set differences, incremental view computation, view pointer caches.
Lars Bækgaard, "Incremental Computation of Set Difference Views", IEEE Transactions on Knowledge & Data Engineering, vol.9, no. 2, pp. 251-261, March-April 1997, doi:10.1109/69.591450