On Mon, Mar 7, 2011 at 2:49 AM, Nick Raj
<nickrajjain@gmail.com> wrote:
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
Checkout below links:
http://www.postgresql.org/docs/8.2/static/gist-extensibility.htmlhttp://www.postgresql.org/docs/9.0/interactive/indexam.html--
Chetan Sutrave
Senior Software Engineer
EnterpriseDB Corporation
The Enterprise PostgreSQL Company
Phone: +91.20.30589523
Website:
www.enterprisedb.com EnterpriseDB Blog:
http://blogs.enterprisedb.com/Follow us on Twitter:
http://www.twitter.com/enterprisedbThis e-mail message (and any attachment) is intended for the use of the individual or entity to whom it is addressed. This message contains information from EnterpriseDB Corporation that may be privileged, confidential, or exempt from disclosure under applicable law. If you are not the intended recipient or authorized to receive this for the intended recipient, any use, dissemination, distribution, retention, archiving, or copying of this communication is strictly prohibited. If you have received this e-mail in error, please notify the sender immediately by reply e-mail and delete this message.
