상세 보기
멀티미디어 DBMS에서 복합 유사질의 처리를 위한 효율적인 색인 구조의 설계 및 구현
초록
Abstract Recently, advanced multimedia applications, such as geographic information system, and content-based image/video retrieval system, require the efficient processing of k-nearest neighbor queries over large collection of multimedia objects. Among the available techniques for processing such queries, the incremental nearest neighbor algorithm proposed by Hjaltason and Samet is known as the best choice. However, this algorithm has no facility capable of partially pruning the candidate tuples that will turn out not to satisfy the semantic predicate because the R-tree, an underlying index structure used in this algorithm, is a hierarchical multidimensional index structure for only indexing the visual feature information. To overcome these drawbacks, we propose an integrated index structure, so-called SPY-TEC+, that provides an efficient method for indexing visual and semantic feature information at the same time using the SPY-TEC that was proposed for indexing high-dimensional data, and the signature file. We also propose an efficient incremental nearest neighbor algorithm for processing the k-nearest neighbor queries with visual and semantic predicates on SPY-TEC+.1)
- 제목
- 멀티미디어 DBMS에서 복합 유사질의 처리를 위한 효율적인 색인 구조의 설계 및 구현
- 제목 (타언어)
- Development of an efficient index structure for processing complex similarity queries in multimedia DBMS
- 저자
- 이동호
- 발행일
- 2005-09
- 저널명
- 공학기술논문집
- 권
- 14
- 페이지
- 85 ~ 100
- 언어
- KOR
- 출판사
- 한양대학교 공학기술연구소
- 발행국가
- 대한민국
- 분량
- 16 페이지