Generating editing environments based on relations and attributes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Computer
The temporal query language TQuel
ACM Transactions on Database Systems (TODS)
A performance analysis of view materialization strategies
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Partitioned storage for temporal databases
Information Systems
Situation monitoring for active databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
An incremental join attachment for Starburst
Proceedings of the sixteenth international conference on Very large databases
A predicate matching algorithm for database rule systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On rules, procedure, caching and views in data base systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
An incremental access method for ViewCache: concept, algorithms, and cost analysis
ACM Transactions on Database Systems (TODS)
Incremental evaluation of rules and its relationship to parallelism
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Rule condition testing and action execution in Ariel
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
A glossary of temporal database concepts
ACM SIGMOD Record
Timestamp semantics and representation
Information Systems
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Optimizing the performance of a relational algebra database interface
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Incremental Implementation Model for Relational Databases with Transaction Time
IEEE Transactions on Knowledge and Data Engineering
Deriving Production Rules for Incremental View Maintenance
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Incremental Iterative Retrieval and Browsingfor Efficient Conversational CBR Systems
Applied Intelligence
Incremental Computation of Set Difference Views
IEEE Transactions on Knowledge and Data Engineering
Temporal View Self-Maintenance
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Processing of Continuous Queries over Unlimited Data Streams
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Records retention in relational database systems
Proceedings of the 17th ACM conference on Information and knowledge management
Integrity maintenance system of database query under updating
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part III
Active database systems for monitoring and surveillance
ISI'03 Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics
| Hi-index | 0.00 |
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.