Red-Black Tree Database
From: Deepak <deepakmani_at_yahoo.com>
Date: 28 May 2004 11:17:23 -0700
Message-ID: <2dac29b8.0405281017.11ee51ed_at_posting.google.com>
Hi,
I was not sure whether my question pertains more to databases or more to tree algorithms. I am currently working on a project where I have a red black tree whose key is an aggregate object containing 3 unique identifiers. Now inOrder to search effectively I ideally want the most efficient result given for any either of the three keys. I considered just using one primary key, but that would make things too simple. My knowledge of databases and database concepts is fairly limited, but I wont let that come in the way.
Advance thanks to everyone for posting your response. Received on Fri May 28 2004 - 20:17:23 CEST
Date: 28 May 2004 11:17:23 -0700
Message-ID: <2dac29b8.0405281017.11ee51ed_at_posting.google.com>
Hi,
I was not sure whether my question pertains more to databases or more to tree algorithms. I am currently working on a project where I have a red black tree whose key is an aggregate object containing 3 unique identifiers. Now inOrder to search effectively I ideally want the most efficient result given for any either of the three keys. I considered just using one primary key, but that would make things too simple. My knowledge of databases and database concepts is fairly limited, but I wont let that come in the way.
Advance thanks to everyone for posting your response. Received on Fri May 28 2004 - 20:17:23 CEST