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. In this paper we propose a hirizontal 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. The proposed fragmentation techique facilitates the design of distributed deductive database systems.
展开▼
