Which two are the fastest methods for fetching a single row from a table based on an equality predicate?

The correct answer is C. Row fetch from a single table hash cluster E. Row fetch from a table using rowid. A scan is slower than a row fetch (from hash value or rowid).

Using Indexes and Materialized Views for Tuning

Question

Options

AFast full index scan on an index created for a column with unique key
BIndex unique scan on an created for a column with unique key
CRow fetch from a single table hash cluster
DIndex range scan on an index created from a column with primary key
ERow fetch from a table using rowid

How the community answered

(27 responses)

A
15% (4)
B
4% (1)
C
70% (19)
D
11% (3)

Explanation

A scan is slower than a row fetch (from hash value or rowid).

Topics

#hash cluster#rowid access#index unique scan#single row fetch

Community Discussion

No community discussion yet for this question.

Full 1Z0-117 Practice