| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
As a famous member of R-tree family, R^*-tree is widely used in multimedia databases and spatial databases, in which NN (Nearest Neighbor) search is very popular. Based on the observation that the obj...ects are not well-clustered in R^*-tree leaf nodes, this paper proposes an approach to improve NN search performance of R^*-tree by introducing clustering technology to R^*-tree. The experimental result indicates that our improved R^*-tree has much better NN search performance than the original R^*-tree.続きを見る
|
Mendeley出力
