Editing Hash table (section)

===Caches===
{{Main|Cache (computing) }}
Hash tables can be used to implement [[cache (computing)|caches]], auxiliary data tables that are used to speed up the access to data that is primarily stored in slower media. In this application, hash collisions can be handled by discarding one of the two colliding entries—usually erasing the old item that is currently stored in the table and overwriting it with the new item, so every item in the table has a unique hash value.<ref>{{cite journal |last1=Zhong |first1=Liang |last2=Zheng |first2=Xueqian |last3=Liu |first3=Yong |last4=Wang |first4=Mengting |last5=Cao |first5=Yang |title=Cache hit ratio maximization in device-to-device communications overlaying cellular networks |journal=China Communications |date=February 2020 |volume=17 |issue=2 |pages=232–238 |doi=10.23919/jcc.2020.02.018 |s2cid=212649328 }}</ref><ref>{{cite web|url=https://www.linuxjournal.com/article/7105|publisher=[[Linux Journal]]|access-date=16 April 2022|date=1 January 2004|title=Understanding Caching|first=James|last=Bottommley|url-status=live|archive-url=https://web.archive.org/web/20201204195114/https://www.linuxjournal.com/article/7105|archive-date=4 December 2020}}</ref>