## Optimizing Active Databases using the Split Technique (1992)

Venue: | Proceedings 4th Intl. Conference on Database Theory (ICDT '92), LNCS 646 |

Citations: | 3 - 2 self |

### BibTeX

@INPROCEEDINGS{Abiteboul92optimizingactive,

author = {Serge Abiteboul and Allen Van Gelder},

title = {Optimizing Active Databases using the Split Technique},

booktitle = {Proceedings 4th Intl. Conference on Database Theory (ICDT '92), LNCS 646},

year = {1992},

pages = {171--187},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

A method to perform nonmonotonic relational rule computations is presented, called the split technique, The goal is to avoid redundant computations with rules that can insert and delete sets of tuples specified by the rule body. The method is independent of the control strategy that governs rule firing. Updatable relations are partitioned, as the computation progresses, into blocks of tuples such that tuples within a block are indiscernible from each other based on the computation so far. Results of previous rule firings are remembered as "relational equations" so that a new rule firing does not recompute parts of the result that can be determined from the existing equations. Seminaive evaluation falls out as a special case when all rules specify inserts. The method is amenable to parallelization.

### Citations

298 |
Magic Sets and Other Strange Ways to Implement Logic Programs
- Bancilhon, Maier, et al.
- 1986
(Show Context)
Citation Context ...ntages: 1. capturing seminaive evaluation We believe that the seminaive evaluation although rather straightforward is the major source of optimization proposed so far. Other techniques like magic-set =-=[BMSU86]-=- or Query/SubQuery [Vie87] are primarily intended for query processing and it is not clear that this is the most fundamental place where optimization is needed. However, seminaive works only with mono... |

209 | The alternating fixpoint of logic programs with negation
- Gelder
- 1989
(Show Context)
Citation Context ...ribed above. Other possible applications are the computation of models associated with various nonmonotonic logic program semantics, such as well-founded models via the alternating fixpoint technique =-=[VG92]-=- and stable models via the backtracking fixpoint technique [SZ90], or the tie-breaking fixpoint technique [PY92]. The main idea of the split technique is that while performing the actual computation, ... |

196 |
An amateur’s introduction to recursive query processing strategies
- Bancilhon, Ramakrishnan
- 1986
(Show Context)
Citation Context ...uction rule systems (e.g., OPS5 [BFKM85], RDL1 [dMS88]). However, little is known about the optimization of such computations. The main known technique is seminaive, or differential, computation (see =-=[BR86]-=-). However, it applies only to relations that are used monotonically. The technique presented here can be viewed as a generalization of this technique to relations that are allowed to both increase an... |

152 | Datalog extensions for database queries and updates - Abiteboul, Vianu - 1991 |

118 |
Generic computation and its complexity
- Abiteboul, Vianu
- 1991
(Show Context)
Citation Context ...nge of applicability is somewhat open. We briefly discuss here its theoretical foundations and some preliminary results obtained with a prototype. 3.1 Theory The present work is based on results from =-=[AV91b]-=- and [ACV92]. In [AV91b], a normal form for partial fixpoint computation is demonstrated that consists of first partitioning the set of tuples into equivalence blocks which are given identification nu... |

99 | The architecture of an active database management system - McCarthy, Dayal - 1989 |

72 |
Recursive query processing: The power of logic
- Vieille
- 1989
(Show Context)
Citation Context ...ive evaluation We believe that the seminaive evaluation although rather straightforward is the major source of optimization proposed so far. Other techniques like magic-set [BMSU86] or Query/SubQuery =-=[Vie87]-=- are primarily intended for query processing and it is not clear that this is the most fundamental place where optimization is needed. However, seminaive works only with monotone computations whereas ... |

60 | Procedural languages for database queries and updates - Abiteboul, Vianu - 1990 |

56 | E ciently monitoring relational databases - Buneman, Clemons - 1979 |

54 | An Initial Report on the Design of Ariel: a DBMS with an Integrated Production Rule System - Hanson - 1989 |

51 | The design of the Postgres rules systems - Stonebraker, Hanson, et al. - 1987 |

50 | A logic-based language for database updates - Manchandra, Warren - 1988 |

36 |
Programming Expert Systems in OPS5
- Brownston, Farrell, et al.
- 1985
(Show Context)
Citation Context ...88, MW88]). Such computations arise not only in databases with so-called active features (e.g., [Esw76, BC79, SHP88, dMS88, MD89, Han89, HJ91, Wid91]), but also in production rule systems (e.g., OPS5 =-=[BFKM85]-=-, RDL1 [dMS88]). However, little is known about the optimization of such computations. The main known technique is seminaive, or differential, computation (see [BR86]). However, it applies only to rel... |

29 | Database Updates in logic Programming - Naqvi, Krishnamurthy - 1987 |

16 | Deduction in the Starburst Production Rule System - Widom - 1991 |

15 |
Modelling non deterministic queries and updates in deductive databases
- Simon
- 1988
(Show Context)
Citation Context ...h computations arise not only in databases with so-called active features (e.g., [Esw76, BC79, SHP88, dMS88, MD89, Han89, HJ91, Wid91]), but also in production rule systems (e.g., OPS5 [BFKM85], RDL1 =-=[dMS88]-=-). However, little is known about the optimization of such computations. The main known technique is seminaive, or differential, computation (see [BR86]). However, it applies only to relations that ar... |

14 |
Explicit Control of Logic Programs through Rule Algebra
- Imieliński, Naqvi
- 1988
(Show Context)
Citation Context ...the control. Example 2. (Well-Founded Vertices) To test meaningful examples with the prototype, we have implemented a simple control language in the spirit of the rule algebra of Imielinski and Naqvi =-=[IN88]. The rule-=-s and the control are illustrated in the following example. Consider a directed graph of edges e. A vertex is "well-founded" if there exist no infinite paths descending from it, i.e., wf(X) ... |

11 | Queries are easier than you thought (probably
- Abiteboul, Compton, et al.
- 1992
(Show Context)
Citation Context ...ated to database updates. The known worst case complexity for such languages is polynomial space. However, it is argued in [AV91a, ACV92] that this bound is unrealistic. Indeed, it is demonstrated in =-=[ACV92]-=- that a logspace bound can be achieved for random data distribution on the average. The work presented here can be viewed as a practical implementation of some ideas developed in [AV91a, ACV92]. In th... |

9 |
An analysis of fixed-point queries on binary trees
- Lindell
- 1991
(Show Context)
Citation Context ...1 closure transitive closure 9 10 734 501 (no ae annotation) well 22 5 72 1004 founded insert-delete 2 2 45 2 + loop Fig. 2. Number of refinements in examples The case of full binary trees studied in =-=[Lin90]-=- and also [AV91b] clearly demonstrates the usefulness of the technique for very regular data structures, i.e., structures presenting a lot of automorphism. The number of blocks is an order of magnitud... |

9 |
M.: Tie-breaking semantics and structural totality
- Papadimitriou, Yannakakis
- 1997
(Show Context)
Citation Context ...c program semantics, such as well-founded models via the alternating fixpoint technique [VG92] and stable models via the backtracking fixpoint technique [SZ90], or the tie-breaking fixpoint technique =-=[PY92]-=-. The main idea of the split technique is that while performing the actual computation, the system does some relatively inexpensive bookkeeping that will permit it to avoid redoing the same computatio... |

7 |
Partial models, stable models and non-determinism in logic programs with negation
- Sacc`a, Zaniolo
- 1990
(Show Context)
Citation Context ...odels associated with various nonmonotonic logic program semantics, such as well-founded models via the alternating fixpoint technique [VG92] and stable models via the backtracking fixpoint technique =-=[SZ90]-=-, or the tie-breaking fixpoint technique [PY92]. The main idea of the split technique is that while performing the actual computation, the system does some relatively inexpensive bookkeeping that will... |

4 | Aspects of a Trigger Subsystem in an Integrated Data Base System - Eswaran - 1976 |

1 | Language constructs for programming deductive databases - Hull, Jacob - 1991 |