Conferencia

Feuerstein, E.; Tolosa, G."Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes" (2017) 32nd International Conference of the Chilean Computer Science Society, SCCC 2013:4-7
Estamos trabajando para incorporar este artículo al repositorio
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

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: a) cost-aware policies outperform cost-oblivious policies, b) static policies are better than dynamic policies (as in posting list caching), c) hybrid policies outperform the previous ones achieving up to 29% of cost savings and d) computing strategies that try to maximize cache usage have a better performance than the a-priori most efficient ones. © 2015 IEEE.

Registro:

Documento: Conferencia
Título:Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes
Autor:Feuerstein, E.; Tolosa, G.
Filiación:Depto. de Computación, FCEyN, UBA, Argentina
Depto. de Cs.Básicas, UNLu, Argentina
Palabras clave: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
Año:2017
Página de inicio:4
Página de fin:7
DOI: http://dx.doi.org/10.1109/SCCC.2013.23
Handle:http://hdl.handle.net/20.500.12110/paper_15224902_v_n_p4_Feuerstein
Título revista:32nd International Conference of the Chilean Computer Science Society, SCCC 2013
Título revista abreviado:Proc. Int. Conf. Chilean Comput. Sci. Soc. SCCC
ISSN:15224902
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15224902_v_n_p4_Feuerstein

Referencias:

  • Tatikonda, S., Cambazoglu, B.B., Junqueira, F.P., Posting list intersection on multicore architectures (2011) Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 963-972. , ser. SIGIR '11. New York, NY, USA: ACM
  • Barroso, L.A., Dean, J., Hölzle, U., Web search for a planet: The google cluster architecture (2003) IEEE Micro, 23 (2), pp. 22-28. , Mar
  • Baeza-Yates, R., Ribeiro-Neto, B., (2011) Modern Information Retrieval: The Concepts and Technology behind Search, , 2nd ed. Addison-Wesley Professional, Inc
  • Markatos, E., On caching search engine query results (2001) Comput. Commun., 24 (2), pp. 137-143. , Feb
  • Long, X., Suel, T., Three-level caching for efficient query processing in large web search engines (2005) Proceedings of the 14th International Conference on World Wide Web, pp. 257-266. , ser. WWW '05. New York, NY, USA: ACM
  • Saraiva, P.C., Silva De-Moura, E., Ziviani, N., Meira, W., Fonseca, R., Riberio-Neto, B., Rank-preserving two-level caching for scalable search engines (2001) Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 51-58. , ser. SIGIR '01. New York, NY, USA: ACM
  • Baeza-Yates, R., Gionis, A., Junqueira, F., Murdock, V., Plachouras, V., Silvestri, F., The impact of caching on search engines (2007) Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 183-190. , ser. SIGIR '07. New York, NY, USA: ACM
  • Zhang, J., Long, X., Suel, T., Performance of compressed inverted list caching in search engines (2008) Proceedings of the 17th International Conference on World Wide Web, pp. 387-396. , ser. WWW '08. New York, NY, USA: ACM
  • Fagni, T., Perego, R., Silvestri, F., Orlando, S., Boosting the performance of web search engines: Caching and prefetching query results by exploiting historical usage data (2006) ACM Trans. Inf. Syst., 24 (1), pp. 51-78. , Jan
  • Gan, Q., Suel, T., Improved techniques for result caching in web search engines (2009) Proceedings of the 18th International Conference on World Wide Web, pp. 431-440. , ser. WWW '09. New York, NY, USA: ACM
  • Young, N.E., On-line file caching (1998) Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 82-86. , ser. SODA '98. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics
  • Ozcan, R., Altingovde, I.S., Ulusoy, O., Cost-aware strategies for query result caching in web search engines (2011) ACM Trans. Web, 5 (2), pp. 1-9. , May
  • Cao, P., Irani, S., Cost-aware www proxy caching algorithms (1997) Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems, p. 18. , ser. USITS'97. Berkeley, CA, USA: USENIX Association
  • Pass, G., Chowdhury, A., Torgeson, C., A picture of search (2006) Proceedings of the 1st International Conference on Scalable Information Systems, , ser. InfoScale '06. New York, NY, USA: ACMA4 -

Citas:

---------- APA ----------
Feuerstein, E. & Tolosa, G. (2017) . Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes. 32nd International Conference of the Chilean Computer Science Society, SCCC 2013, 4-7.
http://dx.doi.org/10.1109/SCCC.2013.23
---------- CHICAGO ----------
Feuerstein, E., Tolosa, G. "Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes" . 32nd International Conference of the Chilean Computer Science Society, SCCC 2013 (2017) : 4-7.
http://dx.doi.org/10.1109/SCCC.2013.23
---------- MLA ----------
Feuerstein, E., Tolosa, G. "Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes" . 32nd International Conference of the Chilean Computer Science Society, SCCC 2013, 2017, pp. 4-7.
http://dx.doi.org/10.1109/SCCC.2013.23
---------- VANCOUVER ----------
Feuerstein, E., Tolosa, G. Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes. Proc. Int. Conf. Chilean Comput. Sci. Soc. SCCC. 2017:4-7.
http://dx.doi.org/10.1109/SCCC.2013.23