• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.252-256
• /
• 2010

The structural join is one of core operators for efficient processing of XML queries. It can be mainly used for path-represented XML queries as it efficiently retrieves the node pairs that form a hierarchical relationship (i.e., ancestor-descendant, Parent-child relationship) among large-scale XML nodes. However, the structural join algorithms still suffer potential overhead in the middle of processing of XML path queries. In addressing this problem, the structural semi-join is proposed as a novel operator that retrieves only the ancestor or descendant nodes as join results for efficient processing. In this paper, we describe the algorithms for the structural semi-join and present the methods of XML path processing based on the structural semi-join algorithms. The experimental results show that the structural semi-join algorithms are very efficient in processing XML path processing.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.165-170
• /
• 2010

This paper proposes an in-network join strategy SBJ(Semi & Bloom Join), an efficient join strategy for sensor networks, that minimizes communication cost. SBJ is a hybrid join strategy that can reduce energy consumption by using a bloom filter to reduce the size of data that needs to be sent or received in sensor network. The key to reducing the communication cost in SBJ is to eliminate data not involved in the join result in the early stages of join processing. Through simulation, the paper shows that compared to other join strategies in sensor network, SBJ join strategy is more efficient in reducing the communication cost resulting in a significant reduction in battery consumption.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.27-36
• /
• 2010

The paper proposes RFB(Record Filtering using Bit-vector) join algorithm, an in-network strategy that uses bit-vector to drastically reduce the size of data and hence the communication cost. In addition, by eliminating data not involved in join result prior to actual join, communication cost can be minimized since not all data need to be moved to the join nodes. The simulation result shows that the proposed RFB algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join(SNJ) algorithm.

• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.202-214
• /
• 1994

A functional reduction method of Petri nets is proposed. The method is based on interpretation of relations and transitions with functions which map one series of a relation a another. In particular, we propose CF-join which combines two transitions to new one after reduction of the common places, CE-join which superpose two transitions to one after superposition of the common places, and EQ-join which reduces the common places, after the Petri nets were explained be a relational scheme. A reduced net can be obtained without changing the properties such as liveness and boundness.

• The Journal of Information Technology and Database
• /
• v.3 no.2
• /
• pp.3-24
• /
• 1996

In this paper a data replicator scheme with a distributed join architecture is suggested with its cost functions and the performance results. The contribution of this scheme is not only minimizing the number of base relation locks in distributed database tables but also reducing the remote transmission amount remarkably, which will be able to embellish the distributed databse system practical. The differential files that are derived from the active log of the DBMS are mainly forcing the scheme to reduce the number of base relation locks. The amount of transportation between relevant sites could be curtailed by the tuple reduction procedures. Then we prescribe an algorithm of data replicator with its cost function and show the performance results compared with the semi-join scheme in their distributed environments.

• Asia pacific journal of information systems
• /
• v.5 no.2
• /
• pp.131-142
• /
• 1995

In distributed database systems materialized views are useful to solve many problems caused by data replication. This paper deals with the problem of updating materialized views incluing join operations. We use a differential update which uses logs that record the change of base tables in certain periods. This method avoids locking of the base tables so that it makes the system more efficient. We update materialized views periodically to save the updating cost envolved. A screen test is applied to differential files to eliminate tuples that are irrelevant to any of the views being updated. Using these methods, a detailed procedure is addressed to refresh materialized views. Then we show that our update procedure performs better than a semijoin approach.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.347-360
• /
• 2001

The most expensive spatial operation in spatial databases is a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisfying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved, the response time is not tolerable because of not meeting the requirements of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. However, as the number of processors increases, the efficiency of each processor decreases rapidly because of the disk bottleneck and the overhead of message passing. This paper proposes the method of task allocation to soften the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing among processors. In order to evaluate the performance of the proposed method in terms of the number of disk accesses and message passing, we conduct experiments on the two kinds of parallel spatial join algorithms. The experimental tests on the MIMD parallel machine with shared disks show that the proposed semi-dynamic task allocation method outperforms the static and dynamic task allocation methods.

• Journal of KSNVE
• /
• v.11 no.3
• /
• pp.401-409
• /
• 2001

Passive type mufflers installed on every car haute inherent problem of lowering engine power and fuel efficiency caused by backpressure which is byproduct of complex internal structure. Recent improvements like installing a calve to change exhaust gas path depending on power requirement and rpm have only marginally improved performance. Tremendous amount of recent research works on active exhaust noise control have failed to commercialize because of numerous physical and economical reasons. In this paper, a unique seal-active muffler using difference of transmission paths is presented. In this system exhaust pipe is divided into two and joined again downstream. Exhaust noise is reduced by destructive interference when two-divided noise join again with transmission paths'difference which is half of the wavelength of a main noise frequency. One divided path has a sliding mechanism to change length thereby transmission path length difference is adjusted to entwine rpm change. The proposed system has minimal backpressure and does not need a secondary sound source like a speaker so it can overcome many problems of failed active noise control methods. We have verified proposed system's superior performance by simulation and comparison experiment with passive mufflers.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.1
• /
• pp.31-50
• /
• 1996

In this paper we prescribe a replication server scheme with an algorithm DRF (Differential Refresh File) to refresh multiple materialized views and replicas in distributed environments. Before sending relevant tuples in server sites to client sites, an effective tuple reduction scheme is developed as a preprocessor to reduce the transmission cost. Because it utilizes differential files with out touching base relations, the DRF scheme can help to minimize the number of locks, which enhances the system's performance.