한국지역지리학회지 (Journal of the Korean association of regional geographers)
- 제3권2호
- /
- Pages.105-120
- /
- 1997
- /
- 1226-7392(pISSN)
- /
- 2586-1468(eISSN)
객체지향 지리정보 데이터베이스를 위한 색인기법
An Indexing Technique for Object-Oriented Geographical Databases
- 부기동 (경일대학교 컴퓨터공학과)
- Bu, Ki-Dong (Department of Computer Engineering, Kyungil University)
- 발행 : 1997.12.31
초록
객체지향 지리정보 데이타베이스 시스템의 설계시 중요한 고려 사항은 저장된 데이타에 대한 좋은 접근 전략을 갖도록 하는 것이다. 객체지향 시스템에서는 이러한 목적으로 여러가지 색인 기법이 개발되었으나, 이러한 기법들은 객체지향 데이타 모델의 집단화 계층이나 상속 계층 중 어느 한 가지만을 고려하는 경우가 대부분이었다. 본 연구에서는 포인터 체인 디렉토리를 이용하여 객체지향 지리 데이터베이스의 집단화 및 상속 계층을 접근하는 데 효율적인 색인 기법을 제안하였다. 제안된 기법의 효용성을 기존의 색인 기법들과 다양하게 비교하였으며, 저장비용과 검색비용 측면에서 그 성능을 시뮬레이션한 결과를 제시하였다.
One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.
키워드