The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - September (1991 vol.3)
pp: 337-341
ABSTRACT
<p>Database updates are small and incremental compared to database contents. It is therefore desirable that recomputations of active relational expressions-such as views, derived data, integrity constraints, active queries, and monitors-can also be performed incrementally. An efficient algorithm for the incremental recomputation of active relational expressions based on finite differencing techniques is presented. Database updates are modeled as incremental changes to database relations, and the algorithm derives, by update propagation, the minimal incremental relational expressions that need recomputation. The algorithm has applications in the maintenance of materialized views and derived data, the checking of integrity constraints, and the evaluation of active queries and monitors.</p>
INDEX TERMS
database updates; active relational expressions; views; derived data; integrity constraints; active queries; monitors; incremental recomputation; finite differencing techniques; update propagation; materialized views; data integrity; query languages; relational databases
CITATION
X. Qian, G. Wiederhold, "Incremental Recomputation of Active Relational Expressions", IEEE Transactions on Knowledge & Data Engineering, vol.3, no. 3, pp. 337-341, September 1991, doi:10.1109/69.91063
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool