Hash clusters were introduced in Oracle 7 as an alternative way of indexing
a table. Instead of randomly storing rows in arbitrary table blocks and
using indexes to locate them (using a B-tree search), hash cluster rows are
stored according to the key values. Each row's location is derived by its
key value.
.
No comments:
Post a Comment