摘要
目前,许多应用领域频繁地涉及到大的数据集和高维数据对象,如CAD、图形数据库等。文中介绍了一种新的空间索引结构QR 树。QR 树的存储开销仅略大于R 树,而在插入、删除,尤其是查找性能上要优于R 树。
The operation of spatial data objects is frequently involved in many applications with large data sets and many of the objects are high dimensionality, such as CAD, image databases. This paper introduces an architecture spatial index structure called Q R*tree, which uses a bit more storage than R*tree, however excels R*tree in insertion, delete, especially in searching.
出处
《计算机应用》
CSCD
北大核心
2003年第8期124-126,152,共4页
journal of Computer Applications
