Linearly bounded reformulations of conjunctive databases (2000) [13 citations — 5 self]
Download:
pdf
by Rada Chirkova, Michael R. Genesereth
In Proc. of DOOD
http://logic.stanford.edu/~rada/Papers/conjRef.pdf
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Chirkova00linearlybounded,author = {Rada Chirkova and Michael R. Genesereth},
title = {Linearly bounded reformulations of conjunctive databases},
booktitle = {In Proc. of DOOD},
year = {2000},
pages = {987--1001},
publisher = {DOOD}
}
Years of Citing Articles
Abstract:
{rada, genesereth}cs. stanford. edu Abstract. Database reformulation is the process of rewriting the data and rules of a deductive database in a functionally equivalent manner. We focus on the problem of automatically reformulating a database in a way that reduces query processing time while satisfying strong storage space constraints. In previous work we have investigated database reformulation for the case of unary databases. In this paper we extend this work to arbitrary arity, while concentrating on databases with conjunctive rules. The main result of the paper is that the database reformulation problem is decidable for conjunctive databases.
