A minimal-model based horizontal fragmentation algorithm for disjunctive deductive databases

Authors:
Aparna Seetharaman;Yiu-Kai Ng
Affiliations:
Department of Computer Science, Brigham Young University, Provo, Utah;Department of Computer Science, Brigham Young University, Provo, Utah
Venue:
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
Year:
1997

Citing 3
Cited 0

Principles of distributed database systems

Principles of distributed database systems
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
A comprehensive approach to horizontal class fragmentation in a distributed object based system

Distributed and Parallel Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. We present a formal approach for fragmenting a DDDB based on the minimal-model semantics. Fragments generated by the proposed algorithm facilitate query evaluation against the DDDB in a distributed system.