Improving Query Performance in Distributed Database

Abstract

In a rapidly growing digital world there is the possibility to query and discover data, but the most important issue is what resources are needed and how quickly data can be accessed. For several years ago, the grid systems, cloud systems and distributed database systems have replaced independent databases, because their computing power is much higher. In the case of distributed databases, stored in different nodes of a network, there may be chosen more channels of communication between nodes and therefore different time costs. In this paper a method is presented for selecting optimal routes between the nodes that are distributed to the system, depending on the system parameters, network characteristics, available resources and the volume of data that is to be transferred. Also, a method is shown to improve the time cost for multiple queries in distributed databases using the caching technique. To test and validate the method, a database to a web application was used in order to manage a chain of stores. Several scenarios were created for queries and the execution time for each scenario in part was measured through an interface designed specifically for testing.