Redian新闻
>
Oracle 有这种 create partially sorted index方法吗?
avatar
p*1
2
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.
avatar
n*y
3
I k this song...

【在 g******n 的大作中提到】

avatar
v*r
4
Oracle 的 B-Tree 是 fully sorted,好像没有这种 partilly sorted 的
implementation. 和 "fully sorted" 比较, "partilly sorted" 应该speed up
insert new record, but will slow down query using index.
avatar
s*s
5
顶 五轮真弓
avatar
m*n
6
I love this song
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。