• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.345-361
• /
• 2005

A transform-space index indexes objects represented as points in the transform space An advantage of a transform-space index is that optimization of join algorithms using these indexes becomes relatively simple. However, the disadvantage is that these algorithms cannot be applied to original-space indexes such as the R-tree. As a way of overcoming this disadvantages, the authors earlier proposed the transform-space view join algorithm that joins two original- space indexes in the transform space through the notion of the transform-space view. A transform-space view is a virtual transform-space index that allows us to perform join in the transform space using original-space indexes. In a transform-space view join algorithm, the order of accessing disk pages -for which various space filling curves could be used -makes a significant impact on the performance of joins. In this paper, we Propose a new space filling curve called the adaptive row major order (ARM order). The ARM order adaptively controls the order of accessing pages and significantly reduces the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page) and the number of disk accesses for a given buffer size. Through analysis and experiments, we verify the excellence of the ARM order when used with the transform-space view join. The transform-space view join with the ARM order always outperforms existing ones in terms of both measures used: the one-pass buffer size and the number of disk accesses for a given buffer size. Compared to other conventional space filling curves used with the transform-space view join, it reduces the one-pass buffer size by up to 21.3 times and the number of disk accesses by up to $74.6\%$. In addition, compared to existing spatial join algorithms that use R-trees in the original space, it reduces the one-pass buffer size by up to 15.7 times and the number of disk accesses by up to $65.3\%$.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.238-246
• /
• 2000

The distance join has been introduced previously, which finds nearest pairs in the order of distance incrementally among two spatial data sets built with multidimensional indexes like R-trees. We propose efficient K-distance joins when the number(K) of pairs to find is preset. Especially, we develop a distance join algorithm with bi-directional expansion and optimized plane sweeping using selection method of sweep axis and direction. The experiments on real spatial data sets show that the proposed algorithm is much better than the former algorithms.

• Journal of Korean Society of Steel Construction
• /
• v.16 no.2 s.69
• /
• pp.201-213
• /
• 2004

A GA-based optimum design algorithm and a program for plane steel frame structures with semi-rigid connections are presented. The algorithm is incorporated with the refined plastic hinge analysis method wherein geometric nonlinearity is considered by using the stability functions of beam-column members, and material nonlinearity, by using the gradual stiffness degradation model that includes the effects of residual stresses, moment redistribution through the occurrence of plastic hinges, semi-rigid connections, and geometric imperfection of members. In the genetic algorithm, the tournament selection method and micro-GAs are employed. The fitness function for the genetic algorithm is expressed as an unconstrained function composed of objective and penalty functions. The objective and penalty functions are expressed as the weight of steel frames and the constraint functions, respectively. In particular, the constraint functions fulfill the requirements of load-carrying capacity, serviceability, ductility, and construction workability. To verify the appropriateness of the present method, the optimal design results of two plane steel frames with rigid and semi-rigid connections are compared.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.629-634
• /
• 2001

보안프로토콜로 기존의 SSL에서 인증 기능을 각각의 사용자, 상점, 금융기관에 강화시킨 ECSCET 프로토콜이 있다. ECSET프로토콜의 구성성분으로 비밀키 알고리즘의 DES, 공개키 알고리즘의 RSA, 메시지 서명 알고리즘인 SHA중 공개키 알고리즘의 RSA, 메시지 서명 알고리즘인 SHA중 공개키 알고리즘의 RSA를 ECC로 대체함으로 암, 복호화 속도를 분석하였고, 서명 알고리즘으로 타원곡선을 이용한 ECDSA을 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.317-319
• /
• 1999

공간 데이터베이스에서 공간 데이터간의 근접성을 알아보아야 할 필요가 많이 발생한다. 이를 위해, 본 연구에서는 방향 관계와 거리 관계가 혼합된 형태의 질의에서 공간적으로 가까운 객체를 순서적으로 추출해내는 방법을 제안한다. 점진적 거리 조인 알고리즘을 근간으로 섹터 기반 모델을 적용하여 객체들을 순서적으로 추출할 수 있도록 한다. 섹터의 분류와 섹터들간 정렬 순서에 따라 추출된 값을 필요에 따라 제한조건의 조절이 가능하다는 장점이 있다. 또한, 점진적 거리조인 알고리즘에 있어서의 데이터 크기에 따른 성능 저하 문제도 어느 정도 해결할 수 있음을 기술하고 있다.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.25-34
• /
• 2007

Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency In some applications. The graph-based sliding window multi -join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure, The advantages of our algorithm are proved by the performance comparison with existing join algorithms.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.755-768
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new hash join methods with load balancing capabilities. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets adaptively via a frequency distribution. Using hash-based joins, multiple joins can be pipelined so that the early results from a join, before the whole join is completed, are sent to the next join processing without staying on disks. Unless the pipelining execution of multiple hash joins includes some load balancing mechanisms, the skew effect can severely deteriorate system performance. In this paper, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.180-192
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.40-42
• /
• 2002

데이터 웨어하우스는 물리적으로 여러 사이트에 위치한 분산된 데이터 소스로부터 추출한 온라인 분석 정보를 유지하는 실체 뷰 의 집합으로 구성된다. 따라서 데이터 소스에 변경 사항이 발생하면 데이터 웨어하우스와 일관성을 유지하기 위해 뷰에도 그 변경사항을 반영하는 뷰 관리가 필요하다 동시에 변경되는 여러 데이터 소스와 뷰의 상태 사이에 일관성을 보장하기 위해서는 각 소스의 변경 사항을 순서대로 뷰에 반영해야 한다. 이때 각 소스의 변경 사항을 뷰 정의와 관련된 다른 소스들과 조인을 수행해야 하는 등 뷰 갱신을 위해 많은 비용이 소요된다. 이러한 뷰 갱신 비용을 줄이는 방법중의 하나로 병렬처리 기법을 활용하는 연구가 시도되고 있다. 따라서 이 논문에서는 뷰의 일관성을 보장하기 위해 수행해야 하는 서브질의론 병렬로 처리하는 알고리즘을 제시하였다. 이 방법에서는 서브질의의 조인 연산들을 소스 렐레이션들 간의 참조 무결성 제약 조건을 이용하여 병렬로 처리한다. 질의의 조인 처리를 병렬화 하기 위해 소스 릴레이션간의 참조 무결성 제약조건의 툭송울 이용하여, 여러 릴레이션을 참조하는 릴레이션에서 발생하는 변경 사항에 대해 참조하는 릴레이션의 수만큼 병렬로 조인 연산을 수행하는 알고리즘을 제시하였다. 이렇게 함으로써 여러 소스 릴레이션의 조인으로 구성된 실체 뷰를 갱신하는 시간을 크게 단축하여 효율적으로 뷰를 관리하도록 하였으며, 소스의 증가에 따른 뷰 갱신 시간의 증가를 줄일 수 있도록 하였다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1992.10a
• /
• pp.284-287
• /
• 1992