if db2 udb can create hash index?

[db2db2db2]

hello all,
we know that db2 create index using B-Tree,but if i want to
create index using hash structure,how can i do it? in my opinion, db2
usually create index using B-tree,my question is if db2 udb support to
create index using hash?
thanks very much
2007.09.22

[Lennart]

On Sep 21, 9:23 pm, [e-mail] wrote:

hello all,
we know that db2 create index using B-Tree,but if i want to
create index using hash structure,how can i do it? in my opinion, db2
usually create index using B-tree,my question is if db2 udb support to
create index using hash?
thanks very much
2007.09.22

Not sure if that is what you are looking for, but have a look at MDC
and block index:

http://publib.boulder.ibm.com/infoce...n/c0007201.htm

/Lennart

[Serge Rielau]

db*******@gmail.com wrote:

we know that db2 create index using B-Tree,but if i want to
create index using hash structure,how can i do it? in my opinion, db2
usually create index using B-tree,my question is if db2 udb support to
create index using hash?

DB2 doesn't have hash indexes. I actually have never heard of a request
for it. Do you have performance problems with B-Tree indexes?

The closest you can get to hash-index would be creating a "range
clustered table".
These tables basically compute the physical rowid from the primary key.
They are great for look-up tables...

Cheers
Serge

--
Serge Rielau
DB2 Solutions Development
IBM Toronto Lab