| 约束数据库中的动态区间索引结构 |
| |
| 引用本文： | 汪卫,王宇君,王轶彤,施伯乐.约束数据库中的动态区间索引结构[J].计算机研究与发展,1999,36(10):1207-1214. |
| |
| 作者姓名： | 汪卫 王宇君 王轶彤 施伯乐 |
| |
| 作者单位： | 复旦大学计算机科学系,上海,200433 |
| |
| 摘 要： | 区间索引是随着对约束数据库的实用化的研究而提出的。文中在Ｍｅｔａ－树的基础上提出了ＤＭ－树和相应算法，它对区间索引保持了存储为Ｏ（ｎ），查询Ｉ／Ｏ时间为Ｏ（ｌｏｇｎ＋ｔ／Ｂ）的性能，
|
| 关 键 词： | 约束数据库 区间索引结构 Meta_树 |
DYNAMIC INTERVAL INDEX IN CONSTRAINT DATABASE |
| |
| WANG Wei,WANG Yu-Jun,WANG Yi-Tong,SHI Bo-Le.DYNAMIC INTERVAL INDEX IN CONSTRAINT DATABASE[J].Journal of Computer Research and Development,1999,36(10):1207-1214. |
| |
| Authors: | WANG Wei WANG Yu-Jun WANG Yi-Tong SHI Bo-Le |
| |
| Abstract: | The technique of dynamic interval index is very important in the practice of constraint database. Based on the structure of Meta tree, DM tree is given. Its storage is O(n) and query I/O time is O (log n t/B ). To reduce the complex of insert and delete operation, methods of unfixed constraint and late update are applied. The complex of the insert and delete I/O time are all O (log n ). This result is equal to that of B tree. It can be used in the storage and query in constraint database. |
| |
| Keywords: | constraint database interval index structure Meta tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
