Branch grafting method for R-tree implementation

被引：6

作者：

Schreck, T ^{[1
]}

Chen, Z ^{[1
]}

机构：

[1] Univ Nebraska, Dept Comp Sci, Omaha, NE 68182 USA

来源：

JOURNAL OF SYSTEMS AND SOFTWARE | 2000年 / 53卷 / 01期

关键词：

R-tree implementation; spatial data structure; data mining; branch grafting;

D O I：

10.1016/S0164-1212(00)00057-1

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

R-trees are an important spatial data structure for database storage. In this paper, we introduce a new method, called branch grafting method, for R-tree implementation. The major motivation of this proposed technique is to produce more desirable result and to reduce the number of nodes created in the R-tree. We present this method by comparing it with reinsertion method as used in R*-tree. Experiments have been carried out, and the strength of this proposed method is outlined. (C) 2000 Elsevier Science inc. All rights reserved.

引用

页码：83 / 93

页数：11

共 16 条

[1] ANG CH, 1999, P SSD, P339
[2] ASATO B, 1994, BRANCH GRAFTING HEUR
[3] BECKMANN N, 1990, ACM SIGMOD, P322, DOI DOI 10.1145/93597.98741
[4] Garcia Y. J. R., 1998, Proceedings of the Twenty-Fourth International Conference on Very-Large Databases, P334
[5] GREENE D, 1989, PROCEEDINGS : FIFTH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, P606, DOI 10.1109/ICDE.1989.47268
[6] Guttman A., 1984, P ACM SIGMOD INT C M, P47, DOI DOI 10.1145/602259.602266
[7] KAMEL I, 1995, P 1995 INT C VLDB
[8] KAMEL I, 1993, P 2 INT C INF KNOWL, P490
[9] KOPERSKI K, 1996, P 1996 SIGMOD 96 WOR
[10] KOTIDIS Y, 1998, P ACM SIGMOD INT C M, P249

← 1 2 →