A Heuristic for Rule Allocation in Distributed Deductive Database Systems
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. It has been shown that the problem of optimal allocation is a 0–1 quadratic programming problem, which has prohibitive 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 of rules. These rules are then allocated in a bottom-up fashion w.r.t. the hierarchy. The experimental results of the heuristic algorithm on random hierarchies as well as on hierarchies with varying heights are seen to be close to the optimal solution.
KeywordsKnowledge Base Heuristic Algorithm Communication Cost Dependency Graph Quadratic Programming Problem
Unable to display preview. Download preview PDF.
- D.A. Carlson and S. Ram. An architecture for distributed knowledge base systems. DATA BASE,22(1):11–21, 1991.Google Scholar
- S. Ceri and G. Pelagatti. Distributed Databases: Principles and Systems. McGraw-Hill Book Co., 1986.Google Scholar
- J.R. Chang and A.R. Hurson. Effective clustering of complex objects in OODB.In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 22–31, May 1991.Google Scholar
- M.A. Jabri. A prolog knowledge based systems shell for vlsi cad. In 27th Design Automation Conference, IEEE CS Press, pages 272–277, June 1990.Google Scholar
- Anil K. Jain and R.C. Dubes. Algorithms for Clustering Data. Prentice Hall Advanced Series, 1988.Google Scholar
- W. Kim, H.T. Chou, and J. Banerjee. Operations and implementation of complex objects. In Proc. 3rd Int. Conf. on Data Engg., pages 626–633, 1987.Google Scholar
- Y.P. Li. DKM: A distributed knowledge representation framework. In Proc. 2nd Int. Conf. on Expert Database, pages 313–331, 1988.Google Scholar
- P. Markenscoff and W. Liaw. Task allocation problems in distributed computer systems. In Proc. Int. Conf. on Parallel Processing, pages 953–960, 1986.Google Scholar
- M.K. Mohania. Decomposition of a knowledge base for a distributed deductive database system. In 4 th Int-Conf. on Management of Data, Bangalore India, pages 94–106, Dec. 1992.Google Scholar
- M.K. Mohania and N.L. Sarda. An architecture for a distributed deductive database system. Appearing in IEEE TENCON′93, Bezing, China, 1993.Google Scholar
- K. Oflazer. Partitioning in parallel processing of production systems. In Proc. Int. Conf. on Parallel Processing, pages 92–100, 1984.Google Scholar