An estimating model for the length of the priority queue in INN search

Yaokai Feng, Akifumi Makinouchi

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 presents 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.

Original languageEnglish
Pages (from-to)1-6
Number of pages6
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Volume8
Issue number1
Publication statusPublished - Jan 1 2003
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'An estimating model for the length of the priority queue in INN search'. Together they form a unique fingerprint.

Cite this