Cost model of R-tree and algorithmic optimization

被引：0
|
作者：
Chen, Haibo [1 ]
Wang, Shenkang [1 ]
机构：
[1] Dept. of Comp. Sci. and Technol., Zhejiang Univ., Hangzhou 310027, China
来源：
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics | 2003年 / 15卷 / 03期
关键词：
Data acquisition - Errors - Optimization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present a cost model for predicting the performance of R-tree and its variants. Optimization based on the cost model can be applied to R-tree construction. We construct a new R-tree variant named CR-tree using this cost model. Experiment results show that the relative error of the cost model is around 12.6%, and the performance for querying CR-tree has been improved 4.25% in contrast with R-tree's.
引用
收藏
页码：277 / 282
相关论文
共 50 条
  • [21] Efficient Parallel Processing of R-Tree on GPUs
    Nong, Jian
    He, Xi
    Chen, Jia
    Liang, Yanyan
    MATHEMATICS, 2024, 12 (13)
  • [22] NIR-Tree: A Non-Intersecting R-Tree
    Langendoen, Kyle
    Glasbergen, Brad
    Daudjee, Khuzaima
    33RD INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT (SSDBM 2021), 2020, : 157 - 168
  • [23] Benchmarking Coding Algorithms for the R-tree Compression
    Walder, Jiri
    Kratky, Michal
    Baca, Radim
    DATESO 2009 - DATABASES, TEXTS, SPECIFICATIONS, OBJECTS: PROCEEDINGS OF THE 9TH ANNUAL INTERNATIONAL WORKSHOP, 2009, 471 : 32 - 43
  • [24] Bulk insertion for R-tree by seeded clustering
    Lee, T
    Moon, B
    Lee, S
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2003, 2736 : 129 - 138
  • [25] Parallel R-tree search algorithm on DSVM
    Wang, BT
    Horinokuchi, H
    Kaneko, K
    Makinouchi, A
    6TH INTERNATIONAL CONFERENCE ON DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, 1999, : 237 - 244
  • [26] Constructing the compact heart of an R-tree using a tree substitution
    Jullian, Yann
    ANNALES DE L INSTITUT FOURIER, 2011, 61 (03) : 851 - 904
  • [27] A design of parallel R-tree on cluster of workstations
    Lai, SH
    Zhu, FH
    Sun, YQ
    DATABASES IN NETWORKED INFORMATION SYSTEMS, PROCEEDINGS, 2001, 1966 : 119 - 133
  • [28] Enhanced Nearest Neighbour Search on the R-tree
    Cheung, King Lum
    Fu, Ada Wai-Chee
    SIGMOD Record (ACM Special Interest Group on Management of Data), 1998, 27 (03): : 16 - 21
  • [29] A new enhancement to the R-tree node splitting
    Al-Badarneh, Amer F.
    Yaseen, Qussai
    Hmeidi, Ismail
    JOURNAL OF INFORMATION SCIENCE, 2010, 36 (01) : 3 - 18
  • [30] Branch grafting method for R-tree implementation
    Schreck, T
    Chen, Z
    JOURNAL OF SYSTEMS AND SOFTWARE, 2000, 53 (01) : 83 - 93
12345