• Title/Summary/Keyword: Parallel Index

Search Result 250, Processing Time 0.026 seconds

An Efficient Multidimensional Index Structure for Parallel Environments

  • Bok Koung-Soo;Song Seok-Il;Yoo Jae-Soo
    • 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.

  • PDF

Search scheme for parallel spatial index (병렬 공간 색인을 위한 검색 기법)

  • Seo, Young-Duk
    • 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.

  • PDF

Performance Study of the Index-based Parallel Join

  • Jeong, Byeong-Soo;Edward Omiecinski
    • The Journal of Information Technology and Database
    • /
    • v.2 no.2
    • /
    • pp.87-109
    • /
    • 1995
  • The index file has been used a access database records effectively. The join operation in a relational database system requires a large execution time, especially in the case of handling large size tables. If the indexes are available on the joining attributes for both relations involved in the join and the join selectivity is relatively small, we can improve the execution time of the join operation. In this paper. we investigate the performance trade-offs of parallel index-based join algorithms where different indexing schemes are used. We also present a comparison of our index-based parallel join algorithms with the hash-based parallel join algorithm.

  • PDF

Design of an Efficient Parallel High-Dimensional Index Structure (효율적인 병렬 고차원 색인구조 설계)

  • Park, Chun-Seo;Song, Seok-Il;Sin, Jae-Ryong;Yu, Jae-Su
    • 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.

Parallelization scheme of trajectory index using inertia of moving objects (이동체의 관성을 이용한 궤적 색인의 병렬화 기법)

  • Seo, Young-Duk;Hong, Bong-Hee
    • 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.

  • PDF

THE PERTURBATION FOR THE DRAZIN INVERSE

  • Wu, Chi-Ye;Huang, Ting-Zhu
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.267-273
    • /
    • 2009
  • A representation for the Drazin inverse of an arbitrary square matrix in terms of the eigenprojection was established by Rothblum [SIAM J. Appl. Math., 31(1976) :646-648]. In this paper perturbation results based on the representation for the Darzin inverse $A^D\;=\;(A-X)^{-1}(I-X)$ are developed. Norm estimates of $\parallel(A+E)^D-A^D\parallel_2/\parallel A^D\parallel_2$ and $\parallel(A+E)^#-A^D\parallel_2/\parallel A^D\parallel_2$ are derived when IIEI12 is small.

  • PDF

A study on the control-in-the-small characteristics of a planar parallel mechanism (평면형 병렬 메카니즘의 국소적 제어 특성에 관한 연구)

  • Kim, Whee-kuk;Cho, Whang;Kim, Jae-Seoub
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.3
    • /
    • pp.360-371
    • /
    • 1998
  • In this paper, output precision characteristics of a planar 6 degree-of-freedom parallel mechanisms are investigated, where the 6 degree-of-freedom mechanism is formed by adding an additional link along with an actuated joint in each serial subchain of the planar 3 degree-of-freedom parallel mechanism. Kinematic analysis for the parallel mechanism is performed, and its first-order kinematic characteristics are examined via kinematic isotropic index, maximum and minimum input-output velocity transmission ratios of the mechanisms. Based on this analysis, two types of planar 6 degrees-of-freedom parallel manipulators are selected. Then, dynamic characteristics of the two selected planar 6 degree-of-freedom parallel mechanisms, via Frobenius norms of inertia matrix and power modeling array, are investigated to compare the magnitudes of required control efforts of both three large actuators and three small actuators when the link lengths of three additional links are changed. It can be concluded from the analysis results that each of these two planar 6 degrees-of-freedom parallel mechanisms has an excellent control-in-the-small characteristics and therefore, it can be very effectively employed as a high-precision macro-micro manipulator when both its link lengths and locations of small and large actuators are properly chosen.

  • PDF

Optimal Shape of a Parallel-Flow Heat Exchanger by Using a Response Surface Method (반응표면법을 이용한 평행류 열교환기의 형상 최적화)

  • Oh, Seok-Jin;Lee, Kwan-Soo
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.28 no.3
    • /
    • pp.296-303
    • /
    • 2004
  • The heat and flow characteristics in a single-phase parallel-flow heat exchanger was examined numerically to obtain its optimal shape. A response surface method was introduced to approximately predict its performance with respect to the design parameters over the design domain. The inflow/outflow angle of the working fluid, the location of inlet/outlet, the protruding height of flat tube and the height of header were chosen as a design parameter The evaluation of the relative importance of the design parameters was performed based on a sensitivity analysis. An efficiency index was used as an evaluation characteristics value to simultaneously consider both the heat transfer and the pressure drop. The efficiency index of the optimum model, compared to that of the base model, was increased by 9.3%.

Optimum Design of a New 4-DOF Parallel Mechanism

  • Chung, Jae-Heon;Yi, Byung-Ju;Kim, Whee-Kuk
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 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

  • PDF