Re: Data structure for indexing on multiple keys.

On Wed, 08 Sep 2004 18:15:34 +0530, Shankar wrote:

> 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?

Try a UB-tree: it is a relatively new extension of B-trees by the inventor (Bayer) to multidimensional information. The PDF of the original paper is

    http://wwwbayer.in.tum.de/cgi-webcon/webcon/lehrstuhldb/details/Veroeffentlichungen/num/54/1 His home page has many papers about its uses

    http://wwwbayer.in.tum.de/cgi-webcon/webcon/lehrstuhldb/details/Mitarbeiter/num/5/1

Cordially,
-paul-

-- 
Paul E. Black (p.black_at_acm.org)