• International Journal of Computer Science & Network Security
• /
• v.23 no.10
• /
• pp.164-168
• /
• 2023

There are many possible ways to configure database management systems (DBMSs) have challenging to manage and set.The problem increased in large-scale deployments with thousands or millions of individual DBMS that each have their setting requirements. Recent research has explored using machine learning-based (ML) agents to overcome this problem's automated tuning of DBMSs. These agents extract performance metrics and behavioral information from the DBMS and then train models with this data to select tuning actions that they predict will have the most benefit. This paper discusses two engineering approaches for integrating ML agents in a DBMS. The first is to build an external tuning controller that treats the DBMS as a black box. The second is to incorporate the ML agents natively in the DBMS's architecture.

• The Journal of Information Systems
• /
• v.14 no.3
• /
• pp.17-22
• /
• 2005

Location management is very important in location-based services to provide services to the mobile users like banking, city guides and many more. Ubiquitous and mobile devices are the source of data in location management and its significant operations are update and search method. Some studies to improve these were presented by using optimal sequential paging, location area scheme and hierarchical database scheme. In addition, not all location services have the same access methods on data and it lead to difficulties of providing services. A proposed location management of multi-agent architecture is presented in this study. It shows the coordination of the agents on the distributed database of location-based services. The proposal focuses on the location management of the mobile object presented in a hierarchical search and update. Also, it uses a nearest neighbor technique for efficient search method of mobile objects.

• Journal of Computing Science and Engineering
• /
• v.4 no.2
• /
• pp.173-187
• /
• 2010

Recent technological advances in mobile communication systems have made explosive growth in the number of mobile device users worldwide. One of the most important issues in designing a mobile computing system is location management of users. The hierarchical systems had been proposed to solve the scalability problem in location management. The scalability problem occurs when there are too many users for a mobile system to handle, as the system is likely to react slow or even get down due to late updates of the location databases. In this paper, we propose a top-down clustering algorithm for hierarchical location database systems in a wireless network. A hierarchical location database system employs a tree structure. The proposed algorithm uses a top-down approach and utilizes the number of visits to each cell made by the users along with the movement information between a pair of adjacent cells. We then present a modified algorithm by incorporating the exhaustive method when there remain a few levels of the tree to be processed. We also propose a capacity constraint top-down clustering algorithm for more realistic environments where a database has a capacity limit. By the capacity of a database we mean the maximum number of mobile device users in the cells that can be handled by the database. This algorithm reduces a number of databases used for the system and improves the update performance. The experimental results show that the proposed, top-down, modified top-down, and capacity constraint top-down clustering algorithms reduce the update cost by 17.0%, 18.0%, 24.1%, the update time by about 43.0%, 39.0%, 42.3%, respectively. The capacity constraint algorithm reduces the average number of databases used for the system by 23.9% over other algorithms.

• Proceedings of the Korea Database Society Conference
• /
• 1994.09a
• /
• pp.105-129
• /
• 1994

The information system of corporations are facing a new environment expressed by miniaturization, decentralization and Open System. It is therefore of utmost importance for corporations to adapt flexibly th such new environment by providing for corresponding changes to their existing information systems. The objectives of this study are to identify this new environment faced by today′s information system and develop effective methods for data resource management under this new environment. In this study, it is assumed that the new environment faced by information systems can be specified as Distributed Computing Environment, and in order to achieve such system, presents Client/server architecture as its representative computing structure, This study defines Client/server architecture as a computing architecture which specialize the fuctionality of the client system and the server system in order to have an application distribute and perform cooperative processing at the best platform. Furthermore, from among the five structures utilized in Client/server architecture for distribution and cooperative processing of application between server and client this study presents two different data management methods under the Client/server environment; one is "Remote Data Management Method" which uses file server or database server and. the other is "Distributed Data Management Method" using distributed database management system. The result of this study leads to the conclusion that in the client/server environment although distributed application is assumed, the data could become centralized (in the case of file server or database server) or decentralized (in the case of distributed database system) and the data management method through a distributed database system where complete responsibility and powers with respect to control of data used by the user are given not only is it more adaptable to modern flexible corporate environment, but in terms of system operation, it presents a more efficient data management alternative compared to existing data management methods in terms of cutting costs.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.113-119
• /
• 2000

In this paper, we design and implement a query processor of real-time main memory database systems, which reflect the characteristics of main memory database systems and satisfy timing constraints. The proposed query processor manages real-time data that has timing constraint by exploiting meta database. It supports CLI in order to make application programs. It also supports extended CLI and stored CLI. The former can be expressed the Information on real-time transaction. The latter is designed to support frequently processed transaction. The proposed query processor is implemented as query processor of real-time database management systems. We Present performance evaluation results that illustrate ratio of transaction, which satisfy deadline are increased by the query processing ability of system and the efficient management of real-time data.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.275-277
• /
• 2003

This paper deals with Object-oriented Database(OODB) which is designed for power system analysis, and describes load flow analysis using OODB. Database management systems are widely used and achieve high reliability of data management in the engineering fields. However conventional database systems, relational database system, have disadvantages in application to power system analysis. This paper presents advantages of OODB for modeling complex data of a power system analysis. The OODB supports data modeling requirements of GUI applications and the performance is well acceptable for GUI applications.

• Journal of Information Technology Applications and Management
• /
• v.12 no.2
• /
• pp.29-43
• /
• 2005

The paper presents the EBORD (Extended Benchmark for Object-Relational Databases) benchmark, which is an extension of the BORD benchmark for object-relational databases. The EBORD benchmark is developed to evaluate the database common functions that should be supported in modern database systems. Besides the 36 test queries already defined in the BORD benchmark, totally 22 test queries in five categories are newly defined in order to measure the index-relevant performance issues and database import capabilities. The EBORD benchmark also features scalability, use of a synthesized database, and a query-oriented evaluation. In order to show the feasibility of the proposed benchmark, we implement it with two commercial database systems. The experimental results and analyses are also reported.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.3
• /
• pp.469-476
• /
• 2016

Relational Database Management Systems have become de facto database model among most developers and users since the inception of Data Science. From IoT devices, sensors, social media and other sources, data is generated in structured, semi-structured and unstructured formats, in huge volumes, thereby the difficulty of data management greatly increases. Organizations that collect large amounts of data are increasingly turning to non relational databases - NoSQL databases. In this paper, through experiments with real field data, we demonstrate that MongoDB, a document-based NoSQL database, is a better alternative for building a Telco Subscriber Data Management System which hitherto is mainly built with Relational Database Management Systems. We compare the existing system in various phases of data flow with our proposed system powered by MongoDB. We show how various workloads at some phases of the existing system were either completely removed or significantly simplified on the new system. Based on experiment results, using MongoDB for managing telco subscriber data turned out to offer performance better than the existing system built with MSSQL Server.

• The Journal of Information Systems
• /
• v.4
• /
• pp.85-104
• /
• 1995

In a loosely-coupled distributed database server system, a server failure and/or a communication failure can be masked by a resiliency mechanism. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. The resiliency mechanism for transaction processing is achieved by keeping redundant information using a primary/backup approach. The purpose of this paper is to analyze the performance improvement opportunities with the resiliency mechanism and to present the design of the proposed system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.1989-1999
• /
• 1999

Many people are the latest interested in the integration of the WWW and database systems. The UCM(United CGI Management) system, which is proposed on this study, is based on the method using CGI that does not change existing servers and clients to integrate the WWW and database system. Since the CGI executable architecture executes a CGI program whenever the database is accessed, the system performance is reduced greatly when many request to the database are made simultaneously. However, the UCM system improves the system performance since it uses the integrated CGI running a daemon process. Moreover, the proposed system can use the WWW database more economically and doesn't use the SQL because it does not use a DBMS. In UCM system, we define the extended HTML tags to implement the WWW database interface and use the EXODUS storage manager for accessing the database.