A Formal Approach for Horizontal Fragmentation of Distributed Disjunctive Deductive Database Design, http://lantern.cs.byu.edu (1996) [1 citations — 0 self]
|
Abstract:
Disjunctive deductive databases (DDDBs) can capture indefinite information, i.e., imprecise or partial knowledge, and are more general than definite 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 are computed only against those portions of the DDDB relevant to the subquery and can be generated in parallel. Evaluating these subqueries thus improves the response time in a distributed system and reduces communication cost involved in evaluating the entire query. In this paper, we present a formal approach for horizontally fragmenting a DDDB. Our approach is based on the set of common user queries S of a DDDB D from which a fragment is produced for each query Q in S. The resultant fragment for Q contains all the rules and facts of D that are required to generate all the answers to Q. 1
Citations
| 365 | Principles of Distributed Database Systems – Ozsu, Valduriez - 1991 |
| 190 | Foundations of Disjunctive Logic Programming – Lobo, Minker, et al. - 1992 |
| 37 | A Comprehensive Approach to Horizontal Class Fragmentation in a Distributed Object Based System – Ezeife, Barker - 1995 |
| 23 | Bottom-Up Computation of Perfect Models for Disjunctive Theories – Fern'andez, Minker - 1995 |
| 5 | Updating disjunctive databases via model trees – Grant, Gryz, et al. - 1995 |
| 4 | Query Evaluation in Partitioned Disjunctive Deductive Databases – Yahya, Minker - 1994 |
| 3 | A Formal Approach for Horizontal Fragmentation in Distributed Deductive Database Design – Lim, Ng - 1996 |
