서지주요정보
다각형 객체들 사이의 최 근접 질의 처리에 관한 연구 = Research on the nearest neighbor query processing between nonzero-sized objects
서명 / 저자 다각형 객체들 사이의 최 근접 질의 처리에 관한 연구 = Research on the nearest neighbor query processing between nonzero-sized objects / 이동만.
저자명 이동만 ; Lee, Dong-Man
발행사항 [대전 : 한국과학기술원, 1997].
Online Access 원문보기 원문인쇄

소장정보

등록번호

8007140

소장위치/청구기호

학술문화관(문화관) 보존서고

MICE 97015

SMS전송

도서상태

이용가능

대출가능

반납예정일

등록번호

9003139

소장위치/청구기호

서울 학위논문 서가

MICE 97015 c. 2

SMS전송

도서상태

이용가능

대출가능

반납예정일

초록정보

There are many types of queries in spatial database systems which are used by various applications such as CAD, VLSI design and GIS. A query type that is frequently encountered in spatial database systems is to find the nearest neighbor object to a given location. While there has been some research on the nearest neighbor query processing, the research was mostly concerned with the point data. That is, the query object of the nearest neighbor query is a point but not a non-point object such as a line segment, a polygon or a complex object. In this paper we present an efficient method which can find the nearest neighbor object to a given nonzero-sized object using a R-tree variant indexing method. We propose a branch-and-bound R-tree traversal algorithm which prunes off unneeded nodes and searches the nearest neighbor object. In order to prune unneeded nodes efficiently we introduce the concepts of MINDIST and MINMAXDIST which are the distances between MBRs. The nearest neighbor query algorithm is implemented on the SHORE storage manager which has the R*-tree spatial access method. The SHORE storage manager was extended by developing modules necessary for the algorithm.

서지기타정보

서지기타정보
청구기호 {MICE 97015
형태사항 v, 65 p. : 삽도 ; 26 cm
언어 한국어
일반주기 저자명의 영문표기 : Dong-Man Lee
지도교수의 한글표기 : 정진완
지도교수의 영문표기 : Chin-Wan Chung
학위논문 학위논문(석사) - 한국과학기술원 : 정보및통신공학과,
서지주기 참고문헌 : p. 63-65
주제 최 근접 질의
Nearest neighbor query
SHORE
QR CODE qr code