Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"perfect hashing"”.

  1. Perfect hashing and related problems

    … a dictionary to a hash table with collisions, a perfect hash function maps the words in a dictionary to a hash table with no collisions. Thus, perfect hashing is a special case of hashing, in which a find operation takes 𝑂(1) time in the worst case, and an insert or a delete operation takes 𝑂(1) …

    vt Repository record for Perfect hashing and related problems (opens in a new tab)

  2. Application of minimal perfect hashing in main memory indexing

    Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.

    mit Repository record for Application of minimal perfect hashing in main memory indexing (opens in a new tab)

  3. An object-oriented database system for efficient information retrieval applications

    … structures and algorithms (a class of minimal perfect hashing functions) for the efficient implementation of the LEND model is also reported. These data structures and algorithms enable retrieval of a node or a set of nodes in an optimal fashion. Placement of a large graph on a disk is studied …

    vt Repository record for An object-oriented database system for efficient information retrieval applications (opens in a new tab)

  4. Generování Content Adressable Delayed DFA z regulárních výrazů

    Práce se zabývá konstrukcí rozšířených typů konečných automatů ze sad regulárních výrazů.Hlavní důraz je na rozšíření CD2FA - Content Addressed Delayed Input DFA, které je navrženo k použití při hloubkové analýze paketů v síti, za účelem snížení paměťové náročnosti a zachování rychlosti výpočtu. …

    brno-tech Repository record for Generování Content Adressable Delayed DFA z regulárních výrazů (opens in a new tab)