CS - 3. Common Algorithms - 3.4. Cache - 3.4.3 MFU Cache 💡MFU Cache is another cache algorithm. The difference is that instead of deleting the least frequently used entry, the MFU Cache deletes the most frequently used entry. MFU 캐시는 또 다른 캐시 알고리즘입니다. 차이점은 사용 빈도가 가장 낮은 항목을 삭제하는 대신 가장 자주 사용되는 항목을 삭제한다는 점입니다. MFU(Most Frequently Used) Cache는 이름에서 알 수 있듯이 가장 자주 사용되는 항목을 캐시에 보관하는 캐싱 알고리즘입니다. 이 알고리즘은 ..

CS - 3. Common Algorithms - 3.4. Cache - 3.4.2 LFU Cache 💡LFU Cache is a data structure that stores key-value pairs. It has a fixed size and when it is full, it removes the least frequently used key-value pair. It is a variation of the LRU Cache and is used in many applications such as caching web pages, caching database queries, and caching images. LFU 캐시는 키-값 쌍을 저장하는 데이터 구조입니다. 크기가 고정되어 있으며, 크..

CS - 3. Common Algorithms - 3.4. Cache - 3.4.1 LRU Cache 3.4. Cache 💡Cache algorithms are used to manage the cache memory of a computer. Cache memory is a small amount of memory that is used to store data that is frequently accessed. This allows the computer to access the data faster than if it had to go to the main memory. Cache algorithms are used to determine which data should be stored in th..