ANALISA METODE PENCARIAN HASH

Authors

  • Imelda Sri Duma Yanti Universitas Methodist Indonesia

DOI:

https://doi.org/10.46880/mtk.v2i1.20

Keywords:

Hash Methods, Linear Resolution

Abstract

Hash Methods Search efficiency use of a better place. Search relative (Hash Search) is divided into two kinds, namely Hash
Closed (Closed Hashing) and Hash Open (Open Hashing). On Closed Hash there is the possibility of more than one data has
a value the same function, causing a collision (collision). The way to overcome this collision can be done with some
strategies such as, Resolution Linear (Linear Resolution), and Double Hashing Overflow. Each - each strategy has its
advantages and disadvantages

Downloads

Published

10-09-2016

How to Cite

Imelda Sri Duma Yanti. (2016). ANALISA METODE PENCARIAN HASH. METHODIKA: Jurnal Teknik Informatika Dan Sistem Informasi, 2(1), 87–95. https://doi.org/10.46880/mtk.v2i1.20

Issue

Section

Articles