DMCA
First-Order Incremental Evaluation of Datalog Queries (1993)
| Venue: | Annals of Mathematics and Artificial Intelligence |
| Citations: | 50 - 15 self |
BibTeX
@INPROCEEDINGS{Dong93first-orderincremental,
author = {Guozhu Dong and Guozhu Dong and Jianwen Su and Jianwen Su and Rodney Topor and Rodney Topor},
title = {First-Order Incremental Evaluation of Datalog Queries},
booktitle = {Annals of Mathematics and Artificial Intelligence},
year = {1993},
pages = {282--296},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We consider the problem of repeatedly evaluating the same (computationally expensive) query to a database that is being updated between successive query requests. In this situation, it should be possible to use the difference between successive database states and the answer to the query in one state to reduce the cost of evaluating the query in the next state. We use first-order queries to compute the differences, and call this process "first-order incremental query evaluation." After formalizing the notion of first-order incremental query evaluation, we give an algorithm that constructs, for each regular chain query (including transitive closure as a special case), a nonrecursive program to compute the difference between the answer after an update and the answer before the update. We then extend this result to weakly regular queries, which are regular chain programs augmented with conjunctive queries having the so-called cartesian-closed increment property, and to the case of unbound...
Keyphrases
datalog query first-order incremental evaluation first-order incremental query evaluation next state successive database state transitive closure regular chain query regular query so-called cartesian-closed increment property successive query request regular chain program conjunctive query special case first-order query nonrecursive program
