Re: Data structure for indexing on multiple keys.
From: jerry gitomer <jgitomer_at_erols.com>
Date: Wed, 08 Sep 2004 09:08:44 -0400
Message-ID: <413f0463$0$6903$61fed72c_at_news.rcn.com>
Date: Wed, 08 Sep 2004 09:08:44 -0400
Message-ID: <413f0463$0$6903$61fed72c_at_news.rcn.com>
Shankar wrote:
> Hi,
>
> I have fair knowledge of B-tree and hash indexing mechanisms. What
> data structure/algorithms should I read upon if I want to create indexes
> on multiple keys of a same relation? For e.g if a Employee relation has
> EmpNo, EmpName, EmpSalary, EmpDepth attributes & users can query on any
> of these attributes. Do I create separate B-trees for each key?
>
> Please note that this is not about composite keys but supporting
> multiple keys for searching. Thanks in advance for inputs!
>
> Regards,
> Shankar
>
Since each index is a separate entity you can create separate
B-trees for each key.
Received on Wed Sep 08 2004 - 15:08:44 CEST