Query Processing In Distributed Database Through Data Distribution

Abstract: Query processing in a distributed system requires the transmission of data between computers in a network. The arrangement of data transmissions and local data processing is known as a distribution strategy for a query. Two cost measures, response time and total time are used to judge the quality of a distribution strategy. Various algorithms are used that derive distribution strategies which have minimal response time and minimal total time, for a special class of queries. The optimal algorithms are used as a basis to develop a general query processing algorithm. The integration of a query processing subsystem into a distributed database management system is used for analyzing query response time across fragmentations of global relations. Distributed query processing is an important factor in the overall performance of a distributed database system. The database queries access the applications on the distributed database sites thus the main problem incurred is the minimization of the total operating cost i.e. communication cost and processing In order to optimize queries accurately, adequate information must be accessible to determine which data access techniques are most effective e.g. table and column cardinality, organization information, and index availability.

Keywords: Fragmentation, optimize queries, table and column cardinality, index