• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.4
• /
• pp.289-297
• /
• 2007

Normaly, the map generlization methode has been used for the making of small scale map using a large scale map. The object join methode is consumed of a lots of processing time and the manual process. The object Join technique used in the NGI based on the digital map ver. 1.0 have problems of poor Joining rate and a lots of processing time. This study has improved the object Join technique considering of the geometry and attribute information for the digital map ver. 2.0. Using improved technique increased joining rate of object and reduced the processing time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.1016-1021
• /
• 1989

In this paper, we introduce a recursively-defined natural join operation as well as well-known object composition operations (union, intersection) for composing CAD database objects. Then, we will discuss how to realize these operations by the message passing computing mechanism. Next, we will discuss what kind of behaviours (methods) are preserved under our natural join operations. Finally, we investigate mathematical properties about the relationships among several object composition operations (natural join, union and intersection).

• The Pure and Applied Mathematics
• /
• v.28 no.4
• /
• pp.267-280
• /
• 2021

In this paper, we introduce the notions of fuzzy join (resp. meet) complete lattices and distance spaces in complete co-residuated lattices. Moreover, we investigate the relations between Alexandrov pretopologies (resp. precotopologies) and fuzzy join (resp. meet) complete lattices, respectively. We give their examples.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.179-184
• /
• 2003

One of the remarkable problems in PIM-DM (Protocol Independent Multicast - Dense Mode) is the join latency time, increasing for specific periods. The reason of this problem is proved to the confusion of flooding prune message and leave prune message. We propose a new solution to this problem, reducing the average join latency by 37.4%, and prove the proposed solution by network simulation.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.853-855
• /
• 2008

This paper presents an energy-efficient spatial join algorithm for multiple sensor networks employing a spatial semijoin strategy. For optimization of the algorithm, we propose a GR-tree index and a grid-ID-based spatial approximation method, which are unique to sensor networks. The GR-tree is a distributed spatial index over the sensor nodes, which efficiently prunes away the nodes that will not participate in a spatial join result. The grid-ID-based approximation provides great reduction in communication cost by approximating many spatial objects in simpler forms. Our experiments demonstrate that the algorithm outperforms existing methods in reducing energy consumption at the nodes.

• The Journal of Engineering Geology
• /
• v.19 no.2
• /
• pp.145-152
• /
• 2009

Joints are planar tensile opening-mode fractures whose relative motion, as the fracture propagates, is perpendicular to bedding plane and occur in a systematic manner to form a joint set. This paper discusses the mechanical control of joint propagation, the relationship between join spacing and layer thickness, the join saturation, the frequency distribution of join spacing, the joint density, the cross joint, and the development mechanism of joint from a lot of recent joint studies in sedimentary rocks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.316-319
• /
• 2011

그룹 키 협정 (Group key agreement)1)은 그룹 내의 노드 (member)가 하나의 비밀 키 (secret key)를 공유하도록 하는 프로토콜이다. 이 때, 그룹 키를 맺는 시간을 줄이기 위해 메시지의 수, 지수연산, 라운드 수가 적을수록 좋다. 그렇기 때문에 기존의 연구들에서는 이러한 요소들을 고려하여 프로토콜을 구성하였다. 하지만 그룹 내의 노드들이 계속 머무르는 상태에서 똑같은 그룹을 형성하는 것이 아니라 중간에 어떤 노드가 그룹을 떠나는 경우 (leave)도 있고 새로운 노드가 들어오는 경우 (join)도 있다. 또한, 그룹이 빠지는 경우 (group leave)도 있고, 그룹이 들어오는 경우 (group join)도 있다(Group Dynamics). 이러한 시나리오는 충분히 발생할 수 있기 때문에 이러한 요소들도 고려하여 프로토콜을 구성해야 한다. 그래서 이논문에서는 그룹 노드들의 join과 leave, 그룹들 간의 join, leave가 빈번한 경우도 고려하여 프로토콜을 제시할 것이다.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.11-13
• /
• 2007

There has been much interest in stream query processing. Various index techniques and advanced join techniques have been proposed to efficiently process data stream queries. Previous proposals support rapid and advanced response to the data stream queries. However, the amount of data stream is increasing and the data stream query processing needs more speedup than before. In this paper, we proposed novel query processing techniques for large number of incoming documents stream. We proposed Dissection Technique for efficient query processing in the data stream environment. We focused on the dissection technique in join query processing. Our technique shows efficient operation performance comparing with the other proposal in the data stream. Proposed technique is applied to the sensor network system and XML database.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.3
• /
• pp.222-230
• /
• 2014

In this paper, we investigate the properties of join and meet preserving maps in complete residuated lattice using Zhang's the fuzzy complete lattice which is defined by join and meet on fuzzy posets. We define L-upper (resp. L-lower) approximation operators as a generalization of fuzzy rough sets in complete residuated lattices. Moreover, we investigate the relations between L-upper (resp. L-lower) approximation operators and L-fuzzy preorders. We study various L-fuzzy preorders on $L^X$. They are considered as an important mathematical tool for algebraic structure of fuzzy contexts.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1367-1370
• /
• 2003

본 논문에서는 인덱스가 존재하지 않는 두 개의 입력 릴레이션에 대해서도 최적의 조인 연산을 수행할 수 있는 공간 해쉬 조인 알고리즘을 제안한다. 인덱스가 존재하지 않는 릴레이션의 처리에 사용하는 기존의 공간 해쉬 조인(SHJ: Spatial Hash Join)과 Scalable Sweeping-Rased Spatial Join(SSSJ) 알고리즘을 결합하여 SHJ 알고리즘의 단점으로 지적되고 있는 편향된(skewed) 데이터에 대한 조인 연산의 성능저하 문제를 개선한 수 있는 Spatial Hash Strip Join(SHSJ) 알고리즘을 제안한다. SHJ에서 편향된 데이터의 경우 해쉬 버킷의 오버플로우 처리를 위해 버킷 재분할 방법을 사용하고 있는데 반하여 본 논문에서 제안한 SHSJ 알괴리즘에서는 버킷의 재분할 처리 대신에 버킷에 데이터를 삽입하고, 조인 연산과정에서 오버플로우가 발생한 버킷에 대하여 SSSJ 알고리즘을 사용함으로써 편향된 입력 릴레이션의 처리 성능을 제고시킬 수 있도록 한다.