• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.923-926
• /
• 2010

A sensor network system processes user queries using the recent field data collected by each sensor node. To process user queries, the system propagates the queries to the specific sensor nodes which have the relevant data and aggregates the results of the queries. However, if continuous queries are processed by the existing scheme, the system has the problem where the queries are propagated repeatedly. In this paper, we propose the query processing scheme to process the continuous queries over the sensor streaming data. To do this, each sensor node builds its own query index on its node. And, we present the scheme to deal with the unexpected data rising on the sensor node.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.4
• /
• pp.171-180
• /
• 2016

As social networking services such as twitter become increasingly popular, data streams are widely prevalent these days. In order to search data accumulated from data streams efficiently, the use of an index structure is essential. In this paper, we propose an update-efficient, disk-based inverted index structure for efficient keyword search on data streams. When new data arrive at the data stream, the index needs to be updated to incorporate the new data. The traditional inverted index is very inefficient to update in terms of disk I/O, because all index data stored in the disk need to be read and written to the disk each time the index is updated. To solve this problem, we divide the whole inverted index into a sequence of inverted indices with exponentially increasing size. When new data arrives, it is first inserted into the smallest index and, later, the small indices are merged with the larger indices, which leads to a small amortize update cost for each new data. Furthermore, when indices stored in the disk are merged with each other, we minimize the disk I/O cost incurred for the merge operation, resulting in an even smaller update cost. Through various experiments, we compare the update efficiency of the proposed index structure with the previous one, and show the performance advantage of the proposed structure in terms of the update cost.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.117-130
• /
• 2006

With the rapid development of technologies related to Ubiquitous Sensor Network (USN), sensors are being utilized in various application areas. In general, the data sensed by each sensor node on ubiquitous sensor networks are stored into the central server for efficient search. Because update is delayed to reduce the cost of update in this environment, uncertain data can be stored in the central server. In addition, Uncertain data make query processing produce wrong results in the central server. Thus, this paper examines how to process uncertain data in ubiquitous sensor networks and suggests a new index for efficient processing of uncertain data. The index reduces the cost of update by delaying update in uncertainty areas. Uncertainty areas are areas where uncertain data are likely to exist. In addition, it solves the problem of low accuracy in search resulting from update delay by delaying update only for specific update areas. Lastly, we analyze the performance of the index and prove the superiority of its performance by comparing its performance evaluation.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.44-49
• /
• 2009

In recent years, with the development of portable terminals, various searching services on large data have been provided in portable terminals. In order to search large data, most applications for information retrieval use indexes such as B-trees or R-trees. However, only a small portion of the data set is accessed by users, and the access frequencies of each data are not uniform. The existing indexes such as B-trees or R-trees do not consider the properties of the skewed access patterns. And a cache stores the frequently accessed data for fast access in memory. But the size of memory used in the cache is restricted. In this paper, we propose a new index based on disk, called J-tree, which considers user's search patterns. The proposed index is a balanced tree which guarantees uniform searching time on all data. It also supports fast searching time on the frequently accessed data. Our experiments show the effectiveness of our proposed index under various settings.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1255-1267
• /
• 2008

Evaluation indices for products or services are important to improve the internal process of the company and to compare those with competitive ones. The sigma level in Six Sigma management does important role to evaluate the core characteristic, CTQ(Critical To Quality), derived in the considered product/service or process. In this research, we propose an overall evaluation index for the product/service or process with multiple characteristics, in other words, multiple CTQs. The proposed overall evaluation index is useful for the cases that the single CTQ is not enough to evaluate the practical interests, for example, the final products and services with complex procedures and relatively large scaled processes. This approach is discussed with sigma level for applying Six Sigma Projects, however, it is applicable to indices based on proportion or percentage as well. The practical examples with a manufacturing process and a customer survey based on focus group interview are given for illustrations.

• Journal of Intelligence and Information Systems
• /
• v.2 no.2
• /
• pp.43-54
• /
• 1996

Financial markets are operating 24 hours a day throughout the world and interrelated in increasingly complex ways. Telecommunications and computer networks tie together markets in the from of electronic entities. Financial practitioners are inundated with an ever larger stream of data, produced by the rise of sophisticated database technologies, on the rising number of market instruments. As conventional analytic techniques reach their limit in recognizing data patterns, financial firms and institutions find neural network techniques to solve this complex task. Neural networks have found an important niche in financial a, pp.ications. We a, pp.y neural networks to Standard and Poor's (S&P) 500 stock index futures trading to predict the futures marker behavior. The results through experiments with a commercial neural, network software do su, pp.rt future use of neural networks in S&P 500 stock index futures trading.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.389-405
• /
• 2015

Most traditional database systems exploit a record-oriented model where the attributes of a record are placed contiguously in a hard disk to achieve high performance writes. However, for read-mostly data warehouse systems, the column-oriented database has become a proper model because of its superior read performance. Today, flash memory is largely recognized as the preferred storage media for high-speed database systems. In this paper, we introduce a column-oriented database model based on flash memory and then propose a new column-aware flash indexing scheme for the high-speed column-oriented data warehouse systems. Our index management scheme, which uses an enhanced $B^+$-Tree, achieves superior search performance by indexing an embedded segment and packing an unused space in internal and leaf nodes. Based on the performance results of two test databases, we concluded that the column-aware flash index management outperforms the traditional scheme in the respect of the mixed operation throughput and its response time.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.323-326
• /
• 2008

Data Envelopment Analysis (DEA) is a theoretically sound framework for performance analysis that offers many advantages over traditional methods such as performance ratios and regression analysis. Largely the result of multidisciplinary research during the last three decades in economics, engineering and management, DEA is best described as an effective new way of visualizing and analyzing performance data. Besides, overseas information technology companies have aggressively tried to enter the domestic market. In the age of globalization and high competition, it is imperative that the system integration (SI) companies need to introduce the performance evaluation models of SI projects, including Capability Maturity Model and Software Process Improvement and Capability Determination, to gain a competitive advantage. Therefore, it makes our research regarding evaluation of SI projects very opportune. The purpose of the study is not only to evaluate efficiency of each project by DEA but also to gain insight into various factors such as project complexity, team members' man-months structure, and process index(project management index) that link to the projects performance.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_3
• /
• pp.1847-1859
• /
• 2022

Wildfires in North Korea can have a directly or indirectly affect South Korea if they go south to the Demilitarized Zone. Therefore, this study calculates the regional optimized Forest Fire Danger Index (FFDI) based on Local Data Assessment and Prediction System (LDAPS) weather data to obtain forest fire risk in North Korea, and applied it to the cases in Goseong-gun and Cheorwon-gun, North Korea in April 2022. As a result, the suitability was confirmed as the FFDI at the time of ignition corresponded to the risk class Extreme and Severe sections, respectively. In addition, a qualitative comparison of the risk map and the soil moisture map before and after the wildfire, the correlation was grasped. A new forest fire risk index that combines drought factors such as soil moisture, Standardized Precipitation Index (SPI), and Normalized Difference Water Index (NDWI) will be needed in the future.

• Journal of Information Technology Services
• /
• v.22 no.4
• /
• pp.123-140
• /
• 2023

In recent times, the global economy has been subject to increasing volatility, which has made it considerably more difficult to accurately predict economic indicators compared to previous periods. In response to this challenge, the present study conducts an exploratory investigation that aims to predict the Business Survey Index (BSI) by leveraging data mining techniques on both structured and unstructured data sources. For the structured data, we have collected information regarding foreign, domestic, and industrial conditions, while the unstructured data consists of content extracted from newspaper articles. By employing an extensive set of 44 distinct data mining techniques, our research strives to enhance the BSI prediction accuracy and provide valuable insights. The results of our analysis demonstrate that the highest predictive power was attained when using data exclusively from the t-1 period. Interestingly, this suggests that previous timeframes play a vital role in forecasting the BSI effectively. The findings of this study hold significant implications for economic decision-makers, as they will not only facilitate better-informed decisions but also serve as a robust foundation for predicting a wide range of other economic indicators. By improving the prediction of crucial economic metrics, this study ultimately aims to contribute to the overall efficacy of economic policy-making and decision processes.