A LETTER-ORIENTED PERFECT HASHING SCHEME BASED UPON SPARSE TABLE COMPRESSION
| dc.citation.epage | 49 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 35 | en_US |
| dc.citation.volume | 21 | en_US |
| dc.citation.woscount | 6 | |
| dc.contributor.author | CHANG, CC | en_US |
| dc.contributor.author | WU, TC | en_US |
| dc.contributor.department | 資訊科學與工程研究所 | zh_TW |
| dc.contributor.department | Institute of Computer Science and Engineering | en_US |
| dc.date.accessioned | 2014-12-08T15:05:24Z | |
| dc.date.available | 2014-12-08T15:05:24Z | |
| dc.date.issued | 1991-01-01 | en_US |
| dc.description.abstract | In 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.identifier.issn | 0038-0644 | en_US |
| dc.identifier.journal | SOFTWARE-PRACTICE & EXPERIENCE | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3938 | |
| dc.identifier.wosnumber | WOS:A1991EV05600003 | |
| dc.language.iso | en_US | en_US |
| dc.subject | PERFECT HASHING FUNCTIONS | en_US |
| dc.subject | LETTER-ORIENTED HASHING | en_US |
| dc.subject | SPARSE TABLE COMPRESSION | en_US |
| dc.subject | ROW DISPLACEMENT METHOD | en_US |
| dc.title | A LETTER-ORIENTED PERFECT HASHING SCHEME BASED UPON SPARSE TABLE COMPRESSION | en_US |
| dc.type | Article | en_US |