From: | Steve Atkins <steve(at)blighty(dot)com> |
---|---|
To: | Alex Povolotsky <tarkhil(at)over(dot)ru> |
Cc: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Best implementation of PATRICIA |
Date: | 2007-08-25 19:02:18 |
Message-ID: | 4AE677D2-F5BB-4983-A807-FA8DF0794857@blighty.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Aug 25, 2007, at 11:37 AM, Alex Povolotsky wrote:
> Hello!
>
> I'm working on a project requiring fast query like 'does ADDRESS
> belongs to SET OF NETWORKS?'. Naturally, such a query is better
> implemented using PATRICIA, but building PATRICIA tree is a
> relatively long task and is better to be done once, for instance,
> at server startup.
>
> I'm thinking of implementing such a tree using stored procedures,
> and looking for advise from postgresql-hackers: how can I hook
> startup of server?
>
> Idea of having something like a blob to store and restore PATRICIA
> tree may be better suited to standard SQL, but I'm looking for more
> elegant solution. Or am I totally wrong?
>
Patricia is a nice algorithm, but I suspect you'd be much happier with
GIST and http://pgfoundry.org/projects/ip4r/
Cheers,
Steve
From | Date | Subject | |
---|---|---|---|
Next Message | Zeugswetter Andreas ADI SD | 2007-08-25 19:06:19 | Re: SQL feature requests |
Previous Message | Alex Povolotsky | 2007-08-25 18:37:48 | Best implementation of PATRICIA |