By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
437,554 Members | 1,084 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 437,554 IT Pros & Developers. It's quick & easy.

if db2 udb can create hash index?

P: n/a
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

Sep 21 '07 #1
Share this Question
Share on Google+
2 Replies


P: n/a
On Sep 21, 9:23 pm, db2db2...@gmail.com 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
Sep 21 '07 #2

P: n/a
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
Sep 21 '07 #3

This discussion thread is closed

Replies have been disabled for this discussion.