• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.531-542
• /
• 2005

In this paper, we propose the MDBMS(Multi-DataBase Management System) which integrates the LDBMSs(Local DataBase Systems) with heterogeneous environment into distributed system and provides global users with rapidly query process. For designing the MDBMS, we define the functions of components and design the interaction among them. In a point of view of the global view manager in components, we describe the following 3 cases; (1)the case which the results for the global query are all stored to the global view repository, (2)the case which no result exists in the global view repository, and (3)the case which the partial results we stored to the global view repository. By comparing above cases, we establish the functionalities of our MDBMS through the sequence diagram including the interlace of among objects and the method calling. Finally, we propose the model designed in the concrete by showing the executing procedures of each function using sample query on established functions mentioned above.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.309-316
• /
• 2005

Recently, RFID system is a main technology to realize ubiquitous computing environments, but the feature of the RFID system may bring about various privacy problem. So, many kinds of protocols To resolve this problem are researched. In this paper, we analyse the privacy problem of the previous methods and propose more secure and effective authentication protocol to protect user's privacy. Then we prove that the proposed protocol is secure and effective as we compare the proposed protocol with previous methods. The proposed protocol is based on Challenge-Response using one-way hash function and random number. The proposed protocol is secure against replay attack, spoofing attack and so on. In addition, the proposed protocol is proper for distributed database environment.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.9-18
• /
• 2002

In this paper, we propose scalable scheduling techniques based on EDF to efficiently integrate hard real-time and multimedia soft real-time tasks in the distributed real-time multimedia database system. Hard tasks are guarangteed based on worst case execution times, whereas multimedia soft tasks are served based on mean execution times. This paper describes a served-based scheme for partitioning the CPU bandwidth among different task classes that coexist in the same system. To handle the problem of class overloads characterized by varying number of tasks and varying task arrival rates, thus scheme shows how to adjust the fraction of the CPU bandwidth assigned to each class. This scheme fixes the maximum time that each hard task can execute in the period of the server, whereas it can dynamically change the bandwidth reserved to each multimedia task. The proposed method is capable of minimizing the mean tardiness of multimedia tasks, without jeopardizing the schedulability of the hard tasks. The performance of this scheduling method is compared with that of similar mechanisms through simulation experiments.

• The Journal of the Korea Contents Association
• /
• v.3 no.2
• /
• pp.57-64
• /
• 2003

A Web Service is an URL addressable set of functionality that is exposed over a network to serve as a building Hock for creating distributed applications. SOAP is a protocol that Web Service consumers often use, when they request and response to a Web Service, and it is a lightweight, XML-based protocol over HTTP for exchange to information in decentralized, distributed environments. A Web Service is very useful forimplementing common functions in especially a large size business area, because it is invoked by a protocol like HTTP or SOAP that we easily use, and by an XML-based data format In this paper, we implement Web Services that process dip data by computers in enterprise accounts in order to enhance the transparency and productivity of enterprises. we analyse the structure of slip data, design dip database, implement stored procedures for manipulating data of slip database, and make thorn controlled by Web Services. The result of this paper will contribute to the standardization and activation of accounting process systems for e-business area.

• Korean Journal of Remote Sensing
• /
• v.11 no.2
• /
• pp.1-16
• /
• 1995

This study is conducted to eveluate the potential of a GIS to assist an application problem. GIS has been applied to rainfall-runoff modeling over Soyang area. Various rainfall-runoff models have been developed over the years. A distributed rainfall-runoff model is selected because it considers the topographic characteristics over the basin. GIS can handle the spatial data to enhance the modeling. GRASS-a public domain GIS S/W-is used for GIS tools. Digital database is generated, including soil map, vegetation map, digital elevation model, basin and subbasin map, and water stream. The inpu data for the model has been generated and manupulated using GIS. The database, model and GIS are integrated for on-line operation. The inflow hydrographs are tested for the flood of Sept., 1990. This shows the promising results even without the calibration.

• Journal of the Korea Convergence Society
• /
• v.12 no.7
• /
• pp.45-51
• /
• 2021

In accordance with the rapid non-face-to-face environment and mobile first strategy, the explosive increase and creation of many structured/unstructured data every year demands new decision making and services using big data in all fields. However, there have been few reference cases of using the Hadoop Ecosystem, which uses the rapidly increasing big data every year to collect and load big data into a standard platform that can be applied in a practical environment, and then store and process well-established big data in a relational database. Therefore, in this study, after collecting unstructured data searched by keywords from social network services based on Hadoop 2.0 through three virtual machine servers in the Spring Framework environment, the collected unstructured data is loaded into Hadoop Distributed File System and HBase based on the loaded unstructured data, it was designed and implemented to store standardized big data in a relational database using a morpheme analyzer. In the future, research on clustering and classification and analysis using machine learning using Hive or Mahout for deep data analysis should be continued.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.11
• /
• pp.471-478
• /
• 2014

Database replication is utilized to increase credibility, availability and prevent overload of distributed databases. Two models currently exist for replication - Master/Slave and Multi-Master. Since the Multi-Master model has problems of increasing complexity and costs to interface among multiple databases for updates and inserts, the Master/Slave model is more appropriate when frequent data inserts and updates are required. However, Master/Slave model also has a problem of not having exact criteria when systems choose to connect between Master and Slave for transactions. Therefore, this research suggests a routing algorithm based on AOP (Aspect Oriented Programming) in the Master/Slave database model. The algorithm classifies applications as cross-cutting concerns based on AOP, modularizes each concern, and routes transactions among Master and Slave databases. This paper evaluates stability and performance of the suggested algorithm through integration tests based on scenarios.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.767-773
• /
• 2017

In a distributed system environment, such as a cloud database, the tail latency needs to be kept short to ensure uniform quality of service. In this paper, through experiments on a Cassandra database, we show that long tail latency is caused by a lack of memory space because the database cannot receive any request until free space is reclaimed by writing the buffered data to the storage device. We observed that, since the performance of the storage device determines the amount of time required for writing the buffered data, the performance degradation of Solid State Drive (SSD) due to garbage collection results in a longer tail latency. We propose a garbage collection synchronization technique, called SyncGC, that simultaneously performs garbage collection in the java virtual machine and in the garbage collection in SSD concurrently, thus hiding garbage collection overheads in the SSD. Our evaluations on real SSDs show that SyncGC reduces the tail latency of $99.9^{th}$ and, $99.9^{th}-percentile$ by 31% and 36%, respectively.

• Journal of Korea Multimedia Society
• /
• v.9 no.6
• /
• pp.742-749
• /
• 2006

In the network-based game where it uses the Internet infrastructure, the implementation is possible with the various methods. Such Applications are developed in the multi-tired architecture. There are many cases for the server to be separated from the hardware or the software. In this case, a lot of applications make the distributed process possible and are made as the multi-tiered architecture to develop the reusability of the existing software module. Especially, it is mostly general to separate for the case of a database server to a new tier. One of the important points of multi-tiered server side applications is security and because of this, it is difficult to share the related data about the design skill. Using design patterns, it gives help in reusing the existing written-code for the design of the game that needs a lot of money and time. Design Patterns are related to the software reuse. For the development of more efficient games, if well-defined design patterns are provided to the developers, then it would make more easy advanced game API and make possible the framework for the game development based on the API Through the analysis of the general network-based game currently servicing in the Internet, in this paper, we discuss how to implement a business logic tier using database system among the server side architectures. The main objective of this article is to show an efficient APIs(Application Programming Interfaces) design method which can be used to manage the data that must be saved to the database system among the packets that client/server have to be exchange.

• Journal of the Korean Society for Railway
• /
• v.19 no.4
• /
• pp.445-455
• /
• 2016

A goal of the Real-time railway safety supervision system is to improve the safety oversight efficiency and to prevent accidents by integrating existing distributed monitoring systems, train, signal, power and facilities. So, the system require better performance regarding real-time processing based on big data. The disk-based database that is used in existing railway control systems has a problem with real-time processing; memory-based databases haves a limitation in terms of big-data processing; and time series databases haves a limitation in terms of real-time processing. So, we need a new database architecture for simultaneous real-time processing based on big data. In this study, we review the existing railway monitoring systems and propose a new database architecture for a real-time railway safety supervision system.