From: | Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us> |
---|---|
To: | Alfred Perlstein <bright(at)wintelcom(dot)net> |
Cc: | Peter Eisentraut <peter_e(at)gmx(dot)net>, hackers(at)postgreSQL(dot)org |
Subject: | Re: [HACKERS] gperf anyone? |
Date: | 2000-01-19 01:52:17 |
Message-ID: | 200001190152.UAA11497@candle.pha.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
> A perfect hash should be much faster at the trivial expense of some space.
>
> >From the distribution:
> While teaching a data structures course at University of California,
> Irvine, I developed a program called GPERF that generates perfect hash
> functions for sets of key words. A perfect hash function is simply:
>
> A hash function and a data structure that allows
> recognition of a key word in a set of words using
> exactly 1 probe into the data structure.
>
>
> > We also can not distribute GNU code.
>
> I'm pretty sure that the code the gperf outputs is not covered under the
> GPL, just gperf itself.
>
Can you run our keywords.c using our method and gperf and see if there
is any speed difference?
--
Bruce Momjian | http://www.op.net/~candle
pgman(at)candle(dot)pha(dot)pa(dot)us | (610) 853-3000
+ If your life is a hard drive, | 830 Blythe Avenue
+ Christ can be your backup. | Drexel Hill, Pennsylvania 19026
From | Date | Subject | |
---|---|---|---|
Next Message | Bruce Momjian | 2000-01-19 02:04:11 | Re: [HACKERS] Index recreation in vacuum |
Previous Message | Bruce Momjian | 2000-01-19 01:50:50 | Re: [HACKERS] Index recreation in vacuum |