<departmental bulletin paper>
An Estimating Model for the Length of the Priority Queue in INN Search

Creator
Language
Publisher
Date
Source Title
Vol
Issue
First Page
Last Page
Publication Type
Access Rights
JaLC DOI
Related DOI
Related URI
Relation
Abstract 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.show more

Hide fulltext details.

pdf p001 pdf 631 KB 133  

Details

PISSN
EISSN
NCID
Record ID
Peer-Reviewed
Subject Terms
Created Date 2015.05.29
Modified Date 2020.10.13

People who viewed this item also viewed