• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.373-383
• /
• 2004

There have been an emerging interests in the importance of database tuning techniques under modem database environments in which very large-scale data should be managed. In Particular. database performance parameters should be tuned to reflect system loads appropriately. This paper presents two parameter tuning strategies, namely throughput-based and response-time-based, which tune each performance parameter accordingly. The proposed techniques are applied to two commercial database systems in the TPC-W benchmark to see the effectiveness of those methods. The results show that they can help improve system performance considerably.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1041-1048
• /
• 2004

Database logs contain various information on database operations, but they are used to recover database systems from failures generally. This paper proposes a log analysis tool that provides useful information for database tuning. This tool provides users with information on work-load organization, database schemas, and resources usages of queries. This paper describes the tool in views of its architecture, functions, implementation, and verification. The tool is verified by running the TPC-W benchmark, and representative analysis results are also presented.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.86-99
• /
• 2005

In this paper, we suggest a system which automatically verifies and tunes transaction processing database applications based on program analysis technology. This system automatically verifies two kinds of transaction processing errors. The first case is the un-closed transaction. In this case, data is not updated as expected or performance of overall system can decrease seriously by locking some database tables until the process terminates. The second case is the miss-use of transaction isolation(inking) level. This causes runtime exception or abnormal termination of the program depending on runtime environment. This system automatically tunes two kinds of inefficient definition of transaction processing which decrease the performance of overall system. The first case happens when opened transaction is closed too late. And the second case happens when transaction isolation level is set too high.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.747-754
• /
• 2004

Database administrators should be aware of performance characteristics of database systems in order to manage database system effectively. The usages of system resources in database systems could be quite different under database workloads. The objective of this paper is to identify and analyze performance characteristics of database systems in different workloads, which could help database tuners tune database systems Under the TPC-C and TPC-W workloads, which represent typical workloads of online transaction processing and electronic commerce respectively, we investigated usage types of resource that are determined by fourteen performance indicator, and are behaved in response to changes of four tuning parameters (data buffer, private memory, I/O process, shared memory). Eight out of the fourteen performance indicators cleary show the performance differences under the workloads. Changes of data buffer parameter give a influences to database system. The tuning parameter that affects the system performance significantly is the database buffer size in the both workloads.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.416-428
• /
• 2005

In the paper we propose an index method for XML streaming services, where a server broadcasts XML data to a lot of clients in wireless information systems. In order to control the access and tuning time of mobile clients, the proposed method constructs the XML stream through replicating partial index intermixed with parts of data. For this purpose, we propose a two-level tree structure for separating index and XML data into two parts: replicated vs. non-replicated. We analyze the performance of the proposed method with respect to access time and tuning time. With the analysis result, we derive the optimal level value.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.117-128
• /
• 2006

In this paper, we propose a streaming method for XML data that supports energy-efficient processing of queries over the stream in mobile clients. We propose new stream organizations for XML data which have different kinds of addresses to related data in a stream. We describe event-driven stream generation algorithms for the proposed stream structures and provide search algorithms for simple XML path queries which leverage the access mechanisms incorporated in the stream. Experimental results show that our approaches can effectively improve the tuning time performance of user queries in a wireless broadcasting environment.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.518-532
• /
• 2008

Broadcast scheme has been widely researched for efficient data delivery in the mobile environment because the downlink capacity of a mobile client is much greater than the uplink capacity, and the power of a mobile client is limited. In the proposed scheme, the index lets the client know when data items would be broadcasted and enables the client to minimize the tuning time and power consumption. Single channel index schemes are fit to flat broadcast that performs well when all the broadcasted data items are accessed with the same probability whereas the multi-disk broadcast scheme is proper when the data access distribution is skewed. The existing index schemes, however, cannot work on the Multi-disk broadcast scheme because they cannot point the replicating data items in a broadcast cycle. This paper proposes a Multi-disk Exponential Index (MDEI) which is a single channel index scheme fit to Multi-disk broadcast scheme. Because MDEI scheme organizes a separate index for each disk, it functions with multi-disk broadcast, resulting in a greater reduction of average access latency than that of other flat-broadcast index schemes when the data access distribution is skewed. The performance evaluation showed that MDEI has a good performance when data access distribution is skewed. MDEI has short average access latency and not much average tuning time when the data access distribution is skewed.

• Journal of KIISE:Databases
• /
• v.36 no.1
• /
• pp.50-62
• /
• 2009

In wireless and mobile environments, data broadcasting is recognized as an effective way for data dissemination due to its benefits to bandwidth efficiency, energy-efficiency, and scalability. In this paper, we address the problem of delayed query processing raised by tree-based index structures in wireless broadcast environments, which increases the access time of the mobile clients. We propose a novel distributed index structure and a clustering strategy for streaming XML data which enable energy and latency-efficient broadcast of XML data. We first define the DIX node structure to implement a fully distributed index structure which contains tag name, attributes, and text content of an element as well as its corresponding indices. By exploiting the index information in the DIX node stream, a mobile client can access the wireless stream in a shorter latency. We also suggest a method of clustering DIX nodes in the stream, which can further enhance the performance of query processing over the stream in the mobile clients. Through extensive performance experiments, we demonstrate that our approach is effective for wireless broadcasting of XML data and outperforms the previous methods.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.158-170
• /
• 2008

In response to the changing demands of ever competitive market, SK Telecom has built a new marketing system that can support dynamic marketing campaigns and, at the same time, scale up to the large volumes of data and transactions for the next decade. The system which employs Unix-based client-server (using Web browser interfaces) architecture will replace the current mainframe-based COIS system. The project, named NGM (Next Generation Marketing ), is unprecedentedly large in scale. However, both managerial and technical problems led the project into a crisis. The application framework that depended on a software solution from a major global vendor could not support the dynamic functionalities required for the new system. In March 2005, SK telecom declared the suspension of the NGM project. The second phase of the project started in May 2005 following a comprehensive replanning. It was decided that no single existing solution could cope with the complexity of the new system and hence the new system would be custom-built. As such. a number of technical challenges emerged. In this paper, we report on the three key dimensions of technical challenges - middleware and application framework, database architecture and tuning, and system performance. The processes and approaches, adopted in building NGM system, may be viewed as "best practices" in the telecom industry. The completed NGM system, now called "U.key System," successfully came into operation on the ninth of October, 2006. This new infrastructure is expected to give birth to a series of innovative, fruitful, and customer-oriented applications in the near future.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.203-208
• /
• 2010

This paper deals with an efficient index scheduling technique based on Hilbert curve and MBR for k-NN query in a single wireless broadcast channel environment. Previous works have two major problems. One is that they need a long time to process queries due to the back-tracking problem. The other is that they have to download too many spatial data since they can not reduce search space rapidly. Our proposed method broadcasts spatial data based on Hilbert curve order where a distributed index table is also broadcast with each spatial data. Each entry of index table represents the MBR which groups spatial data. By predicting the unknown location of spatial data, our proposed index scheme allows mobile clients to remove unnecessary data and to reduce search space rapidly. As a result, our method gives the decreased tuning time and access latency.