2 Apr 1996 23:36:51 -0500

Related articles |
---|

Is Minimal Perfect Hashing the wrong algorithm? cef@geodesic.com (Charles Fiterman) (1996-04-02) |

Is Minimal Perfect Hashing the wrong algorithm? - comp.compilers #9199 det@sw.stratus.com (Dave Toland) (1996-04-04) |

Re: Is Minimal Perfect Hashing the wrong algorithm? fjh@cs.mu.OZ.AU (1996-04-04) |

Re: Is Minimal Perfect Hashing the wrong algorithm? preston@tera.com (1996-04-06) |

Re: Is Minimal Perfect Hashing the wrong algorithm? krotoff@boy.nmd.msu.ru (Alexander Krotoff) (1996-04-07) |

Is Minimal Perfect Hashing the wrong algorithm? preston@tera.com (1996-04-08) |

Re: Is Minimal Perfect Hashing the wrong algorithm chase@centerline.com (1996-04-08) |

[5 later articles] |

From: | Charles Fiterman <cef@geodesic.com> |

Newsgroups: | comp.compilers |

Date: | 2 Apr 1996 23:36:51 -0500 |

Organization: | Geodesic Systems |

Keywords: | question, theory |

Many compiler writers use Minimal Perfect Hashing to generate some

hash tables such as a key word table.

But this algorithm minimizes table size. Shouldn't it minimize lookup

time with a cap on table size? That is shouldn't it look at the time

required to create a hash from an entry?

And in this light maybe synonyms aren't so bad if the second entry in

the bucket is something rare and misses are also rare.

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.