Reducing Cache Pollution in GDFS Cache Algorithm Using Normalized Google Distance (NGD) for Semantic Similarity

Authors

  • Ihab Aldibaja Manara University

Keywords:

Web Cache – information Retrieval Systems, Cache Pollution – GDFS – Greedy Dual, Semantic Web - Normalized Google Distance.

Abstract

Cache is considered as one of techniques that effectively contributes in enhancing performance of information retrieval systems. Web cache which is the cache technology specified for web is one of the tools for enhancing response time in web-bases information systems (WIS). That’s can be done by algorithms which varying in its replacement function. We study in this paper how to reduce hot cache pollution and cold cache pollution which may affects GDFS (Greedy Dual Frequency Size) web cache algorithm. This algorithm is considered as a fundamental web cache algorithm, by improving replacement function using Normalized Google Distance (NGD) between cache objects. Results shows that employing semantic similarity concept to GDFS replacement function have had reduced cache pollution by improving the control of existence of objects in cache memory and collaboration with original function of GDFS algorithm in evaluation the existence of objects in cache and thus improving hit rate of objects from cache memory instead of original data source

Published

2021-09-21

How to Cite

1.
Aldibaja I. Reducing Cache Pollution in GDFS Cache Algorithm Using Normalized Google Distance (NGD) for Semantic Similarity . Tuj-eng [Internet]. 2021Sep.21 [cited 2021Dec.1];43(4). Available from: http://journal.tishreen.edu.sy/index.php/engscnc/article/view/10929