• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.347-355
• /
• 2014

The general octree structure is common for various applications including computer graphics, geometry information analysis and query. Unfortunately, the general octree approach causes duplicated sample data and discrepancy between sampling and representation positions when applied to sample continuous spatial information, for example, signed distance fields. To address these issues, some researchers introduced the dual octree. In this paper, the weakness of the dual octree approach will be illustrated by focusing on the fact that the dual octree cannot access some specific continuous zones asymptotically. This paper shows that the primal tree presented by Lefebvre and Hoppe can solve all the problems above. Also, this paper presents a three-dimensional primal tree traversal algorithm based the Morton codes which will help to parallelize the primal tree method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.789-791
• /
• 2016

수동 금속 연마과정의 효율성을 향상시키기 위한 자동 시편 연마 시스템들이 개발되었으나 기존 시스템들은 시스템 내부 데이터 처리를 비-트리 인덱스를 이용하기 때문에 데이터 엑세스 효율성이 떨어지며 다수의 기기가 접속할 경우 저장 공간의 낭비가 발생한다는 문제점이 있다. 따라서 본 논문에서는 조인 결과에 대한 인덱스를 생성하고 컬럼 값 분포도가 낮은 데이터에 대한 액세스 효율성이 높은 비트캡 인덱스를 비트리 구조에 삽입하여 시편 연마기 데이터를 제공하는 시스템을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.626-628
• /
• 2003

웹 지리정보시스템은 사용하기 쉬운 사용자 인터페이스를 제공함으로써 사용자들로 하여금 공간 데이터의 접근과 분석기능을 쉽게 제공한다. 그러나 이들 시스템들은 독자적인 지리 데이터로의 접근만을 허용하고 분산되어 있는 지리 데이터로 접근할 수 없다. 이는 지리 데이터의 구조와 액세스 방법 등이 서로 상이하기 때문이다. 본 논문에서는 OLE DB을 기반으로 한 분산 지리 데이터의 상호운영성에 대한 기술한다. 또한 분산 지리데이터 서버에서 전달된 데이터는 웬 기반 환경에서 효율적으로 사용되기 위하여 XML 기반의 GML로 변환되어 진다. GML 은 지리정보시스템을 위한 XML기반의 웹 언어로 본문에서는 이를 기술한다. 본 시스템은 컴포넌트 형태로 제공함으로써 구축 비용 및 다양한 사양한 요구사항을 효율적으로 충족시킬 수 있다.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.17-25
• /
• 2006

TPR*-tree is the most widely-used index structure for effectively predicting the future positions of moving objects. The TPR*-tree, however, has the problem that both of the dead space in a bounding region and the overlap among hounding legions become larger as the prediction time in the future gets farther. This makes more nodes within the TPR*-tree accessed in query processing time, which incurs the performance degradation. In this paper, we examine the performance problem quantitatively with a series of experiments. First, we show how the performance deteriorates as a prediction time gets farther, and also show how the updates of positions of moving objects alleviates this problem. Our contribution would help provide Important clues to devise strategies improving the performance of TPR*-trees further.

• Journal of Aerospace System Engineering
• /
• v.18 no.4
• /
• pp.89-95
• /
• 2024

This paper introduces an effective and convenient method for utilizing onboard memory space to process remote commands, telemetry, and interplanetary network protocol data in satellite onboard systems. By enhancing the doubly linked list data structure to store and make accessible variable-length communication protocol data either sequentially or at variable locations, the paper enhances memory capacity utilization. The concept of 'grape' is introduced into the doubly linked list data structure to manage variable-length data and its access, with performance verification conducted through its reference implementation. This novel approach to linked lists is termed 'grape.'

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.650-663
• /
• 2004

In molecular biology, DNA sequence searching is one of the most crucial operations. Since DNA databases contain a huge volume of sequences, a fast indexing mechanism is essential for efficient processing of DNA sequence searches. In this paper, we first identify the problems of the suffix tree in aspects of the storage overhead, search performance, and integration with DBMSs. Then, we propose a new index structure that solves those problems. The proposed index consists of two parts: the primary part represents the trie as bit strings without any pointers, and the secondary part helps fast accesses of the leaf nodes of the trio that need to be accessed for post processing. We also suggest an efficient algorithm based on that index for DNA sequence searching. To verify the superiority of the proposed approach, we conducted a performance evaluation via a series of experiments. The results revealed that the proposed approach, which requires smaller storage space, achieves 13 to 29 times performance improvement over the suffix tree.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.517-524
• /
• 2006

In cluster computers, it is essential to Implement the single I/O space(SIOS) supporting integrated I/O substructure to efficiently process I/O intensive applications. SIOS service provides with global I/O address space to directly access peripherals and hard disks in its own or remote nodes from any node in the cluster computer In this thesis, we propose the implementation method of SIOS in Linux clusters by using only freewares. This method is implemented at device driver level that uses Enhanced Network Block Device(ENBD) and file system level that uses S/W RAID and NFS. The major strengths of this method are easiness of implementation and almost no cost due to using freewares. In addition, since freewares used are open sources, it is possible to apply this method to other platforms with only slight modification. Moreover, experiments show that I/O throughputs are up to 5.5 times higher in write operations and approximately 2.3 times higher in read operations than those of CDD method that uses the device driver developed at kernel level.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.233-246
• /
• 2005

To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

• Spatial Information Research
• /
• v.20 no.3
• /
• pp.95-106
• /
• 2012

Recently, with increase and development of the wireless access network area, u-GIS Service is supported in various fields. Especially, spatio-temporal data is used in the mobile environment for the u-GIS service. However, there is no standard for the spatio-temporal data used in different spaces, spatio-temporal data processing technology is necessary to makes interoperability among mobile u-GIS services. Furthermore, it is also necessary to develop the system of gathering, storing, and managing the spatio-temporal data in consideration of small capacity and low performance of mobile devices. Therefore, in this paper, we designed and implemented a spatio-temporal query processing system based on GML to manage spatio-temporal data efficiently in the mobile environment. The spatio-temporal query processing system based on GML can offer a structured storage method which maps a GML schema to a storage table and a binary XML storage method which uses the Fast Infoset technique, so as to support interoperability that is an important feature of GML and increase storage efficiency. we can also provide spatio-temporal operators for rapid query processing of spatio-temporal data of GML documents. In addition, we proved that this system can be utilized for the u-GIS service to implement a virtual scenario.