The classical methods of fragmentation in a database distributed system helps, to a great extent, to make the information retrieval faster. This is particularly true for applications where the specifications are well known in advance at the time of the creation of the tables that compose the database which in some form or other, influenced the design and the definition of the type of fragmentation and their distribution on different sites of processing. Nevertheless, the above characteristics cannot be used in applications where the distributed management cannot do inferences that help it to know in what sites the data with some specific characteristics are located. Under these conditions the time and amount of work used by the participants in the query solution can be highly increased.

In this paper we show an approach,called the Virtual Fragmentation method. It works as an alternative way that allows us to diminish response time consumed by queries using horizontal fragmented tables.