In this thesis, we present a scheme of the deductive query processing for the dynamic change of deduction rules in the intensional database. This scheme consists of two parts. One is the maintenance of compiled deduction rules for the purpose of the easy translation of the query into extensional database operations. A storage structure is designed to make it easy to preserve the consistency of the intensional database after the insertion and the deletion of deduction rules. The other is to reuse some results of the previous iteration which are called wavefront in the case of recursive queries. The type of wavefront is determined by the recursion type and the place of the selection in the recursive query to be compiled.
We reduce the overhead in compiling queries, since the proof steps are performed not at the query compilation time but at the rule definition time. The efficient access plan for a recursive query could be obtained through selecting the best wavefront.
