A magic approach to optimizing incremental relational expressions

This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relations (even recursively). It is shown that the desired optimization effects of update propagation may be lost if no generalized selection pushing strategy is employed to the transformed algebra expressions. A possible solution is the application of the Magic Sets rewriting but this may lead to unstratifiability of the incremental expressions. For the efficient evaluation of Magic Sets transformed algebra expressions we propose to use the soft stratification approach because of the simplicity and efficiency of this technique. Categories and Subject Descriptors H.2.3 [Database Management]: Systems—Relational databases General Terms Design, Performance Keywords Incremental Evaluation, Update Propagation, Relational Algebra, Deductive Databases

• Type: Conference
• Year: 2009
• Where: IDEAS
• Authors: Andreas Behrend
• Keywords: Algebra Expressions, Database, IDEAS 2009, Relational Algebra, Update Propagation