| 摘要: |
| 本文研究了约束数据库中的索引技术，提出了存储区间常数刺穿集的数据结构S树和S*树．在刺穿集的最大长度受到限制的条件下，S*树存储效率是最优的．与M树相比，S树和S*树有一个明显的改进：可以支持删除操作． |
| 关键词: 约束数据库 索引 B＋树 动态区间管理 |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家自然科学基金资助. |
|
| INDEXING FOR CONSTRAINT DATABASES |
|
WANG Yujun,TIAN Zengping,QU Yunyao,SHI Baile
|
| Abstract: |
| In this paper, the indexing in constraint databases is considered. Meta-blocktree is improved and a data structure S* tree is presented. It stores the stabbing sets forconstants that appears in the intervals. If the maximurn length of each stabbing set is limited, the space used in S* tree is optimal- Compared with M tree, a significant improvement of S* is that it can support delete operation. |
| Key words: Constraint databases index B+tree dynamic interval management |
