Rule Allocation in Distributed Deductive Database Systems

Abstract Allocation of rules to sites in a distributed deductive database system is an important and challenging task especially for a large knowledge base. We identify communication cost in rule execution to be the primary basis for decomposing a global knowledge base into clusters for their allocation to sites. We show that the problem of optimal allocation is a 0–1 quadratic programming problem, which has prohhbitive execution times for large knowledge bases. We propose an efficient heuristic algorithm for rule allocation and study its performance experimentally. We represent a knowledge base as a hierarchy and characterize it in terms of height and inherent clusters with overlaps. The experimental results of the heuristic algorithm on random hierarchies as well as on hierarchies with varying heights and overlaps are seen to be close to the optimal solution.

[1]  Pauline Markenscoff,et al.  Task Allocation Problems in Distributed Computer Systems , 1986, ICPP.

[2]  Lawrence J. Watters Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems , 1967, Oper. Res..

[3]  Kemal Oflazer,et al.  Partitioning in parallel processing of production systems , 1987 .

[4]  Tzvi Raz,et al.  The knowledge base partitioning problem: Mathematical formulation and heuristic clustering , 1992, Data Knowl. Eng..

[5]  Letizia Tanca,et al.  Logic Programming and Databases , 1990, Surveys in Computer Science.

[6]  D.I. Moldovan,et al.  The Allocation Problem in Parallel Production Systems , 1990, J. Parallel Distributed Comput..

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[9]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[10]  Jaideep Srivastava,et al.  Production scheduling in database production systems , 1990, Systems Integration '90. Proceedings of the First International Conference on Systems Integration.

[11]  Mukesh K. Mohania,et al.  An architecture for a distributed deductive database system , 1993, Proceedings of TENCON '93. IEEE Region 10 International Conference on Computers, Communications and Automation.

[12]  Sudha Ram,et al.  An architecture for distributed knowledge based-systems , 1991, DATB.

[13]  Stefano Ceri,et al.  Distributed Databases: Principles and Systems , 1984 .

[14]  Harvey M. Salkin,et al.  Integer Programming , 2019, Engineering Optimization Theory and Practice.

[15]  Chris Moss Commercial Applications of Large Prolog Knowledge Bases , 1991, PDK.

[16]  Robin Liggett,et al.  The Quadratic Assignment Problem: An Experimental Evaluation of Solution Strategies , 1981 .

[17]  Yingnan Philip Li DKM - A Distributed Knowledge Representation Framework , 1988, Expert Database Conf..

[18]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[19]  J. Banerjee,et al.  Clustering a DAG for CAD Databases , 1988, IEEE Trans. Software Eng..

[20]  Robert J. K. Jacob,et al.  A Software Engineering Methodology for Rule-Based Systems , 1990, IEEE Trans. Knowl. Data Eng..

[21]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[22]  Jay Banerjee,et al.  Operations and implementation of complex objects , 1987, 1987 IEEE Third International Conference on Data Engineering.

[23]  Egon Balas,et al.  Discrete Programming by the Filter Method , 1967, Oper. Res..

[24]  Timos K. Sellis,et al.  Efficient compilation of large rule bases using logical access paths , 1990, Inf. Syst..