This paper proposes a cache hierarchy that enables Web search engines to efficiently
process user queries. The different caches in the hierarchy are used to store pieces of data …

This paper proposes using Coloured Petri Nets to model performance of vertical search
engines for Web search. In such systems, queries submitted by users or client systems are …

This paper proposes a two-level P2P caching strategy for Web search queries. The design is
suitable for a fully distributed service platform based on managed peer boxes (set-top-box or …

Large search engines are complex systems composed by several services. Each service is
composed by a set of distributed processing nodes dedicated to execute a single operation …

Web search engines have to deal with a rapidly increasing amount of information, high
query loads and tight performance constraints. The success of a search engine depends on …

Web search engines are composed of a large set of search nodes and a broker machine
that feeds them with queries. A location cache keeps minimal information in the broker to …

Large Web search engines are constructed as a collection of services that are deployed on
dedicated clusters of distributed-memory processors. In particular, efficient user query …

This paper proposes a method for reducing the number of search nodes involved in the
solution of queries arriving to a Web search engine. The method is applied by the query …

Parallel simulation is a powerful tool to evaluate the performance of large-scale systems.
However when it comes to simulating large scale Web search engines, the parallel …

Los Motores de Búsqueda Web (WSEs) actuales están formados por cientos de nodos de
procesamiento, los cuales están particionados en grupos llamados servicios. Cada servicio …