ACM Computing Surveys (CSUR)
Guest Editor Introduction: Functional Approach to Intelligent Information Systems
Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
Functional Query Optimization over Object-Oriented Views for Data Integration
Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
The monitoring of complex active rules with vector representation
CIKM '96 Proceedings of the workshop on Databases: active and real-time
Optimising Active Database Rules by Partial Evaluation and Abstract Interpretation
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Query processing over object views of relational data
The VLDB Journal — The International Journal on Very Large Data Bases
Engineering information integration using object-oriented mediator technology
Software—Practice & Experience
A magic approach to optimizing incremental relational expressions
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Active database systems for monitoring and surveillance
ISI'03 Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics
Efficient tracking of moving objects using a relational database
Information Systems
| Hi-index | 0.00 |
Presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently monitor rules with complex conditions. The calculus is based on partial differencing of queries derived from rule conditions. For each rule condition, several partially differentiated queries are generated that each considers changes to a single base relation or view that the condition depends on. The calculus considers both insertions and deletions. The algorithm is optimized for deferred rule condition monitoring in transactions with few updates. The calculus allows us to optimize both space and time. Space optimization is achieved since the calculus and the algorithm does not presuppose materialization of monitored conditions to find its previous state. This is achieved by using a breadth-first, bottom-up propagation algorithm and by calculating previous states by doing a logical rollback. Time optimization is achieved through incremental evaluation techniques. The algorithm has been implemented and a performance study is presented at the end of the paper.