This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Incremental Computation of Time-Varying Query Expressions
August 1995 (vol. 7 no. 4)
pp. 583-590
ASCII Text
x 
 
Lars Bækgaard, Leo Mark, "Incremental Computation of Time-Varying Query Expressions," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 4, pp. 583-590, August, 1995.
 
 
BibTex
x
 
@article{ 10.1109/69.404031,
author = {Lars Bækgaard and Leo Mark},
title = {Incremental Computation of Time-Varying Query Expressions},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {7},
number = {4},
issn = {1041-4347},
year = {1995},
pages = {583-590},
doi = {http://doi.ieeecomputersociety.org/10.1109/69.404031},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - Incremental Computation of Time-Varying Query Expressions
IS - 4
SN - 1041-4347
SP583
EP590
EPD - 583-590
A1 - Lars Bækgaard,
A1 - Leo Mark,
PY - 1995
KW - Time-varying queries
KW - incremental query computation
KW - predicate caches
KW - superviews
KW - temporal databases
KW - temporal data.
VL - 7
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 

Abstract—We present and analyze algorithms for the incremental computation of time-varying queries in which selection predicates refer to the state of a clock. Such queries occur naturally in many situations where temporal data are processed. Incremental techniques for query computation have proven to be more efficient than other techniques in many situations. However, all existing incremental techniques for query computation assume that old query results remain valid if no intermediate changes are made to the underlying database. Unfortunately, this assumption does not hold for time-varying queries whose results may change just because time passes. In order to solve this problem, we introduce the notion of a superview which contains all current tuples that will eventually satisfy the selection predicate of a time-varying selection. Based on the notion of superview, we develop efficient algorithms for the incremental computation of time-varying selections. Our algorithms, combined with existing incremental algorithms, allow complex time-varying queries to benefit from the proven efficiency of incremental techniques. It is important to notice that without our algorithms, the existing algorithms for incremental computation would be useless for any time-varying query expression.

[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] L. Bækgaard and L. Mark,“Incremental computation of nested relational query expressions,” Dept. of Mathematics and Computer Science, Aalborg Univ., Denmark, R-94-2034, 1994.
[3] L. Bækgaard and L. Mark,“Incremental computation of time-varying queries,” Dept. of Mathematics and Computer Science, Aalborg Univ., Denmark, R-94-2035, 1994.
[4] L. Bækgaard and L. Mark,“Incremental computation of set difference views,” Dept. of Mathematics and Computer Science, Aalborg Univ., Denmark, R-94-2036, 1994, to appear in IEEE Trans. Knowledge and Data Engineering.
[5] M. Carey, E. Shekita, G. Lapis, B. Lindsay, and J. McPherson, "An Incremental Join Attachment for Starburst," Proc. VLDB, pp. 662-673, 1990.
[6] S. Ceri and J. Widom,"Deriving production rules for incremental view maintenance," Proc. 17th VLDB, pp. 735-749,Barcelona, 1991.
[7] E.F. Codd,“A relational model of data for large shared data banks,” Comm. ACM, vol. 13, no. 6, June 1970.
[8] C.E. Dyreson and R. Snodgrass,“Timestamp semantics and representation,” Information Systems, vol. 18, no. 3, pp. 143-166, Sept. 1993.
[9] E.N. Hanson, "A Performance Analysis of View Materialization Strategies," Proc. ACM SIGMOD Conf.,San Francisco, pp. 440-453, 1987.
[10] 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.
[11] 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.
[12] 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.
[13] M. Jarke and J. Koch, “Query Optimization in Database Systems,” ACM Computer Surveys, vol. 16, pp. 111–152, 1984.
[14] 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.
[15] C.S. Jensen, J. Clifford, S.K. Gadia, A. Segev, and R.T. Snodgrass, "A Glossary of Temporal Database Concepts," ACM SIGMOD Record, vol. 21, no. 3, pp. 35-43, 1992.
[16] L.E. McKenzie,“An algebraic language for query and update of temporal databases,” Univ. of North Carolina at Chapel Hill, Dept. ofComputer Science, TR-88-050, 1988.
[17] S.B. Navathe and R. Ahmed,“Temporal extensions to the relational model and SQL,” Temporal Databases, A.U. Tansel, J. Clifford, S.Gadia, S.Jajodia, A.Segevand R. Snodgrass, eds., Redwood City, Calif.: Benjamin/Cummings, 1993.
[18] 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.
[19] 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.
[20] 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.
[21] D. Severance and G. Lohman, "Differential Files: Their Application to the Maintenance of Large Databases," ACM Trans. Database Systems, June 1976.
[22] 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.
[23] R.T. Snodgrass and I. Ahn, "Temporal Databases," Computer, vol. 19, no. 9, pp. 35-42, Sept. 1986.
[24] R.T. Snodgrass, “The Temporal Query Language TQuel,” ACM Trans. Database Systems, vol. 12, no. 2, pp. 247–298, 1987.
[25] I. Ahn and R. Snodgrass, "Partitioned Storage for Temporal Databases," Information Systems, vol. 13, pp. 369-391, 1988.
[26] M. Soo and R. Snodgrass,“Mixed calendar query language support for temporal constants, TempIS-29, USA, 1992.
[27] 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.
[28] J. Ullman, Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, 1988.
[29] 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.

Index Terms:
Time-varying queries, incremental query computation, predicate caches, superviews, temporal databases, temporal data.
Citation:
Lars Bækgaard, Leo Mark, "Incremental Computation of Time-Varying Query Expressions," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 4, pp. 583-590, Aug. 1995, doi:10.1109/69.404031
Usage of this product signifies your acceptance of the Terms of Use.