Bitmap R-trees

被引：0
|
作者：
Ang, C.H. [1 ]
Tan, S.T. [1 ]
Tan, T.C. [1 ]
机构：
[1] Department of Computer Science, School of Computing, National University of Singapore, Singapore, 117543, Singapore
来源：
Informatica (Ljubljana) | 2000年 / 24卷 / 02期
关键词：
Data structures - Query languages - Trees (mathematics);
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Bitmap R-tree is a variant of R-tree in which bitmaps are used for the description of the internal and the external regions of the objects in addition to the use of minimum bounding rectangles. The proposed scheme increases the chance of trivial acceptance and rejection of data objects, and reduces unnecessary disk accesses in query processing. It has been shown that with the bitmaps as filters, the reference to the object data file can be cut down by as much as 60%.
引用
收藏
页码：205 / 209
相关论文
共 50 条
12345