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

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.149-157
• /
• 2012

In this thesis, the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join state. One approximation scenario is to provide a maximum subset of the result, with the objective of losing as few result tuples as possible. An alternative scenario is to provide a random sample of the join result, e.g., if the output of the join is being aggregated. It is shown formally that neither approximation can be addressed effectively for a sliding-window join of arbitrary input streams. Previous work has addressed only the maximum-subset problem, and has implicitly used a frequency based model of stream arrival. There exists a sampling problem for this model. More importantly, it is shown that a broad class of applications for which an age-based model of stream arrival is more appropriate, and both approximation scenarios under this new model are addressed. Finally, for the case of multiple joins being executed with an overall memory constraint, an algorithm for memory allocation across the join that optimizes a combined measure of approximation in all scenarios considered is provided.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.292-305
• /
• 2009

Wireless sensor networks have a lot of application areas such as industrial process control, machine and resource management, environment and habitat monitoring. One of the main objects of using wireless sensor networks in these areas is the event detection. To detect events at a user's request, we need a join processing between sensor data and the predicates of the events. If there are too many predicates of events compared with a node's capacity, it is impossible to store them in a node and to do an in-network join with the generated sensor data This paper proposes a predicate-merge based in-network join approach to efficiently detect multiple events, considering the limited capacity of a sensor node and many predicates of events. It reduces the number of the original predicates of events by substituting some pairs of original predicates with some merged predicates. We create an estimation model of a message transmission cost and apply it to the selection algorithm of targets for merged predicates. The experiments validate the cost estimation model and show the superior performance of the proposed approach compared with the existing approaches.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.639-649
• /
• 2000

In the relational database systems, the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed to reduce the execution time. Multiple hash join algorithm using allocation tree is one of most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. In this paper, to solve the performance degrading problem by the delay, we develop a join algorithm using the concept of 'synchronization of page execution time' for multiple hash joins. We reduce the processing time of each nodes in the allocation tree and improve the total system performance. In addition, we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.459-468
• /
• 2008

A data stream which is a massive unbounded sequence of data elements continuously generated at a rapid rate. Many recent research activities for emerging applications often need to deal with the data stream. Such applications can be web click monitoring, sensor data processing, network traffic analysis. telephone records and multi-media data. For this. data processing over a data stream are not performed on the stored data but performed the newly updated data with pre-registered queries, and then return a result immediately or periodically. Recently, many studies are focused on dealing with a data stream more than a stored data set. Especially. there are many researches to optimize continuous queries in order to perform them efficiently. This paper proposes a query optimization algorithm to manage continuous query which has multiple join operators(Multi-way join) over data streams. It is called by an Extended Greedy query optimization based on a greedy algorithm. It defines a join cost by a required operation to compute a join and an operation to process a result and then stores all information for computing join cost and join cost in the statistics catalog. To overcome a weak point of greedy algorithm which has poor performance, the algorithm selects the set of operators with a small lay, instead of operator with the smallest cost. The set is influenced the accuracy and execution time of the algorithm and can be controlled adaptively by two user-defined values. Experiment results illustrate the performance of the EGA algorithm in various stream environments.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.259-267
• /
• 2013

GIS-based web map service is all the more accessible to the public. Among others, location query services are most frequently utilized, which are currently restricted to only one keyword search. Although there increases the demand for the service for querying multiple keywords corresponding to sequential activities(banking, having lunch, watching movie, and other activities) in various locations POI, such service is yet to be provided. The objective of the paper is to develop the k-IPS algorithm for quickly and accurately querying multiple POIs that internet users input and locating the search outcomes on a web map. The algorithm is developed by utilizing hierarchical tree structure of $R^*$-tree indexing technique to produce overlapped geometric regions. By using recursive $R^*$-tree index based spatial join process, the performance of the current spatial join operation was improved. The performance of the algorithm is tested by applying 2, 3, and 4 multiple POIs for spatial query selected from 159 keyword set. About 90% of the test outcomes are produced within 0.1 second. The algorithm proposed in this paper is expected to be utilized for providing a variety of location-based query services, of which demand increases to conveniently support for citizens' daily activities.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.732-741
• /
• 2001

In the relational database systems the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed 개 reduce the execution time Multiple hash join algorithm using allocation tree is one of the most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. This delay problem was solved by using the concept of synchronization of page execution time with we had proposed In this paper the effects of the performance improvements in each node of the allocation tree are extended to the whole allocation tree and the performance evaluation about that is processed. In addition we propose an efficient algorithm for multiple hash joins in limited number of processor environments according to the relationship between the number of input relations in the allocation tree and the number of processors allocated to the tree. Finally. we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.603-605
• /
• 2015

Recent IoT (Internet Of Things) development of the technology is growing rapidly. When multiple devices to perform operations on the IoT environment, it is possible to improve the efficiency of operations by different devices to join the collaborative relationship (Relation) between. Research on existing methods and has been used and the user to issue commands to each device P2M (Person to Machine) method, is now being replaced by effective M2M (Machine to Machine) manner than by way bring forth the relationship between the device P2M. In this paper, we define the relationship between the device and bring forth proposals for collaborative data transfer algorithms. To block the operation duplicated between different work through the proposed algorithm and is believed to improve the efficiency of work to do.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.585-596
• /
• 2007

XML data generally consists of a hierarchical tree-structure which is reflected in mechanisms to store and retrieve XML data. Therefore, when storing XML data in the database, the hierarchical relationships among the XML elements are taken into consideration during the restructuring and storing of the XML data. Also, in order to support the search queries from the user, a mechanism is needed to compute the hierarchical relationship between the element structures specified by the query. The structural join operation is one solution to this problem, and is an efficient computation method for hierarchical relationships in an in database based on the node numbering scheme. However, in order to process a tree structured XML query which contains a complex nested hierarchical relationship it still needs to carry out multiple structural joins and results in another problem of having a high query execution cost. Therefore, in this paper we provide a preprocessing mechanism for effectively reducing the cost of multiple nested structural joins by applying the concept of equivalence classes and suggest a query path reduction algorithm to shorten the path query which consists of a regular expression. The mechanism is especially devised to reduce path queries containing branch nodes. The experimental results show that the proposed algorithm can reduce the time requited for processing the path queries to 1/3 of the original execution time.

• Journal of Korea Port Economic Association
• /
• v.24 no.2
• /
• pp.155-174
• /
• 2008

This paper proposed several activation strategies at both the government and company parts for the development of domestic third party logistics(TPL) to pull electronic trade era much earlier. In the government side, it must need to arrange and integrate complex regulation rules on the Logistics for more smooth access and use the TPL market. Also, it has to provide multiple support policies such as tax reduction, technical and financial service providing, and logistics information system to TPL. Finally, it should construct the government levels education system to train and forster a competent man who is well qualified as a electronic and logiscic expert. The TPL company must build up a total logistics information system concerned with an innovative operation system such as SCM, JIT etc. which can provide logistic services on demand to the electronic trade customers to maximize consumer satisfaction. In the shipper company level, it try to join a long-term strategic alliance with TPL to reduce logistic cost and increase logistic service to its electronic trade consumers.