• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.413-416
• /
• 2008

In the presence of multiple continuous queries, multi-query optimizing is a new challenge to process multiple stream data in real-time. So, in this paper, we proposed an approach to optimize multi-query of sliding window on network traffic data streams and do some comparisons to traditional queries without optimizing. We also detail some method of scheduling on different data streams, while different scheduling made different results. We test the results on variety of multi-query processing schedule, and proofed the proposed method is effectively optimized the data stream similar multi-queries.

• Journal of ILASS-Korea
• /
• v.3 no.3
• /
• pp.1-13
• /
• 1998

In this study, an experimental study was performed to investigate the breakup mechanism of vaporizing droplet. A well-controlled experimental apparatus was used to study breakup mechanisms of a monodisperse stream of drops injected into a transverse high temperature and velocity air stream. The experiments gave information$ about the microscopic structure of the liquid drop breakup process, drop breakup regimes, and drop trajectories in high temperature flow region. The breakup time, drop acceleration and wavelength of surface instability wave were measured from a high-magnification and double spark photography. The two instability theories, i.e., Kelvin-Helmholtz instability and Rayleigh-Taylor instability, were estimated by comparing the calculated data with the measurements. The results showed that the breakup time in high temperature flow condition is shortened because the surface tension is decreased by the increase of gas temperature.

• Journal of Environmental Science International
• /
• v.22 no.5
• /
• pp.523-531
• /
• 2013

In this study, a method of simulating ephemeral stream runoff characteristics in Jeju watershed is newly suggested. The process based conceptual-physical scheme is established based on the SWAT-K and applied to Cheonmi-cheon watershed which shows the typical pattern of ephemeral stream runoff characteristics. For the proper simulation of this runoff, the intermediate flow and baseflow are controlled to make downward percolation should be dominant. The result showed that surface runoff simulated by using the modified scheme showed good agreement with observed runoff data. In addition, it was found that the estimated runoff directly affected the groundwater recharge rate. This conceptual model should be continuously progressed including rainfall interception, spatially estimated evapotranspiration and so forth for the reasonable simulation of the hydrologic characteristics in Jeju island.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1546-1564
• /
• 2012

Pattern-based query processing has not attracted much attention in wireless sensor network though its counterpart has been studied extensively in data stream. The methods used for data stream usually consume large memory and much energy. This conflicts with the fact that wireless sensor networks are heavily constrained by their hardware resources. In this paper, we use piece wise representation to represent sensor nodes' collected data to save sensor nodes' memory and to reduce the energy consumption for query. After getting data stream's and patterns' approximated line segments, we record each line's slope. We do similar matching on slope sequences. We compute the dynamic time warping distance between slope sequences. If the distance is less than user defined threshold, we say that the subsequence is similar to the pattern. We do experiments on STM32W108 processor to evaluate our strategy's performance compared with naive method. The results show that our strategy's matching precision is less than that of naive method, but our method's energy consumption is much better than that of naive approach. The strategy proposed in this paper can be used in wireless sensor network to process pattern-based queries.

• Journal of the Korean association of regional geographers
• /
• v.3 no.2
• /
• pp.19-35
• /
• 1997

The purpose of this study is to find out the characteristics of landform in Geoje-Do using GIS and DTED data. The characteristics of landform in Geoje-Do are as follows; First, the height-range of Geoje-Do is $0{\sim}580m$, and the average elevation of it is 124m. Volcanic and granite region is mainly appeared at high elevation-region. But, we can't find out outstanding difference of elevation, according to its geology. The second. the slope-range of Geoje-Do is $0{\sim}52$ degree, and the average slope of it is 17.6 degree. The slope of volcanic and granite area is more steeper than any other region. But the results of analysis of the geology in Geojo-Do, don't show outstanding difference of the slope. The third, the area-rate of the aspect of Geoje-Do is almost same in all direction. And the area-rate of south-west direction is the highest. According to the geology of Geoje-Do, granite is distributed the most widely, and the area of volcanic and granite occupy 60% of entire island's area. According to analysis of influence of geology with elevation, geology has little relationship with elevation. According to analysis of geology and drainage network, streams are inclined to be developed well in Alluvium area. Drainage network is well developed throughout the entire island, except southeast area. The highest order of stream is 4 in 1:25,000 topographic map. The density of stream in Geoje-Do is very high, such as 1.6. The bifurcation-ratio of stream is also higher than 4 in all order. The length-ratio of stream is ranged from 1.24 to 3.25. According to the relationship between order and elevation. order is the greater, elevation is the lower. According to the relationship between order and slope, order is the greater, slope is the gentler. In this study, we use DTED Data, and compare it with topographic map data. According to the comparison, there is a little difference between DTED data and topographic map data. Therefore, to use DTED data in landform analysis, it is required coordinate matching process. This process is very important, and take very long time. Thus, if you use DTED in landform analysis, some processes are required. DTED data can be taken very easily, but its using is not simple. Because coordinate adjust is very hard work.

• 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 the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.31-40
• /
• 2012

u-GIS DSMSs have been researched to deal with various sensor data from GeoSensors in ubiquitous environment. Also, they has been more important for high availability. The data from GeoSensors have some characteristics that increase explosively. This characteristic could lead memory overflow and data loss. To solve the problem, various load shedding methods have been researched. Traditional methods drop the overloaded tuples according to a particular criteria in a single server. Tuple deletion sensitive queries such as aggregation is hard to satisfy accuracy. In this paper a dual processing load shedding method is suggested to improve the accuracy of aggregation in clustering environment. In this method two nodes use replicated stream data for high availability. They process a stream in two nodes by using a characteristic they share stream data. Stream data are synchronized between them with a window as a unit. Then, processed results are merged. We gain improved query accuracy without data loss.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.53-59
• /
• 2016

Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.79-88
• /
• 2009

The volume of memory to store real-time data stream is varied dynamically. Continuous queries processing the data stream must manage the storage volume dynamically. In previous research, according to current volume of data a general memory manager which allocates and releases memory by a page unit is researched.However, the method frequently executes page allocation and release to store data stream. Moreover, particularly delayed queries can monopolize many of pages because the method directly allocates pages when a query has not enough memory. Focusing on the problems in memory management systems, this research proposes a memory management method which reduces the frequency of allocation and release and uniformly distributes pages for queries. The method can reduce the frequency of allocation and release through allocation based on utilization ratio of pages in each query and prevent memory monopoly through memory allocation which considers query delay.