This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Incremental Computation of Set Difference Views
March-April 1997 (vol. 9 no. 2)
pp. 251-261

Abstract—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.

[1] J.A. Blakeley, P. Larson, and F.W. Tompa, "Efficiently Updating Materialized Views," Proc. ACM SIGMOD Conf.,Washington, D.C., pp. 61-71, May 1986.
[2] J.A. Blakeley and N.L. Martin, "Join Index, Materialized View, and Hybrid-Hash Join: A Performance Analysis," Proc. Sixth Int'l Conf. Data Eng., pp. 256-263, 1990.
[3] L. Bækgaard and L. Mark, "Incremental Computation of Nested Relational Query Expressions," ACM Trans. Database Systems, vol. 20, no. 2, June 1995.
[4] L. Bækgaard and L. Mark, "Incremental Computation of Time-Varying Queries," IEEE Trans. Knowledge and Data Eng., vol. 7, no. 4, pp. 583-590, Aug. 1995.
[5] L. Bækgaard and N. Roussopoulos, "Efficient Refreshment of Data Warehousing Views," Technical Report CS-TR-3642, Univ. of Maryland, 1996.
[6] M. Carey, E. Shekita, G. Lapis, B. Lindsay, and J. McPherson, "An Incremental Join Attachment for Starburst," Proc. VLDB, pp. 662-673, 1990.
[7] S. Ceri and G. Gottlob, "Translating SQL into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries," IEEE Trans. Software Eng., vol. 11, no. 4, pp. 324-345, 1985.
[8] S. Ceri and J. Widom,"Deriving production rules for incremental view maintenance," Proc. 17th VLDB, pp. 735-749,Barcelona, 1991.
[9] S. Chaudhuri, R. Krishnamurthy, S. Potamianos, and K. Shim, "Optimizing Queries with Materialized Views," Proc. 11th Int'l Conf. Data Eng.,Taipei, Taiwan, 1995.
[10] E.F. Codd,“A relational model of data for large shared data banks,” Comm. ACM, vol. 13, no. 6, June 1970.
[11] G. Graefe, "Query Evaluation Techniques for Large Databases," ACM Computing Surveys, vol. 25, no. 2, pp. 73-170, June 1993.
[12] T. Griffin and L. Libkin, "Incremental Maintenance of Views with Duplicates," Proc. ACM SIGMOD Int'l Conf. Management of Data,San Jose, Calif., 1995.
[13] A. Gupta, I.S. Mumick, and K.A. Ross, "Adapting Materialized Views after Redefinitions," Proc. ACM SIGMOD Int'l Conf. Management of Data,San Jose, Calif., pp. 211-222, 1995.
[14] A. Gupta, I.S. Mumick, and V.S. Subrahmanian, "Maintaining Views Incrementally," Proc. 11th Int'l Conf. Data Eng.,Taipei, Taiwan, 1995.
[15] C. Hamon and A.M. Keller, "Two/Level Caching of Composite Object Views of Relational Databases," Proc. 11th Int'l Conf. Data Eng.,Taipei, Taiwan, 1995.
[16] E.N. Hanson, "A Performance Analysis of View Materialization Strategies," Proc. ACM SIGMOD Conf.,San Francisco, pp. 440-453, 1987.
[17] E.N. Hanson,M. Chaabouni,C. Kim, and Y. Wang,"A predicate matching algorithm for database rule systems," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 271-280, May 1990.
[18] E.N. Hanson,"Rule condition testing and action execution in Ariel," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 49-58, June 1992.
[19] S. Horwitz and T. Teitelbaum, "Generating Editing Environments Based on Relations and Attributes," ACM Trans. Programming Languages and Systems, vol. 8, no. 4, pp. 577-608, 1986.
[20] M. Jarke and J. Koch, “Query Optimization in Database Systems,” ACM Computer Surveys, vol. 16, pp. 111–152, 1984.
[21] C.S. Jensen, L. Mark, and N. Roussopoulos, "Incremental Implementation Model for Relational Databases with Transaction Time," IEEE Trans. Knowledge and Data Engineering, vol. 3, no. 4, pp. 461-473, Dec. 1991.
[22] B.G. Lindsay, L. Haas, C. Mohan, H. Pirahesh, and P. Wilms, "A Snapshot Differential Refresh Algorithm," Proc. ACM SIGMOD Conf., pp. 53-60, June 1986.
[23] J.J. Lu, G. Moerkotte, J. Schue, and V.S. Subrahmanian, "Efficient Maintenance of Materialized Views," Proc. ACM SIGMOD Int'l Conf. Management of Data,San Jose, Calif., pp. 340-351, 1995.
[24] L.E. McKenzie, "An Algebraic Language for Query and Update of Temporal Databases," Univ. of North Carolina at Chapel Hill, Dept. of Computer Science, Technical Report 88-050, 1988.
[25] X. Qian and G. Wiederhold, Incremental Recomputation of Active Relational Expressions IEEE Trans. Knowledge and Data Eng. (TKDE), vol. 3, no. 3, pp. 337-341, Sept. 1991.
[26] A. Rosenthal, S. Chakravarthe, B. Blaustein, and J. Blakeley, "Situation Monitoring for Active Databases," Proc 15th Int'l Conf. Very Large Data Bases,Amsterdam, The Netherlands, Aug. 1989.
[27] N. Roussopoulos, "The Incremental Access Method of View Cache: Concept, Algorithms, and Cost Analysis," ACM Trans. Database Systems, vol. 16, no. 3, pp. 535-563, Sept. 1991.
[28] D. Severance and G. Lohman, "Differential Files: Their Application to the Maintenance of Large Databases," ACM Trans. Database Systems, June 1976.
[29] J.M. Smith and P.Y.-T. Chang, "Optimizing the Performance of a Relational Algebra Database Interface," IEEE Trans. Software Eng., vol. 18, no. 10, pp. 568-579, 1975.
[30] M. Stonebraker,"Implementation of integrity constraints and views by query modification," Proc. SCM SIGMOD Int'l Conf. Management of Data, pp. 65-78, June 1975.
[31] R. Stonebraker,A. Jhingran,J. Goh,, and S. Potamianos,“On rules, procedures, caching, and views in database systems,” ACM SIGMOD Int’l Conf. Management of Data, 1990.
[32] K. Subieta and W. Rzeczkowski, "Query Optimization by Stored Queries," Proc. 13th Int'l Conf. Very Large Data Bases,Brighton, England, pp. 369-380, 1987.
[33] J. Ullman, Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, 1988.
[34] P. Valduriez, “Join Indices,” ACM Trans. Database Systems, vol. 12, no. 2, 1987.
[35] O. Wolfson, H.M. Dewan, S.J. Stolfo, and Y. Yemini, "Incremental Evaluation of Rules and its Relationship to Parallelism," Proc. ACM SIGMOD Int'l Conf. Management of Data,Denver, Colo., June 1991.
[36] Y. Zhuge, H. García-Molina, J. Hammer, and J. Widom, “View Maintenance in a Warehousing Environment,” Proc. SIGMOD, pp. 316-327, May 1995.

Index Terms:
Set differences, incremental view computation, view pointer caches.
Citation:
Lars Bækgaard, Leo Mark, "Incremental Computation of Set Difference Views," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 2, pp. 251-261, March-April 1997, doi:10.1109/69.591450
Usage of this product signifies your acceptance of the Terms of Use.