The growth of the amount of information available in Internet through the Web presents the challenge to satisfy, in the smaller possible time, the clients that makes queries and simultaneously to improve the efficient use of the resources. The models of parallel computation allow to approach this objective. This work presents a low-cost, efficient solution based on the computational model Bulk Synchronous Parallel, for the implementation of a parallel search engine that uses relational databases, in a Web framework.
|