OK, time for some answers, although of course regular readers of this blog will already know the answer :) When selecting one row from the small table as in the quiz in my previous post, the correct order is as follows: 1) PK access of an Index Organized Table. This option only requires just the 1 consistent [...]![]()
Assume you have a tiny little table with just 42 rows (naturally) that all fit in one table block. Order the following options in order of “efficiency” (most efficient option first) when accessing just one of these rows: 1) Full Table Scan of Heap Table 2) PK access of an Index Organised Table 3) Index access [...]![]()
Recent comments
21 weeks 6 hours ago
30 weeks 5 days ago
32 weeks 3 days ago
35 weeks 4 days ago
37 weeks 6 days ago
47 weeks 3 days ago
49 weeks 9 hours ago
50 weeks 10 hours ago
50 weeks 1 day ago
1 year 5 days ago