p*****1 发帖数: 128 | 1 HP申请一个create partially sorted index的专利 (US 2008/0104102)。
"To provide an index for a table in a database system, the index is
partially sorted in an initial phase of building the index. Subsequently, in
response to accessing portions of the index to process a database query,
further sorting of the accessed portions of the index is performed."
it is using B-Tree, divid index into different internal nodes, will sort the nodes (but not the entire tree). where each node may overlap with each other. | v*****r 发帖数: 1119 | 2 Oracle 的 B-Tree 是 fully sorted,好像没有这种 partilly sorted 的
implementation. 和 "fully sorted" 比较, "partilly sorted" 应该speed up
insert new record, but will slow down query using index. |
|