• The KIPS Transactions:PartD
• /
• v.13D no.6 s.109
• /
• pp.755-764
• /
• 2006

In recent, data streams are generated in various application fields such as a ubiquitous computing and a sensor network, and various algorithms are actively proposed for processing data streams efficiently. They mainly focus on the restriction of their memory usage and minimization of their processing time per data element. However, in the algorithms, if data elements of a data stream are generated in a rapid rate for a time unit, some of the data elements cannot be processed in real time. Therefore, an efficient load shedding technique is required to process data streams effcientlv. For this purpose, a load shedding technique over a data stream is proposed in this paper, which is based on the predicting technique of the frequency of data element considering its current frequency. In the proposed technique, considering the change of the data stream, its threshold for tuple alive is controlled adaptively. It can help to prevent unnecessary load shedding.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.15-23
• /
• 2004

This paper presents distributive web-caching technique on the Head-End-Network (HNET) to solve excessive load of multimedia sever and inefficient use of network resources, The proposed web-caching is not concentration of load for a specific Head-End-Node(HEN), and it has advantage that there is no copy of a specific item on distributive HENs. This technique distributively stores on HENs partial streams of requested videos from clients connected to HENs and the order of store streams follows the order of request of identical video items from HENs. Thus, storing streams on each HEN that requests sevice are different. When a client requests the cached video on some HENs, the HEN that connects him receives streams in the order of store from HENs which stored them and it transmits them to him. These procedures are performed under the control of SA. This technique uses cache replacement algorithm that the combination of LFU, LRU and the last remove for the first stream of videos In order to reduce end-to-end delay.

• Asia pacific journal of information systems
• /
• v.31 no.4
• /
• pp.575-581
• /
• 2021

In this opinion article, we review the current streams of the information systems (IS) literature on crowdfunding and discuss how the literature has contributed to expanding our understanding of crowdfunding. Reflecting on the review, we propose avenues for future research to expand the existing knowledge on this impactful topic for the benefit of researchers and practitioners.

• The KIPS Transactions:PartD
• /
• v.17D no.5
• /
• pp.353-358
• /
• 2010

Unlike the traditional databases, queries on XML streams are restricted to a real time processing and memory usage. In this paper, a robust labeling scheme is proposed, which quickly identifies structural relationship between XML fragments. The proposed labeling scheme provides an effective query processing by removing many redundant operations and minimizing the number of fragments being processed. In experimental results, the proposed labeling scheme efficiently processes query processing and optimizes memory usage.

• Journal of Internet Computing and Services
• /
• v.20 no.2
• /
• pp.21-27
• /
• 2019

The terrestrial ATSC 3.0 broadcasting system, which is capable of converging broadcast and communication services, uses IP based technology for data transmission between broadcasting equipment. In addition, data transmission between broadcasting equipment uses IP-based technology like existing wired communication network, which has advantageous in terms of equipment construction and maintenance In case IP based data transmission technology is used, however, it may inevitably cause an error that a packet is lost during transmission depending on the network environments. In order to cope with a broadcasting accident caused by such a transmission error or a malfunction of a broadcasting apparatus, a broadcasting system is generally configured as a duplication, which can transmit a normal packet when various types of error may occur. By this reason, correction method of error packets and intelligent switching technology are essential. Therefore, in this paper, we propose a design and implementation of intelligent IP switch for Ensuring Reliability of ATSC 3.0 Broadcast Streams. The proposed intelligent IP consists of IP Stream Analysis Module, ALP Stream Analysis Module, STL Stream Analysis Module and SMPTE 2022-1 based FEC Encoding/Decoding Module.

• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.93-105
• /
• 2012

A data stream is a series of tuples which are generated in real-time, incessant, immense, and volatile manner. As new information technologies are actively emerging, stream processing methods are being needed to efficiently handle data streams. Especially, finding out an efficient evaluation for a multi-way join would make outstanding contributions toward improving the performance of a data stream management system because a join operation is one of the most resource-consuming operators for evaluating queries. In this paper, in order to evaluate efficiently a multi-way join continuous query, we propose a novel method to decrease the cost of a query by eliminating unsuccessful intermediate results. For this, we propose a matrix-based structure for monitoring data streams and estimate the number of final result tuples of the query and find out unsuccessful tuples by matrix multiplication operations. And then using these information, we process efficiently a multi-way join continuous query by filtering out the unsuccessful tuples in advance before actual evaluation of the query.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.365-369
• /
• 2009

Overlapping windows are generally used for queries to process continuous data streams. Nevertheless, existing approaches discussed join algorithms only for basic types of windows such as tumbling windows and tuple-driven windows. In this paper, we propose an efficient join algorithm for overlapping windows, which are considered as a more general type of windows. The proposed algorithm is based on an incremental window join. It focuses on producing join results continuously when the memory overflow frequently occurs. It consists of (1) a method to use both of the incremental and full joins selectively, (2) a victim selection algorithm to minimize latency of join processing and (3) an idle time professing algorithm. We show through our experiments that the selective use of incremental and full joins provides better performance than using one of them only.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.355-364
• /
• 2005

With fast advances in computing power and network technologies, online streaming services of continuous media (CM) have been popularly implemented on the Web. To implement such services, a variety of CM streams need to be processed efficiently, so that the Sweep scheme was proposed. This scheme has several advantages such as hiccup-free playbacks and seek-time optimization. In this scheme, however, the entire CM streams are scheduled with a single scheduling period, called a cycle. Since only one scheduling period is allowed in this scheme, a significant amount of disk time is usually wasted because of its inflexible disk schedules. To solve this, we propose a new dynamic Sweep scheme. For this, we devise an algorithm that is able to expand scheduling periods of serviced CM streams and propose a new admission control mechanism guaranteeing hiccup-free playbacks. To show performance gains, we execute various simulation experiments. From the experimental results, we can see that the proposed scheme outperforms the Sweep scheme in terms of disk utilization and scheduling flexibility.

• Journal of Digital Convergence
• /
• v.20 no.2
• /
• pp.217-223
• /
• 2022

Subspace clustering for online data streams requires a large amount of memory resources as all subsets of data dimensions must be examined. In order to track the continuous change of clusters for a data stream in a finite memory space, in this paper, we propose a grid-based subspace clustering algorithm that effectively uses memory resources. Given an n-dimensional data stream, the distribution information of data items in data space is monitored by a grid-cell list. When the frequency of data items in the grid-cell list of the first level is high and it becomes a unit grid-cell, the grid-cell list of the next level is created as a child node in order to find clusters of all possible subspaces from the grid-cell. In this way, a maximum n-level grid-cell subspace tree is constructed, and a k-dimensional subspace cluster can be found at the k^th level of the subspace grid-cell tree. Through experiments, it was confirmed that the proposed method uses computing resources more efficiently by expanding only the dense space while maintaining the same accuracy as the existing method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.4
• /
• pp.273-287
• /
• 2001

In this paper, we introduce our experience for designing and implementing a media manager in the Integrated Streaming Service Architecture (ISSA) developed by the authors. The media manager is regarded as a necessary module in the ISSA framework for the following reasons. It realizes that from which locations of the media source devices, the media streams are coming. Once it knows where the origin is, the media manager should recognizes what types of stream are. After that, it performs how to chose an appropriate CODEC to handle the recognized input streams efficiently, and what type of media playback device should be selected. In order to do such a job efficiently, the proposed media manager consists of two modules source module and sink module. The major role of a media source module is to make an abstraction for the media streams that are coming from various types of media device. This, in consequence, enables a media manager to consistently handle tlle media streams without considering wherever they come from. On the other hand, the media sink module distributes the input streams to an appropriate media device to playback. One of the remarkable virtues of the proposed media manager is an ability to supporting high value-added database services since it provides an interface between the ISSA and real-time multimedia database. Also, it provides the RTP!RTSP source filter and Winamp gateway modules which allow the flexibility to the system. Moreover, the media manager can adopt any types of new media which in fact will provide scalability to the ISSA.