A Model-Forest Based Horizontal Fragmentation Approach for Disjunctive Deductive Databases
نویسندگان
چکیده
Disjunctive deductive databases (DDDBs) can capture indeenite information, i.e., imprecise or partial knowledge, of the real world. In this paper we present a method for horizontally fragmenting a DDDB based on the minimal-model forest approach. A minimal-model forest of a DDDB D is a collection of minimal-model trees of D such that each tree represents a set of facts that is disjoint from the set of facts represented in any other tree of D. Eventually, each tree T in the forest is assigned to a fragment along with the rules that utilize the facts represented in T to infer new facts. This approach minimizes the amount of data in D that needs to be processed for any query of D by taking the advantage of the natural partition of data that may appear in D.
منابع مشابه
A Minimal-Model Based Horizontal Fragmentation Algorithm for Disjunctive Deductive Databases
Disjunctive deductive databases (DDDBs) capture indefinite information, i.e., imprecise or partial knowledge of the real world, and are more general than definite deductive databases that can only represent unconditionally true facts. Formal approaches for fragmenting a DDDB, with a view to distribute the DDDB and then design a query optimization strategy for the distributed DDDB, are lacking. ...
متن کاملA Formal Approach for Horizontal Fragmentation of Disjunctive Deductive Databases
Disjunctive deductive databases (DDDBs) can capture indeenite information, i.e., imprecise or partial knowledge, and are more general than deenite deductive databases. Formal approaches for horizontally fragmenting a DDDB, however, are lacking. Fragmenting a DDDB facilitates the splitting of queries of the database into subqueries to enhance query processing since the answers to each subquery a...
متن کاملA Fixpoint Approach to State Generation for Stratifiable Disjunctive Deductive Databases
In this paper we present a new fixpoint-based approach to bottom-up state generation for stratifiable disjunctive deductive databases. To this end, a new consequence operator based on hyperresolution is introduced which extends Minker’s operator for positive disjunctive Datalog rules. In contrast to already existing model generation methods our approach for efficiently computing perfect models ...
متن کاملPossible Model Semantics for Disjunctive Databases
This paper presents a novel approach to the semantics of deductive databases. The possible model semantics is introduced as an alternative approach to the classical minimal model semantics. The possible model semantics can distinguish both inclusive and exclusive disjunctions, and provide a exible mechanism for inferring negation in disjunctive databases. The possible model semantics is charact...
متن کاملParaconsistent Relational Model: A Quasi-Classic Logic Approach
The well-founded model for any general deductive database computed using the paraconsistent relational model, based on four-valued logic, does not support inference rules such as disjunctive syllogism. In order to support disjunctive syllogism, we utilize the generalization of the relational model to quasi-classic (QC) logic, whose inference power is much closer to classical logic. As the parac...
متن کامل