The self-indexed search algorithm: a bit-level approach to minimal perfect hashing

DOI10.1016/S0020-0190(99)00016-2zbMATH Open1338.68055OpenAlexW2060748074MaRDI QIDQ294669FDOQ294669

Authors: Marco A. Torres, Susumu Kuroyanagi, Akira Iwata 

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099000162?np=y

Recommendations

• scientific article; zbMATH DE number 1688373
• Experimental and Efficient Algorithms
• Theory and practice of monotone minimal perfect hashing
• Theory and practice of monotone minimal perfect hashing
• An informal analysis of perfect hash function search
• Fast and scalable minimal perfect hashing for massive key sets
• Hashing and indexing: succinct data structures and smoothed analysis
• scientific article; zbMATH DE number 88958

zbMATH Keywords

data structuresminimal perfect hashingsearch algorithms

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cites Work

• An optimal algorithm for generating minimal perfect hash functions
• Title not available (Why is that?)
• Reciprocal hashing
• Title not available (Why is that?)
• Perfect hashing functions
• Title not available (Why is that?)

Cited In (3)

• Hash Bit Selection for Nearest Neighbor Search
• An optimal algorithm for generating minimal perfect hash functions
• Fast and scalable minimal perfect hashing for massive key sets

This page was built for publication: The self-indexed search algorithm: a bit-level approach to minimal perfect hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294669)