Load balancing in distributed query management at web enabled systems

Every day more and more Business are using web as compulsory medium to provide services. Ever increase in technological advancement leads more devices and applications are accessing web based application around the clock. So single node web applications are prone collapse, designing an application with Distributed frame work and mange those application often reduce the risk of single point failure. In that strategy load balancers plays an important role to direct the traffic to multiple Servers. Existing load balancers are Prone to fail and centralized strategy to distribute the load among the server. Our proposed heuristic based load balancer follows Decentralized approach to solve the problem and our ANN based supervised back propagation technique gives optimized results that existing Load balancer

An optimization of queries in distributed database systems

This paper addresses the processing of a query in distributed database systems using a sequence of semijoins. The objective is to minimize the intersite data traffic incurred by a distributed query. A method is developed which accurately and efficiently estimates the size of an intermediate result of a query. This method provides the basis of the query optimization algorithm. Since the distributed query optimization problem is known to be intractable, a heuristic algorithm is developed to determine a low-cost sequence of semijoins. The cost comparison with an existing algorithm is provided. The complexity of the main features of the algorithm is analytically derived. The scheduling time for sequences of semijoins is measured for example queries using the PASCAL program which implements the algorithm. All rights of reproduction in any form reserved.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/26357/1/0000444.pd