• Journal of the Korean association of regional geographers
• /
• v.3 no.2
• /
• pp.105-120
• /
• 1997

One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.342-352
• /
• 2006

Current studies on storing XML data are focused on either mapping XML data to existing RDBMS efficiently or developing a native XML storage. Some native XML storages store each XML node with parsed object form. Clustering, the physical arrangement of each object, can be an important factor to increase the performance with this storing method. In this paper, we propose re-clustering techniques that can store an XML document efficiently. Proposed clustering technique uses path similarities among data nodes, which can reduce page I/Os when returning query results. And proposed technique can process a path query only using small number of clusters as possible instead of using all clusters. This enables efficient processing of path query because we can reduce search space by skipping unnecessary data. Finally, we apply existing clustering techniques to store XML data and compare the performance with proposed technique. Our results show that the performance of XML storage can be improved by using a proper clustering technique.

• Spatial Information Research
• /
• v.19 no.6
• /
• pp.87-100
• /
• 2011

Recently, a variety of GML application schemas have been designed in many fields. GML application schemas are specific to the application domain of interest and specify object types using primitive object types defined in the GML standard. GML instance documents are created based on such GML application schemas. The GML instance documents generally require large volumes to represent huge amounts of geographic objects. Thus, it is essential to store such GML instance documents in relational database for efficient management and use. Relational database is relatively convenient to use and is widely applied in various fields. Furthermore, it is fundamentally more efficient than file structure to handle large datasets. Many researches on storing GML documents have been carried out so far. However, there are few studies on storage of GML instance documents. Therefore, in this study, we developed the storage module to store the GML instance documents in relational database.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.1
• /
• pp.163-170
• /
• 2022

This paper introduces a method of extracting facial features due to unrefined inputs in real life and improving the problem of not guaranteeing the ideal performance and speed of the object recognition model through a storage algorithm through weight summation. Many facial recognition processes ensure accuracy in ideal situations, but the problem of not being able to cope with numerous biases that can occur in real life is drawing attention, which may soon lead to serious problems in the face recognition process closely related to security. This paper presents a method of quickly and accurately recognizing faces in real time by comparing feature points extracted as input with a small number of feature points that are not overfit to multiple biases, using that various variables such as picture composition eventually take an average form.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.37-44
• /
• 2009

Recently, as the quality of multimedia data gets higher, multimedia servers require larger storage capacity and higher I/O bandwidth. In these large scale multimedia servers, the load-unbalance problem among disks due to the difference in access frequencies to multimedia objects according to their popularities significantly affects the system performance. To address this problem, many data replication schemes have been proposed. In this paper, we propose a novel data migration/replication scheme to provide better storage efficiency and performance than the dynamic data replication scheme which is typical data replication scheme employed in multimedia servers. This scheme can reduce the additional storage space required for replication, which is a major defect of replication schemes, by decreasing the number of copies per object. The scheme can also increase the number of concurrent users by increasing the caching effect due to the reduced lengths of the intervals among requests for each object.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1724-1737
• /
• 1999

Multimedia data service applications have to store and manipulate LOBs(unstructured large objects) composing multimedia data. As such, the tertiary storage devices such as an optical disk jukebox and a tape library that consist of a number of platters (the disks in case of an optical disk jukebox and the cartridge tapes in case of a tape library) have been considered essential for the storage system of a DBMS in order to efficiently support storage and management of vary large volume of data. Since the latency with tertiary storage is too long, the schemes for efficient retrieval of LOBs out of tertiary storage need to be investigated. In this paper, we investigated the tertiary I/O Considering the performance characteristics of the LOBs, we proposed various I/O scheduling heuristic algorithms that reduce latency in query processing with LOB retrieval from tertiary storage, and evaluated their performance through a detailed simulation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.4
• /
• pp.135-142
• /
• 2023

Recently, many companies are using public cloud services or building their own data center because digital transformation is expanding. The software-defined storage is a key solution for storing data on the cloud platform and its use is expanding worldwide. Software-defined storage has the advantage of being able to virtualize and use all storage resources as a single storage device and supporting flexible scale-out. On the other hand, since the size of an object is variable, an imbalance occurs in the use of the disk and may cause a failure. In this study, a method of redistributing objects by optimizing disk weights based on storage state information was proposed to solve the imbalance problem of disk use, and the experimental results were presented. As a result of the experiment, it was confirmed that the maximum utilization rate of the disk decreased by 10% from 89% to 79%. Failures can be prevented, and more data can be stored by optimizing the use of disk.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.303-310
• /
• 2002

In this paper, we propose a proxy caching scheme that stores a portion of a continuous media object or an entire object on the Internet. The proxy stores the initial fraction of a continuous media object and determines the optimal size of the initial fraction of the continuous media object to be cached based on the object popularity. Under the proposed scheme, the initial latency of most clients and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Considering the characteristics of continuous media, we also propose the novel popularity for the continuous media objects based on the amount of the data of each object played by the clients. Finally, we have performed trace-driven simulations to evaluate our caching scheme and the popularity for the continuous media objects. Through these simulations, we have verified that our caching scheme, PPC outperforms other well-known caching schemes in terms of BHR, DSR and replacement and that popularity for the continuous media objects based on the amount of the playback data can enhance the performance of caching scheme.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 1996.06a
• /
• pp.79-109
• /
• 1996

In order to transform the underground utility data into the 3-D spatial objects, this thesis defined the type of the 3-D spatial objects and the storage structure of objects, and developed the spatial data transformation system that transforms the 2-D underground utility data into the pre-defined 3-D spatial objects through the Booch Method, an object-oriented development method. For this sake, the relational data model of ARC/INFO and the storage structure are analyzed, as well as the pre-requisites, required for the 3-D visualization of the underground utilities. Also, the 2-D underground utility data, saved in ARC/INFO, were transformed into the ASCII files through the internal pre-processing procedure, then used as the input data of the transformation system. In addition, to develop the transformation system, the object-oriented development methods are studied first and, then, applied to the system analysis and the design procedure with the Booch Method as a development method. Finally, the results of analysis and design procesure are implemented through AML, a ARC/INFO macro language, and C++, an object-oriented programing language. As a result of this study, the 3-D spatial objects that can visualize the 2-D utilities in 3-D, are acquired, and the adaptation of object-oriented development method to the system development procedure enabled an effective development prodedure.

• Journal of the Korean Institute of Gas
• /
• v.18 no.1
• /
• pp.31-40
• /
• 2014

LNG storage outer tank is a vertically and horizontally prestressed concrete wall structure. Therefore, when the storage tanks become larger, prestressing tendons become longer and eventually the prestressing loss becomes larger. Also, recently, bomb terrors and accidental crashes have occurred frequently on important infrastructures. Therefore, LNG storage tanks are also exposed to these dangerous scenarios, where they need to be evaluated and protected from these threats. Therefore, in this study, the behavior of 270,000 kL LNG storage outer tank impacted by a flying object is evaluated using implicit FEM code, LS-DYNA. In the analysis, the prestress loss due to the increased length of prestressing tendons from enlargement of outer tank is considered. A comparison study between the LNG tanks with and without prestress loss is performed to investigate the impact behavior and the effect of prestressing force change on the safety and serviceability prestressed concrete containment.