From 22b82de9b906bd0510ac4680b712cbc4ebc0668c Mon Sep 17 00:00:00 2001 From: fc_botelho Date: Sun, 30 Mar 2008 00:59:30 +0000 Subject: [PATCH] *** empty log message *** --- NEWSLOG.t2t | 5 ++++- README.t2t | 6 ++++++ 2 files changed, 10 insertions(+), 1 deletion(-) diff --git a/NEWSLOG.t2t b/NEWSLOG.t2t index c4a7bba..25ad2ce 100644 --- a/NEWSLOG.t2t +++ b/NEWSLOG.t2t @@ -7,7 +7,10 @@ News Log ==News for version 0.8== -- [An algorithm to generate MPHFs that require around 2.62 bits per key to be stored bdz.html], which is referred to as BDZ algorithm. The algorithm is the fastest one available in the literature for sets that can be treated in internal memory. +- [An algorithm to generate MPHFs that require around 2.6 bits per key to be stored bdz.html], which is referred to as BDZ algorithm. The algorithm is the fastest one available in the literature for sets that can be treated in internal memory. +- [An algorithm to generate PHFs with range m = cn, for c > 1.22 bdz.html], which is referred to as BDZ_PH algorithm. It is actually the BDZ algorithm without the ranking step. The resulting functions can be stored in 1.95 bits per key for //c = 1.23// and are considerably faster than the MPHFs generated by the BDZ algorithm. +- An adapter to support a vector of struct as the source of keys has been added. +- An API to support the ability of packing a perfect hash function into a preallocated contiguous memory space. The computation of the packed function is still faster and can be easily mmapped. - The hash functions djb2, fnv and sdbm were removed because they do not use random seeds and therefore are not useful for MPHFs algorithms. - All reported bugs and suggestions have been corrected and included as well. diff --git a/README.t2t b/README.t2t index 4f29513..a2fb75c 100644 --- a/README.t2t +++ b/README.t2t @@ -82,6 +82,8 @@ The CMPH Library encapsulates the newest and more efficient algorithms in an eas - [An algorithm to generate MPHFs that require around 2.6 bits per key to be stored bdz.html], which is referred to as BDZ algorithm. The algorithm is the fastest one available in the literature for sets that can be treated in internal memory. - [An algorithm to generate PHFs with range m = cn, for c > 1.22 bdz.html], which is referred to as BDZ_PH algorithm. It is actually the BDZ algorithm without the ranking step. The resulting functions can be stored in 1.95 bits per key for //c = 1.23// and are considerably faster than the MPHFs generated by the BDZ algorithm. +- An adapter to support a vector of struct as the source of keys has been added. +- An API to support the ability of packing a perfect hash function into a preallocated contiguous memory space. The computation of the packed function is still faster and can be easily mmapped. - The hash functions djb2, fnv and sdbm were removed because they do not use random seeds and therefore are not useful for MPHFs algorithms. - All reported bugs and suggestions have been corrected and included as well. @@ -165,8 +167,12 @@ int main(int argc, char **argv) } ``` Download [file_adapter_ex2.c examples/file_adapter_ex2.c] and [keys.txt examples/keys.txt] + +[Click here to see more examples examples.html] -------------------------------------- + + ==The cmph application== cmph is the name of both the library and the utility