Name
Abstract | ||
|---|---|---|
The R-tree family index structures are among the most common index structures used in multidimensional databases. To improve the search performance it is very important to reduce the overlap between bounding regions in the R-tree. However the arbitrary insertion order in the tree construction procedure might result in tree structures inefficient in the search operations. In this paper we propose a new technique called Hierarchical Clustering-Merging (HCM) to improve the tree construction procedure of the R-tree family index structures. With this technique we can take advantage of the data distribution information in the data set to achieve an optimized tree structure and improve the search performance. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/3-540-45113-7_9 | CIVR |
Keywords | Field | DocType |
data distribution information,r-tree family index structure,tree structure,tree construction procedure,search operation,search performance,common index structure,multidimensional index structure,optimized tree structure,hierarchical clustering-merging,new technique,multidimensional database,hierarchical clustering | Hierarchical clustering,Data mining,R-tree,Tree traversal,Computer science,Image processing,Order statistic tree,Tree structure,Fractal tree index,Bounding overwatch | Conference |
Volume | ISSN | ISBN |
2728 | 0302-9743 | 3-540-40634-4 |
Citations | PageRank | References |
1 | 0.39 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhan Chen | 1 | 8 | 2.02 |
| Jing Ding | 2 | 1 | 0.39 |
| Mu Zhang | 3 | 3 | 0.76 |
| Wallapak Tavanapong | 4 | 535 | 63.27 |
| Johnny S. Wong | 5 | 169 | 20.01 |