<紀要論文>
An Estimating Model for the Length of the Priority Queue in INN Search

作成者
本文言語
出版者
発行日
収録物名
開始ページ
終了ページ
出版タイプ
アクセス権
JaLC DOI
関連DOI
関連URI
関連情報
概要 Incremental Nearest Neighbor (INN) search has been widely used in spatial databases and multimedia databases. R*-tree is still regarded as being among the best multi-dimensional indices. This paper pr...esents an analytical model for estimating performance of the INN search algorithm on R*-tree. Our model focuses on the length of the priority queue, the total number of its members. In our model, the particularity on the number of entries in the root node and the possible difference of fanouts between the leaf nodes and the other nodes are taken into account. The theoretical analysis is verified by experiments.続きを見る

本文ファイル

pdf p001 pdf 631 KB 132  

詳細

PISSN
EISSN
NCID
レコードID
査読有無
主題
登録日 2015.05.29
更新日 2020.10.13

この資料を見た人はこんな資料も見ています