Record Details

RULE ALLOCATION IN DISTRIBUTED DEDUCTIVE DATABASE-SYSTEMS

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title RULE ALLOCATION IN DISTRIBUTED DEDUCTIVE DATABASE-SYSTEMS
 
Creator MOHANIA, MK
SARDA, NL
 
Subject deductive databases
distributed database systems
clustering
quadratic programming
 
Description 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 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 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.
 
Publisher ELSEVIER SCIENCE BV
 
Date 2011-07-26T15:15:57Z
2011-12-26T12:54:52Z
2011-12-27T05:43:12Z
2011-07-26T15:15:57Z
2011-12-26T12:54:52Z
2011-12-27T05:43:12Z
1994
 
Type Article
 
Identifier DATA & KNOWLEDGE ENGINEERING, 14(2), 117-141
0169-023X
http://dx.doi.org/10.1016/0169-023X(94)90041-8
http://dspace.library.iitb.ac.in/xmlui/handle/10054/6940
http://hdl.handle.net/10054/6940
 
Language en