2차원 배열 데이터에서 유사 구역의 효율적인 탐색 기법

An Efficient Method for Finding Similar Regions in a 2-Dimensional Array Data

초록

In various fields of science, 2-dimensional array data is being generated actively as a result of measurements and simulations. Although various query processing techniques for array data are being studied, the problem of finding similar regions, whose sizes are not known in advance, in 2-dimensional array has not been addressed yet. Therefore, in this paper, we propose an efficient method for finding regions with similar element values, whose size is larger than a user-specified value, for a given 2-dimensional array data. The proposed method, for each pair of elements in the array, expands the corresponding two regions, whose initial size is 1, along the right and down direction in stages, keeping the shape of the two regions the same. If the difference between the elements values in the two regions becomes larger than a user-specified value, the proposed method stops the expansion. Consequently, the proposed method can find similar regions efficiently by accessing only those parts that are likely to be similar regions. Through theoretical analysis and various experiments, we show that the proposed method can find similar regions very efficiently.

키워드

배열 데이터; 유사 구역 탐색; 배열 질의 처리; 배열 데이터베이스; Array Data; Finding Similar Regions; Array Query Processing; Array Database
제목
2차원 배열 데이터에서 유사 구역의 효율적인 탐색 기법
제목 (타언어)
An Efficient Method for Finding Similar Regions in a 2-Dimensional Array Data
저자
최연정; 이기용
DOI
10.3745/KTSDE.2017.6.4.185
발행일
2017-04
저널명
정보처리학회논문지. 소프트웨어 및 데이터 공학
권
6
호
4
페이지
185 ~ 192