The effect of index partitioning schemes on the performance of distributed query processing

An indexing scheme called partitioned global indexes (PGI) for a locally distributed database system is presented. The scheme builds a global index for the entire relation and partitions the index across the sites. A strategy for processing such an index is also presented. In order to evaluate the performance of the scheme, a simulation model is developed. The simulation results are compared to the classical scheme, called partial indexes (PI), in which corresponding index and data entries are stored at the same site. The advantages and disadvantages of the indexing schemes when processing conjuctive queries are analytically investigated. Analysis and simulation experiments show that tradeoffs between the new and the classical scheme