In this paper, one of the most recent promising algorithms that compute changes to recursive structures in response to changes to the extensional database (EDB) relations (e.e. DRed algorithm) has been studied and it has been improved. In the improved algorithm, the computation has been further "incrementalized" in comparison to DRed algorithm using extra intraiteration computations in each phase. Also, both of the algorithms have been implemented in a testbed to study their performance through simulations.
展开▼