• The Journal of the Korea Contents Association
• /
• v.10 no.1
• /
• pp.68-77
• /
• 2010

In this paper, we propose a new log buffer management scheme considering the accessibility of the data. Our proposed scheme evaluates the worth of the merge of log blocks. It conducts the merge operations between infrequently updated data and the data blocks and postpones as much as possible the merge operations between frequently updated data and the data blocks. As a result, the proposed method prevents the unnecessary merge operations, reduces the number of the erase operations, and improves the utilization of the flash memory storage. In order to show the superiority of the proposed scheme, we compare it with BAST and FAST. It is shown through performance evaluation that the proposed method achieves about 25% and 65% performance improvements over BAST and FAST on average in terms of the number of the erase operations.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1162-1171
• /
• 1998

This paper presents a data structure that implements a mergable double-ended priority queue : namely an improved relaxed min-max-pair heap. By means of this new data structure, we suggest a parallel algorithm to merge priority queues organized in two relaxed heaps of different sizes, n and k, respectively. This new data-structure eliminates the blossomed tree and the lazying method used to merge the relaxed min-max heaps in [9]. As a result, employing max($2^{i-1}$,[(m+1/4)]) processors, this algorithm requires O(log(log(n/k))${\times}$log(n)) time. Also, on the MarPar machine, this method achieves a 35.205-fold speedup with 64 processors to merge 8 million data items which consist of two relaxed min-max heaps of different sizes.

• International Journal of Highway Engineering
• /
• v.11 no.2
• /
• pp.217-228
• /
• 2009

Sections under the influence of merging in an uninterrupted facility create irregular interaction between vehicles, such as lane change, speed acceleration and deceleration because of the merging of ramp traffic flows which have traffic characteristics different from those of the main line. This causes a confused traffic flow phenomenon(turbulence), which is considered an unstable traffic characteristic between various continuous points in consideration of v conditions. In this study, in merge influence sections, detectors by lane-point were installed to create time and space-series -traffic data. The least significant difference(LSD), as the criteria for discriminating a significant speed change between points, was calculated to examine the turbulence. As a result, turbulence in merge influence section was found to change the zones of such occurrence and the seriousness levels according to traffic condition. Thus, the maximum merge influence section due to the turbulence was created in the traffic condition before congestion when traffic increases. According to characteristics of changes in speed, merge influence section was divided into upstream 100m$\sim$downstream 100m(a section of speed reduction), and downstream 100m$\sim$downstream 400m(a section of reduced speed maintenance and acceleration).

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1739-1748
• /
• 2008

When we conduct a data mining procedure on sample data sources, several rules are generated. But some rules are redundant or logically disjoint and therefore they can be removed. We suggest a new rule minimization algorithm inspired from logic synthesis to improve comprehensibility and eliminate redundant rules. The method can merge several relevant rules into one based on data mining and logic synthesis without high loss of accuracy. In case of two or more rules are candidates to be merged, we merge the rules with the attribute having the lowest information gain. To show the proposed method could be a reasonable solution, we applied the proposed approach to a problem domain constructing user preferred ontology in anti-spam systems.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.6
• /
• pp.413-424
• /
• 2017

In this paper, we show shortcomings of separate chaining scheme by way of experiments with NAND flash memory and improve the performance with merge chaining scheme which is proposed in this paper. We explain this merge chaining scheme and explain how to improve the performance of search operation. Merge chaining scheme shows better performance at insert and search operation compare to separate chaining scheme.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.48
• /
• pp.185-192
• /
• 1998

A new algorithm is proposed in this paper which efficiently performs join in the temporal database. The main idea is to sort the smaller relation and to partition the larger relation, and the proposed algorithm reduces the cost of sorting the larger relation. To show the usefulness of the algorithm, the cost is analyzed with respect to the number of accesses to secondary storage and compared with that of Sort-Merge algorithm. Through the comparisons, we present and verify the conditions under which the proposed algorithm always outperforms the Sort-Merge algorithm. The comparisons show that the proposed algorithm achieves 10∼30% gain under those conditions.

• 한국데이터정보과학회:학술대회논문집
• /
• 2006.04a
• /
• pp.195-197
• /
• 2006

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3207-3212
• /
• 2009

Automatic semiconductor manufacturing systems are demanded to improve the efficiency of the semiconductor production process. These systems include the functionalities such as the analysis and management schemes for very large real-time data in order to enhance the productivities. So, it requires the efficient storage management system to store very large real-time data. Traditional database management systems(e.g. Oracle, MY-SQL, MS-SQL) are based on disk. However, previous DBMS's have the limitation on the low storing performance. In this paper, we propose a compress-merge storing method of very large real-time data using insert transaction of a block unit. The proposed method shows better processing performances compare to conventional DBMS's. Also compress-merge method makes it possible that it can store large real-time data on low storage cost. Therefore, the proposed method can be applied to an efficient storage management system in the semiconductor production process.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.20-32
• /
• 1996

The boundary evaluation technique for Boolean operation on non-manifold models which is regarded as the most popular and powerful method to create and modify 3-D CAD models has been developed. This technique adopted the concept of Merge and Selection in which the CSG tree for Boolean operation can be edited quickly and easily. In this method, the merged set which contains complete information about primitive models involved is created by merging primitives one by one, then the alive entities are selected following the given CSG tree. This technique can support the hybrid representation of B-rep(Boundary Representation) and CSG(Constructive Solid Geometry) tree in a unified non-manifold model data structure, and expected to be used as a basic method for many modeling problems such as data representation of form features, and the interference between them, and data representation of conceptual models in design process, etc.

• Journal of the Korean Society for Library and Information Science
• /
• v.25
• /
• pp.233-264
• /
• 1993

The authorized form is called the heading must be unique and consistent. Without both uniqueness and cosistency, retrieval from the bibliographic database will not be optimal and in some cases may even be impossible. But the authority control is extremely expensive, because it is labour-intensive and dependent on professional investigation and judgement. In fact, it is by far the most expensive function in all of bibliographic control. The processes used to determine the form of access points. maintain. use. and evaluate very accurate authority records reduce the efficiency to generate or merge bibliographic items without modification from any national level bibliographic utilities as well as individual library. In this paper non-authority control system was suggested to solve the disadvantages of authority work. The apparent advantages of the non-authority control system are it is easy to determine the heading, input the bibliographic data. integrate the access points into an existing file, and generate and merge bibliographic data without modification. In addition, non-authority control system can be transmitted into online information retrieval system conducted with a mixture of controlled vocabularies and natural language.