Abstract:
Fragmentation of base relations in a distributed database management system increases the level of concurrency and therefore system throughput for query processing. Algorithms for horizontal fragmentation of relations in relational, object-oriented, or deductive databases exist, however, horizontal fragmentation techniques based on variable bindings appeared in user queries are lacking in deductive databases, which handle recursive queries. We propose a horizontal fragmentation algorithm for distributed deductive database systems by partitioning a base or derived relation along its tuples according to the bindings imposed on user queries. We also include in this paper the computational complexity and the proof of correctness of the proposed fragmentation algorithm. 1
Citations
|
936
|
Principles of Database and Knowledge-Base Systems, Volume 1
– Ullman
- 1988
|
|
342
|
Principles of Distributed Database Systems, 2nd Edition
– Ozsu, Valduriez
- 1999
|
|
260
|
Logic Programming and Databases
– Ceri, Gottlob, et al.
- 1990
|
|
109
|
Distributed Databases: Principles and Systems
– Ceri, Pelagatti
- 1984
|
|
36
|
A Comprehensive Approach to Horizontal Class Fragmentation in a Distributed Object Based System
– Ezeife, Barker
- 1995
|
|
8
|
Fragmenting relations horizontally using a knowledge-based approach
– Shin, Irani
- 1991
|
|
5
|
On Compile-Time Query Optimization In Deductive Databases By Means Of Static Filtering
– Kifer, Lozinskii
- 1990
|
|
4
|
The complexity of operations on a fragmented relation
– Meghini, Thanos
- 1991
|
|
4
|
Evaluating Recursive Queries in Distributed Databases
– Nejdl, Ceri, et al.
- 1993
|
|
2
|
Valid unbiased fragmentation for distributed database design
– Fogg, Orlowska
- 1993
|
|
2
|
A New Fragmentation Scheme for Recursive Query Processing", Data and Knowledge Engineering 13
– Zhou, Zhang, et al.
- 1994
|
|
1
|
Fragmentation of Recursive Relations in Distributed Databases
– Pramanik, Kao, et al.
- 1992
|
|
