CR*-tree: An improved R-tree using cost model

被引：0
|
作者：
Chen, HB
Wang, ZQ [1 ]
机构：
[1] E China Univ Sci & Technol, Dept Comp Sci & Engn, Shanghai 200237, Peoples R China
[2] Zhejiang Univ, Dept Comp Sci, Hangzhou 310027, Peoples R China
来源：
COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS | 2005年 / 3801卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We present a cost model for predicting the performance of R-tree and its variants. Optimization base on the cost model can be apply in R-tree construction. we construct a new R-tree variant called CR*-tree using this optimization technique. Experiments have been carried out results show that relative error of the cost model is around 12.6%, and the performance for querying CR*-tree has been improved 4.25% by contrast with R*-tree's.
引用
收藏
页码：758 / 764
页数：7
相关论文
共 50 条
  • [21] Historical prioritisation and reprioritisations using hierarchical historical R-tree
    Gupta, Varun
    Chauhan, Durg Singh
    Dutta, Kamlesh
    INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2016, 54 (04) : 257 - 265
  • [22] The RD-tree -: Allowing data in interior nodes of the R-tree
    Nakorn, Tanin Na
    Chongstitvatana, Jarucj
    2006 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2006, : 378 - +
  • [23] 基于空间网格和Hilbert R-tree的二级R-tree空间索引
    郭晶
    刘广军
    董绪荣
    郭磊
    武汉大学学报(信息科学版), 2005, (12) : 1084 - 1088
  • [24] Efficient Parallel Processing of R-Tree on GPUs
    Nong, Jian
    He, Xi
    Chen, Jia
    Liang, Yanyan
    MATHEMATICS, 2024, 12 (13)
  • [25] 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
  • [26] Bulk insertion for R-tree by seeded clustering
    Lee, T
    Moon, B
    Lee, S
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2003, 2736 : 129 - 138
  • [27] Corner-based splitting: An improved node splitting algorithm for R-tree
    Sleit, Azzam
    Al-Nsour, Esam
    JOURNAL OF INFORMATION SCIENCE, 2014, 40 (02) : 222 - 236
  • [28] 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
  • [29] 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
  • [30] 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
12345