DSpace logo

Please use this identifier to cite or link to this item: https://repository.uksw.edu/handle/123456789/1012
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPrestiliano, Jasson
dc.descriptionAiti : Jurnal Teknologi Informasi, Vol. 4, No. 1, Februari 2007, p. 41-56id
dc.description.abstractHash table is one of the data structure algorithms that can make sorting and searching easier. It distributes data to rows and columns with certain keys. It also cuts the time cost of data searching, because it searches the data from certain row and column from the memory by using the key. Besides, it can be implemented in pattern finding in search engine, data archiving and many other applications. This article explains the basic of hash table, its advantages and how to overcome data collisions. It also provides an example of hash table implementation in pattern finding.en_US
dc.publisherFakultas Teknologi Informasi UKSWid
dc.subjecthash tableen_US
dc.subjectdata structureen_US
dc.subjectdata searchingen_US
dc.titleAplikasi Tabel Hash dalam Pengarsipan dan Pencarian Dataid
Appears in Collections:Aiti 2007 Vol. 4 No. 1 Februari

Files in This Item:
File Description SizeFormat 
ART_Jasson Prestiliano_Aplikasi tabel hash_Abstract.pdfAbstract909 kBAdobe PDFView/Open
ART_Jasson Prestiliano_Aplikasi tabel hash_Full text.pdfFull text857.25 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.