Querying fragmented relations in a distributed database

The paper discusses the query optimization problem in a distributed database system supporting a complex fragmentation schema, in which different fragments can share the same set of data. The fragmentation and the distribution of data are assumed to be transparent to the user, who queries the database in terms of the global relations. The optimization of queries stated on a single fragmented relation is considered, and a method for its solution is presented. The method is based on an algorithm which calculates a set of virtual fragments that can alternatively be used to answer the query.