Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal METHODIKA: Jurnal Teknik Informatika dan Sistem Informasi
Imelda Sri Duma Yanti
Universitas Methodist Indonesia
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
ANALISA METODE PENCARIAN HASH Imelda Sri Duma Yanti
METHODIKA: Jurnal Teknik Informatika dan Sistem Informasi Vol. 2 No. 1 (2016): Maret 2016
Publisher : Universitas Methodist Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46880/mtk.v2i1.20

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
Co-Authors