逆键索引优化B树
本文探讨了通过实施逆键索引解决B树索引中右侧叶块竞争的问题，特别是使用序列生成键值时如何避免冲突，提高索引效率。
175. What can you achieve by implementing reverse key index?
A.Reverse the bytes of each column indexed including the row ID.
B.Store a bitmap for each key value instead of a list of row IDs in the leaf node.
C.Prevent contention on the highest leaf block when using sequences to generate keys.
D.Remove repeated key values from the index to fit more index entries in a given amount of disk space.
Answer: C
答案解析：
参考：http://docs.oracle.com/cd/E11882_01/server.112/e40540/indexiot.htm#CNCPT1181
Reversing the key solves the problem of contention for leaf blocks in the right side of a B-tree index
扫一扫
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
