Algorithms in C
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Maintaining knowledge about temporal intervals
Communications of the ACM
Database Systems: The Complete Book
Database Systems: The Complete Book
Building an Integrated Active OODBMS: Requirements, Architecture, and Design Decisions
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Composite Event Specification in Active Databases: Model & Implementation
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Composite Events for Active Databases: Semantics, Contexts and Detection
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Parameterized Algebra for Event Notification Services
TIME '02 Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME'02)
The VLDB Journal — The International Journal on Very Large Data Bases
Exploiting k-constraints to reduce memory overhead in continuous queries over data streams
ACM Transactions on Database Systems (TODS)
An event detection algebra for reactive systems
Proceedings of the 4th ACM international conference on Embedded software
Handbook of Temporal Reasoning in Artificial Intelligence (Foundations of Artificial Intelligence (Elsevier))
The CQL continuous query language: semantic foundations and query execution
The VLDB Journal — The International Journal on Very Large Data Bases
A High-Level Query Language for Events
SCW '06 Proceedings of the IEEE Services Computing Workshops
SnoopIB: interval-based event specification and detection for active databases
Data & Knowledge Engineering
Rule-based composite event queries: the language XChangeEQ and its semantics
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Querying composite events for reactivity on the web
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Evolution and reactivity in the semantic web
Semantic techniques for the web
| Hi-index | 0.00 |
Evaluation of complex event queries over time involves storing information about those events that are relevant for, i.e., might contribute to, future answers. We call the period of time for which an event or an intermediate result must (at least) be stored its temporal relevance. This paper pioneers a precise definition of temporal relevance and develops a method for statically (i.e., at compile time) determining it. During query evaluation (i.e., at run time), this enables garbage collection of events that become irrelevant as time progresses. Temporal relevance is also important at compile time for cost-based query planning.