Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Linearly Bounded Reformulations of Conjunctive Databases
Extended Abstract

Rada Chirkova10 Contact Information and Michael R. Genesereth10 Contact Information

(10)  Stanford University, Stanford, CA 94305, USA
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.

Contact Information Rada Chirkova
Email: rada@cs.stanford.edu

Contact Information Michael R. Genesereth
Email: genesereth@cs.stanford.edu
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: MPWEB26
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)