Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes

Mostrar todas las versiones(2)

We propose static, dynamic and hybrid cost-awarepolicies for intersection caching and we introduce three different strategies to solve a query computing list intersections. We run experiments over a simulation framework using real data for both document collection and text queries. We observe that:...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Feuerstein, E., Tolosa, G.
Formato: CONF
Materias:
cost-aware policies
intersection caching
search engines
Costs
Search engines
Computing strategies
Cost saving
Cost-aware
Document collection
Dynamic policy
Hybrid policies
Simulation framework
Text query
Cost benefit analysis
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_15224902_v_n_p4_Feuerstein
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares