| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
The spatial index takes very important role on accelerating the spatial query processing. The index structure for the spatial space is made from two processes. The first one called filtering uses abst...ract figure and extracts candidates which may involve user wanted data quickly. And the next, refinement distills those candidate using exact data representation taken from the databases. The refinement process needs very large I/O, so removing unnecessary candidates which do not meet the user's requirements is the key to gain better performance. At first we point out the problem of R^*-tree which prevents the index from filtering more candidates off. Then, we propose new technique to operate on that problem and show its performance with simulations.続きを見る
|
Mendeley出力
