LEND and Faster Algorithms for Constructing Minimal Perfect Hash Functions

Simple item page
dc.contributor.authorFox, Edward A.en
dc.contributor.authorChen, Qi-Fanen
dc.contributor.authorHeath, Lenwood S.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:40Zen
dc.date.available2013-06-19T14:36:40Zen
dc.date.issued1992en
dc.description.abstractThe Large External object-oriented Network Database (LEND) system has been developed to provide efficient access to large collections of primitive or multimedia objects, semantic networks, thesauri, hypertexts, and information retrieval collections. An overview of LEND is given, emphasizing aspects that yield efficient operation. In particular, a new algorithm is described for quickly finding minimal perfect hash functions whose specification space is very close to the theoretical lower bound, i.e., around 2 bits per key. The various stages of processing are detailed, along with analytical and empirical results, including timing for a set of over 3.8 million keys that was processed on a NeXTstation in about 6 hours.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000282/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000282/01/TR-92-02.pdfen
dc.identifier.trnumberTR-92-02en
dc.identifier.urihttp://hdl.handle.net/10919/19714en
dc.language.isoenen
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.titleLEND and Faster Algorithms for Constructing Minimal Perfect Hash Functionsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-92-02.pdf
Size:
946.76 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports