TY - JOUR AU - Zulfa, Mulki Indana AU - Muhammad Syaiful Aliim, AU - Ari Fadli, AU - Waleed Ali, PY - 2023/08/21 Y2 - 2025/11/14 TI - CACHE DATA REPLACEMENT POLICY BASED ON RECENTLY USED ACCESS DATA AND EUCLIDEAN DISTANCE JF - Jurnal Teknik Informatika (Jutif) JA - J. Tek. Inform. (JUTIF) VL - 4 IS - 4 SE - Articles DO - 10.52436/1.jutif.2023.4.4.1244 UR - https://jutif.if.unsoed.ac.id/index.php/jurnal/article/view/1244 SP - 875-881 AB - <p>Data access management in web-based applications that use relational databases must be well thought out because the data continues to grow every day. The Relational Database Management System (RDBMS) has a relatively slow access speed because the data is stored on disk. This causes problems with decreased database server performance and slow response times. One strategy to overcome this is to implement caching at the application level. This paper proposed SIMGD framework that models Application Level Caching (ALC) to speed up relational data access in web applications. The ALC strategy maps each controller and model that has access to the database into a node-data in the in-Memory Database (IMDB). Not all node-data can be included in IMDB due to limited capacity. Therefore, the SIMGD framework uses the Euclidean distance calculation method for each node-data with its top access data as a cache replacement policy. Node-data with Euclidean distance closer to their top access data have a high priority to be maintained in the caching server. Simulation results show at the 25KB cache configuration, the SIMGD framework excels in achieving hit ratios compared to the LRU algorithm of 6.46% and 6.01%, respectively.</p> ER -