• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.6
• /
• pp.55-65
• /
• 2011

Recently, use of cloud computing service is dramatically increasing due to wired and wireless communications network diffusion in a field of high performance Internet technique. Cloud computing is a model for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, servers, storage, applications, and services) that can be rapidly provisioned and released with minimal management effort or service provider interaction. In a view of digital forensic investigation, it is difficult to obtain data from cloud computing service environments. therefore, this paper suggests analysis method of AWS(Amazon Web Service) and Rackspace which take most part in cloud computing service where IaaS formats presented for data acquisition in order to get an evidence.

• Journal of Creative Information Culture
• /
• v.7 no.3
• /
• pp.157-165
• /
• 2021

As the use of various application services utilizing Web and IoT and the need for large amounts of data management expand accordingly, the importance of efficient data expression and exchange scheme and data query processing is increasing. JSON, characterized by its simplicity, is being used in various fields as a format for data exchange and data storage instead of XML, which is a standard data expression and exchange language on the Web. This means that it is important to develop indexing and query processing techniques to effectively access and search large amounts of data expressed in JSON. Therefore, in this paper, we modeled JSON data with a hierarchical structure in a tree form, and proposed indexing and query processing using the path concept. In particular, we designed an index structure using a suffix array widely used in text search and introduced simple and complex path-based JSON data query processing methods.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.1
• /
• pp.149-156
• /
• 2023

This research tried to develop an ESS electricity trading system linked with blockchain for energy participation consumers. For the purpose of publishing renewable energy ESS power amount and demand information, we will build a smart contract system on the blockchain DB, utilize the blockchain DB data of energy prosumers and consumers, and expand the power trading market flexibly. to provide realistic solutions. Therefore, the main contents of the development of the ESS power trading system linked to the blockchain are cloud-based web construction for ESS management, coin issuance and exchange registration for activating the blockchain, and to reflect the blockchain technology, building a blockchain database for collecting and supplying ESS-based production demand data, selecting a blockchain-based platform and building a foundation, and creating a smart contract, etc.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.39-52
• /
• 2005

GML (Geography Markup Language) has become the widely adopted standard for transport and storage of geographic information. So, various researches such as modeling, storage, query, and etc have been studied to provide the interoperability of geographic information in web environments. Especially, there are increased needs to store semi-structured data such as GML documents efficiently. Therefore, in this paper, we design and implement a GML repository to store GML documents on the basis of GML schema using spatial database system. GML Schema is converted into directed GML schema graph and the schema mapping technique from directed schema graph to spatial schema is presented. Also, we define the conversion rules on spatial schema to preserve the constraints of GML schema. GML repository using spatial database system is useful to provide the interoperability of geographic information and to store and manage enormous GML documents.

• Journal of Digital Contents Society
• /
• v.11 no.3
• /
• pp.393-398
• /
• 2010

Composite and compact devices equipped with the functionality of digital still image acquisition, such as cellular phones and MP3 players are widely available to common users. In addition, the application of digital still images is becoming common among security and digital recording devices. The amount of still images, that are maintained or shared in personal storage or massive storage provided by various web services, are rapidly increasing. These still images are bound with file names or identifiers that are provided arbitrarily by users or that are generated from device specific naming method. However, those identifiers are vulnerable for unexpected changing or eliminating so that it becomes a problem in still image search or management. In this paper, we propose a method for still image identifier generation that is created from the still image internal information.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.486-489
• /
• 2002

Construction management has been a target of the result and the index which were decided by whether the resourecs(time, cost and progress...etc) were used. but this has been serious problems in time and cost because of the shortage of storage space, the incident, lowering of efficiency for works, working impossible of between work categories and the demage of finished products. Therefore I noticed that more correct and more objective establish of data collecting system was necessary. it was through the diversification of information for exchange and communication between the construction site and participants. DVR(Digital Video Recorder) and internet technology were suggested for a solution to this problem. the collected information by DVR was divided to 3 steps as how long it used and how much it processed for improving efficiency of using and storage of information. and then it was verified through applying to cases at construction site.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1216-1222
• /
• 2016

The advent of large-scale web services has resulted in gradual increase in the amount of data used in those services. These big data are managed efficiently by DBMS such as MySQL and MariaDB, which use InnoDB engine as their storage engine, since InnoDB guarantees ACID and is suitable for handling large-scale data. To improve I/O performance, InnoDB caches data and index of its database through a buffer pool. It also supports multiple buffer pools to mitigate lock contentions. However, the multiple buffer pool scheme leads to the additional data consistency overhead. In this paper, we analyze the overhead of the multiple buffer pool scheme. In our experimental results, although multiple buffer pool scheme mitigates the lock contention by up to 46.3%, throughput of DMBS is significantly degraded by up to 50.6% due to increased disk I/O and fsync calls.

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

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.157-164
• /
• 2006

Since XML is emerging as the de facto standard for exchanging and representation of data on the web, the amount of XML data has rapidly increased. Thus, the need for effective store and retrieval of U data has arisen. Since the existing techniques such as XRel which is an XML storage and management technique using RDBMS simply record the existing all label paths, diverse classes of label path expressions could not be efficiently supported. In this paper, we present a technique which supports storage and retrieval for XML data using RDBMS efficiently compared with the existing approaches. Since the proposed technique keeps the XML path index on the relational database and replace label paths with path identifiers, diverse XML queries can be evaluated compared with existing approaches. Also, the proposed technique does not require the modification of the relational database engine and consumes the disk space less. Our experimental result demonstrates the better query performance compared with existing techniques.

• The Journal of the Korea Contents Association
• /
• v.8 no.11
• /
• pp.57-64
• /
• 2008

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used), LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The proposed policy considers file size to reduce the number of files corresponding to a requested file rather than forecasting the uncertain future for replacement. The results of the simulation show that hit ratio was similar when the cache size was small, but the proposed policy was superior to traditional policies when the cache size was large.