• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.81-89
• /
• 2005

Declustering and parallel index structures are important research areas to improve a performance of databases. Previous researches proposed several distribution schemes for parallel R-trees, however there is no search schemes to be suitable for the index. In this paper, we propose schemes to improve the performance of range queries for distribute parallel indexes. The proposed schemes use the features that a parallel disk can read multiple nodes from various disks. The proposed schemes are verified using various implementations and performance evaluations. We propose new schemes which can read multiple nodes from multiple disks in contrast that to the previous schemes which can read a node from disk. The experimental evaluation shows that the proposed schemes give us the performance improvement by 40% from the previous researches.

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

One of the most challenging and encouraging applications of state-of-the-art technology is the field of traffic control systems. It combines techniques from the areas of telecommunications and computer science to establish traffic information and various assistance services. The support of the system requires a moving objects database system (MODB) that stores moving objects efficiently and performs spatial or temporal queries with time conditions. In this paper, we propose schemes to distribute an index nodes of trajectory based on spatio-temporal proximity and the characteristics of moving objects. The scheme predicts the extendible MBB of nodes of index through the prediction of moving object, and creates a parallel trajectory index. The experimental evaluation shows that the proposed schemes give us the performance improvement by 15%. This result makes an improvement of performance by 50% per one disk.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.50-58
• /
• 2005

Generally, multidimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amounts of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel multidimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-nxmD(disk) architecture which is the hybrid type of nP-nD and 1P-nD. Its node structure in-creases fan-out and reduces the height of an index. Also, a range search algorithm that maximizes I/O parallelism is devised, and it is applied to k-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.3
• /
• pp.324-337
• /
• 1999

In this work, a new 3-PSP type spatial 3-degree-of-freedom parallel mechanism is proposed. And a 6 DOF hybrid manipulator which consists of a 3-PPR type planar 3 DOF parallel mechanism and a new 3-PSP type spatial 3-degree-of-freedom parallel mechanism is proposed. Both 3 DOF mechanism modules have closed-form forward position solutions and particularly, 3-PSP spatial module has unique forward position solution. Firstly, the closed-form position analysis and first-order kinematic analysis for the proposed 3-PSP type module are carried out, and the first-order kinematic characteristics are examined via maximum singular value and the isotropic index of the mechanism. It is shown through these analyses that the mechanism has excellent isotrpic property throughout the workspace. Secondly, position and kinematic analysis of the 3-PPR planar module are briefly described. Thirdly, the forward position analysis for the 3-PPR 3-PSP type 6 degree-of-freedom hybrid mechanism consisting of a 3-PPR planar module and a 3-PSP spatial module is performed along with the analysis of the workspace size and first-order kinematic characteristics. The kinematic characteristics of the proposed hybrid manipulator are compared to those of geometrically similar Stewart manipulator.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.8 s.173
• /
• pp.118-127
• /
• 2005

A spatial 3 degrees-of-freedom mechanism employing Stewart Platform structure is proposed: the mechanism maintains the 3- RRPS structure of Stewart Platform but has an additional passive PRR serial sub-chain at the center area of the mechanism in order to constrain the output motion of the mechanism within the output motion space of the added PRR serial subchain. The forward and reverse position analyses of the mechanism are performed. Then the mechanism having both the forward and the reverse closed-form solutions is suggested and its closed form solutions are derived. It is confirmed, through the kinematic analysis of those two proposed mechanisms via kinematic isotropic index, that both the proposed mechanisms have fairly good kinematic characteristics compared to the existing spatial 3-DOF mechanisms in literature.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.302-307
• /
• 2005

Recently, lots of parallel mechanisms for spatial 3-DOF and 6-DOF were investigated. However, research on 4-DOF and 5-DOF parallel mechanisms has been very few. In this paper, we propose a 4-DOF parallel mechanism that consists of 3-rotational and 1-translational motions. The kinematic characteristics of this mechanism are analyzed in terms of an isotropic index and maximum force transmission ratio, and its kinematic optimization is being conducted to ensure enhanced kinematic performances

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.775-776
• /
• 2009

공간데이터를 관리하는 공간 index structure는 대부분 순차처리를 위한 구조를 가지고 있다. 많은 응용분야에서 방대한 양의 공간 데이터는 보조기억장치(예: disk)에 저장이 되어 사용이 되고 공간 index structure의 operation은 I/O에 대한 의존도가 크므로, I/O operation의 병렬처리는 공간 index structure의 질의반응시간을 현저하게 줄일 수 있다. 본 논문에서는 PPR-tree라는 병렬형 공간 index structure를 제안한다.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.58-71
• /
• 2002

Generally, multi-dimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amount of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel high-dimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-n$\times$mD(disk) architecture which is the hybrid type of nP-nD and lP-nD. Its node structure increases fan-out and reduces the height of a index tree. Also, A range search algorithm that maximizes I/O parallelism is devised, and it is applied to K-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1219-1224
• /
• 1999

This paper derived Montgomery's parallel algorithms for modular multiplication based on Walter's and Iwamura's method, and compared data dependence graph of each parallel algorithm. Comparing the result, Walter's parallel algorithm has small computational index in data dependence graph, so it is selected and used to computed spatial and temporal pipelining diagrams with each projection direction for designing expansible bit-level systolic array. We also evaluated internal operation of proposed expansible systolic array C++ language.

• Spatial Information Research
• /
• v.20 no.6
• /
• pp.139-144
• /
• 2012

The R*-tree manages hierarchical nodes for efficient access of spatial data. We propose a method that maintains partial nodes of R*-tree in the GPU memory to improve efficiency using parallel processing. The proposed method attempts to load as many nodes as possible to the GPU memory. The new nodes are inserted to manage the rest of R*-tree nodes in the main memory. The experimental result shows that the proposed method is more efficient than the main memory based R*-tree.