Show simple item record

dc.contributor.authorFox, Edward A.en
dc.contributor.authorChen, Qi-Fanen
dc.contributor.authorDaoud, Amjad M.en
dc.date.accessioned2013-06-19T14:37:07Zen
dc.date.available2013-06-19T14:37:07Zen
dc.date.issued1991en
dc.identifierhttp://eprints.cs.vt.edu/archive/00000248/en
dc.identifier.urihttp://hdl.handle.net/10919/19644en
dc.description.abstractRapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but is generally not appropriate when sequential or range searches are also required. This paper describes a hashing method, developed for collections that are relatively static, that supports both direct and sequential access. The algorithms described give hash functions that are optimal in terms of time and hash table space utilization, and that preserve any a priori ordering desired. Furthermore, the resulting order preserving minimal perfect hash functions (OPMPHFs) can be found using time and space that are linear in the number of keys involved and so are close to optimal.en
dc.format.mimetypeapplication/pdfen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleOrder Preserving Minimal Perfect Hash Functions and Information Retrievalen
dc.typeTechnical reporten
dc.contributor.departmentComputer Scienceen
dc.identifier.trnumberTR-91-01en
dc.type.dcmitypeTexten
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000248/01/TR-91-01.pdfen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record