1

406

2Distinctiveness-Sensitive Nearest-Neighbor Search)

3

SRSR--treetree

A B C D E F G H

1 2 3

rootA

2

3

1D E

GB

FC

H

4

5

(1)

(2)

6

(1)(1)

7

(2)(2)

8

A

2

3

1

A B C D E F G H

1 2 3

root

D E

GB

F

CH

9

60 110 1

SS-TreeR*-Tree

4 1

SR-Tree

11%68%

10

(1)(1)

(2) (2)

dNNdNN

Rp dNN

Rp dNN

more than Nc less than Nc

(Distinctiveness(Distinctiveness--sensitive nearestsensitive nearest--neighbor search)neighbor search)

queryquery

11stst

22ndnd

33rdrd

44thth

queryquery

11stst

22ndnd

33rdrd

44thth

11 12

dNN dNN

Rp dNN

Rp dNN

more than Nc less than Nc

13

(Distinctiveness(Distinctiveness--sensitive nearestsensitive nearest--neighbor search)neighbor search)

14

(1)(1)

15

(2)(2)

NHK7

TBSNEWS23 JAPAN

•

•

16

1. Norio Katayama and Shin'ichi Satoh, “The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries,” Proc. of the 1997 ACM SIGMOD International Conference on Management of Data (May 1997) pp.369-380.

2. , ,, D-II, vol. J82-D-II, no.10 (Oct. 1999) pp.1606-1616.

3. , , ,(DBS), Vol.2000, No.69 (Jul. 2000) pp.471-478

( ).

4. Norio Katayama and Shin'ichi Satoh, “Distinctiveness-Sensitive Nearest-Neighbor Search for Efficient Similarity Retrieval of Multimedia Information,” IEEE 17th International Conference on Data Engineering (ICDE2001) (Apr. 2001) pp.493-502.

5. , , , (), Vol.42, No.10 (Oct. 2001) pp.958-964.

6. Shin’ichi Satoh and Norio Katayama, “Experimental Evaluation of Disk-Based Data Structures for Nearest Neighbor Searching,” Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, AMS DIMACS Series, Vol. 59 (2002) pp.87-104.

7. Shin’ichi Satoh and Norio Katayama, “Indexing Video Archives: Analyzing, Organizing, and Searching Video Information,” Handbook of Video Databases: Design and Applications, B.Furht and O.Marques (Eds.), Chapter 29 (to appear).