From: | "Merlin Moncure" <merlin(dot)moncure(at)rcsonline(dot)com> |
---|---|
To: | <pgsql(at)mohawksoft(dot)com> |
Cc: | <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: New form of index "persistent reference" |
Date: | 2005-02-10 18:26:34 |
Message-ID: | 6EE64EF3AB31D5448D0007DD34EEB3412A7619@Herge.rcsinc.local |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
> Lately, I have been thinking that a cool form of index would be some
sort
> of "persistent reference" index. Like the old ISAM days of yore, a
fixed
> number could point you right to the row that you want. I'm not sure if
the
> "persistent reference" is a specific auto numbering column type or
> separate index structure or both.
What you are talking about is a 'relative file'. It turns out on modern
ISAM file systems, the win you get over b-tree indexing is not worth
losing the ability to do simple things like run-length compression on
strings.
Anyways, while storing a physical offset is O(1), so is computing a
hash. How would a hash index not fill your need?
Merlin
From | Date | Subject | |
---|---|---|---|
Next Message | Hicham G. Elmongui | 2005-02-10 19:07:03 | enforcing a plan (in brief) |
Previous Message | pgsql | 2005-02-10 18:12:19 | Re: New form of index "persistent reference" |