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

Yaokai Feng, Akifumi Makinouchi

Research output: Contribution to journalArticle

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

Fingerprint

Trees (mathematics)
Analytical models
Experiments
Nearest neighbor search

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

An estimating model for the length of the priority queue in INN search. / Feng, Yaokai; Makinouchi, Akifumi.

In: Research Reports on Information Science and Electrical Engineering of Kyushu University, Vol. 8, No. 1, 01.01.2003, p. 1-6.

Research output: Contribution to journalArticle

@article{9d0f52f519af4ea6917e97000ffe9179,
title = "An estimating model for the length of the priority queue in INN search",
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.",
author = "Yaokai Feng and Akifumi Makinouchi",
year = "2003",
month = "1",
day = "1",
language = "English",
volume = "8",
pages = "1--6",
journal = "Research Reports on Information Science and Electrical Engineering of Kyushu University",
issn = "1342-3819",
publisher = "Kyushu University, Faculty of Science",
number = "1",

}

TY - JOUR

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

AU - Feng, Yaokai

AU - Makinouchi, Akifumi

PY - 2003/1/1

Y1 - 2003/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0037835738&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037835738&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0037835738

VL - 8

SP - 1

EP - 6

JO - Research Reports on Information Science and Electrical Engineering of Kyushu University

JF - Research Reports on Information Science and Electrical Engineering of Kyushu University

SN - 1342-3819

IS - 1

ER -