From: | Nick Raj <nickrajjain(at)gmail(dot)com> |
---|---|
To: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Composite Index Structure |
Date: | 2011-03-07 06:07:02 |
Message-ID: | AANLkTimR7JWGAbfSiD+u_M1iDSo=O3reAyGD_0QsnNPC@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Hi all,
I want to construct an "Composite Index Structure" i.e. a combination of
gist and btree.
What i am thinking is that first creating a Rtree structure that is pointing
to another Btree structure.
For example, Suppose i want to find vehicles between 2 to 4 pm on 14/2/2011
on X road.
I am thinking of creating rtree structure for road network and then btree
for time. For reaching X road i use Rtree, and from there btree begin i.e.
leaf node of rtree contains the pointer to root node of btree ( in this way
i have all time belonging to X road)
My question is that how to implement this composite index structure in
postgres?
Let us suppose, if i create mygist index, then i have to write my own
operator class?
or
can i use gist index as it is and btree tree as it is. I mean their operator
class and their gist methods but how to establish linkage between them?
Any idea ??
Thanks
Raj
From | Date | Subject | |
---|---|---|---|
Next Message | Heikki Linnakangas | 2011-03-07 07:03:19 | Re: Composite Index Structure |
Previous Message | Simon Riggs | 2011-03-07 00:37:04 | Re: Sync Rep v19 |