현재 위치
Home
To Reveal the Performance Secrets of the Newest NN Searching Algorithm
-
- 발행기관
- 보안공학연구지원센터(IJSEIA) 바로가기
-
- 간행물
- International Journal of Software Engineering and Its Applications 바로가기
-
- 통권
- Vol.2 No.1 (2008.01)바로가기
-
- 페이지
- pp.55-72
-
- 저자
-
- 언어
- 영어(ENG)
-
- URL
- https://www.earticle.net/Article/A67619
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
- 영어
- Nearest Neighbor (NN) search has been widely used in spatial databases and multimedia
databases. Incremental NN (INN) search algorithm is regarded as the optimal NN search
because of the minimum number of node accesses and it can be used no matter whether the
number of objects to be retrieved is fixed or not in advance. This paper presents an analytical
model for estimating performance of the INN search algorithm. For the first time, our model
takes m (the number of neighbor objects reported finally), n (the cardinality of database) and
d (the dimensionality) as parameters, focusing on the number of node accesses (not only the
number of accessed leaf nodes) and the length of the priority queue. Using our model,
dimensionality curse is mathematically revealed for an arbitrary number of NN objects
retrieved. In our model, (1) for the first time, the two key factors of dm (the distance from the
m-th NN object to the query point) and σ
h (the side length of each node) are estimated using
their upper bounds and their lower bounds, which is helpful to effectiveness of our model,
especially in high-dimensional spaces; (2) for the first time, the possible difference of fanouts
among the leaf nodes, the root node and the others is taken into account. The theoretical
analysis is verified by experiments.
목차
Abstract
1. Introduction
2 Related Works
2.1. R-trees
2.2. INN Search on R-trees
2.3. Performance Analysis of the INN Search Algorithm
3. Performance Estimation of the INN Search Algorithm
3.1. Propositions
3.2 Expected Distance from the Query Point to the m-th NN Object (i.e., dm)
3.3 Expected length of the Side of Node MBR
3.4 Expected Number of Node Accesses
3.5 Expected Length of the Priority Queue
3.6 Discussion of fr, fi, fl and H
4. Experimental Evaluation
4.1 Evaluation with Different Dimensionalities
4.2 Evaluation with Different m
4.3 Evaluation with Different Cardinalities of Databases
5. Conclusion
6. Reference
저자
간행물 정보
발행기관
-
- 발행기관명
- 보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
- 설립연도
- 2006
- 분야
- 공학>컴퓨터학
- 소개
- 1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업
간행물
-
- 간행물명
- International Journal of Software Engineering and Its Applications
- 간기
- 월간
- pISSN
- 1738-9984
- 수록기간
- 2008~2016
- 등재여부
- SCOPUS
- 십진분류
- KDC 505 DDC 605
이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.2 No.1
피인용수 : 0건 (자료제공 : 네이버학술정보)
함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.
출처 : 네이버학술정보
0개의 논문이 장바구니에 담겼습니다.