1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANG, CCen_US
dc.contributor.authorWU, TCen_US
dc.date.accessioned2014-12-08T15:05:24Z-
dc.date.available2014-12-08T15:05:24Z-
dc.date.issued1991-01-01en_US
dc.identifier.issn0038-0644en_US
dc.identifier.urihttp://hdl.handle.net/11536/3938-
dc.description.abstractIn this paper, a new letter-oriented perfect hashing scheme based on Ziegler's row displacement method is presented. A unique n-tuple from a given set of static letter-oriented key words can be extracted by a heuristic algorithm. Then the extracted distinct n-tuples are associated with a 0/1 sparse matrix. Using a sparse matrix compression technique, a perfect hashing function on the key words is then constructed.en_US
dc.language.isoen_USen_US
dc.subjectPERFECT HASHING FUNCTIONSen_US
dc.subjectLETTER-ORIENTED HASHINGen_US
dc.subjectSPARSE TABLE COMPRESSIONen_US
dc.subjectROW DISPLACEMENT METHODen_US
dc.titleA LETTER-ORIENTED PERFECT HASHING SCHEME BASED UPON SPARSE TABLE COMPRESSIONen_US
dc.typeArticleen_US
dc.identifier.journalSOFTWARE-PRACTICE & EXPERIENCEen_US
dc.citation.volume21en_US
dc.citation.issue1en_US
dc.citation.spage35en_US
dc.citation.epage49en_US
dc.contributor.department資訊科學與工程研究所zh_TW
dc.contributor.departmentInstitute of Computer Science and Engineeringen_US
dc.identifier.wosnumberWOS:A1991EV05600003-
dc.citation.woscount6-
Appears in Collections:Articles


Files in This Item:

  1. A1991EV05600003.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...