• Convergence Security Journal
• /
• v.7 no.1
• /
• pp.11-17
• /
• 2007

This paper related to implementing issue and performance measuring about blended mechanism between networking technology and security technology. We got more effectiveness in overall network security, when applying and composing amalgamated security mechanism between network technology and security technology. The blended method offers $8{\sim}10%$ effective result in network security than the isolated ways of applying relational two technologies. As a result, we suggest amalgamated security mechanism between network technology and security technology, and also, we propose the blended method as a model of more effective way.

• Journal of Information Technology Services
• /
• v.7 no.3
• /
• pp.145-157
• /
• 2008

The existing XML storage methods which use relational data model, usually store path information for every node type including literal contents in order to keep the structural information of XML documents. Such path information is usually maintained by an inverted index to efficiently process XPath queries for large XML documents. In this study, We propose an improved approach that retrieve information from the large volume of XML documents stored in a relational database, while using a segment-based inverted index for path searches. Our new approach can reduce the number of searching an inverted index for getting target path information. We show the effectiveness of this approach through several experiments that compare XPath query performance with the existing methods.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.5
• /
• pp.257-265
• /
• 2004

The complex documentation involved in power system analysis software require a well-defined and friendly database system. We have developed an object-oriented database management system for power system analysis, and have described load flow analysis and transient stability analysis using object-oriented database(OODB). Database management systems are widely used and achieve high reliability of data management in the engineering fields. However relational database system have shortcomings in application to power system analysis. ill relational database, the data model is too simple for modeling complex data and database languages are very different from programming languages. Object-oriented techniques are sufficiently powerful to support data-modeling requirements of GUI applications. The GUI is implemented using C++ on a MS windows platform. The OODB supports data modeling requirements of GUI applications and the performance is well acceptable for Gill applications.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.17 no.4
• /
• pp.17-22
• /
• 2018

A glove valve regulates the flow in a pipeline as a kind of control valve. However, when the disc and seat contact, the valve structure can be distorted and flow can leak due to the elongation of the valve material under high pressure. The surface texture is not good enough to seal the contact surface (in practice) because the lapping process is usually done manually. Furthermore, assembly performance is analyzed by structural analysis. Compared with a standard seat, the newly designed seat had a smaller radial deformation and a larger longitudinal deformation. Therefore, the newly designed seat can maintain a tight and uniform contact with the disc with a reduced radial deformation and an expanded available seal area with an increased longitudinal deformation. The seal performance of the glove valve has been improved in a cost-effective manner.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.46
• /
• pp.33-49
• /
• 1998

In order to improve the performance of relational databases, one has to reduce the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to reduce the number of disk I/O accesses by vertically partitioning relation into fragments and allowing attribute replication to fragments if necessary. When zero-one integer programming model is solved by the branch-and-bound method, it requires much computing time to solve a large sized problem. Therefore, heuristic solutions using genetic algorithm(GA) are presented. GA in this paper adapts a few ideas which are different from traditional genetic algorithms, for examples, a rank-based sharing fitness function, elitism and so on. In order to improve performance of GA, a set of optimal parameter levels is determined by the experiment and makes use of it. As relations are vertically partitioned allowing attribute replications and saved in disk, an attribute replicating vertical partition method by GA can attain less access cost than non-attribute-replication one and require less computing time than the branch-and-bound method in large-sized problems. Also, it can acquire a good solution similar to the optimum solution in small-sized problem.

• Journal of Korea Multimedia Society
• /
• v.22 no.9
• /
• pp.1036-1045
• /
• 2019

Relational databases have a notion of normalization, in which the model for storing data is standardized according to the organization's business processes or data operations. However, the graph database is relatively early in this standardization and has a high degree of freedom in modeling. Therefore various models can be created with the same data, depending on the database designers. The essences of the graph database are two aspects. First, the graph database allows accessing relationships between the objects semantically. Second, it makes relationships between entities as important as individual data. Thus increasing the degree of freedom in modeling and providing the modeling developers with a more creative system. This paper introduces different graph models with test data. It compares the query performances by the results of response speeds to the query executions per graph model to find out how the efficiency of each model can be maximized.

• Journal of KIBIM
• /
• v.12 no.2
• /
• pp.12-25
• /
• 2022

To increase the usability of Building Information Modeling (BIM) in construction projects, it is critical to ensure the interoperability of data between heterogeneous BIM software. The Industry Foundation Classes (IFC), an international ISO format, has been established for this purpose, but due to its structural complexity, geometric information and properties are not always transmitted correctly. Recently, deep learning approaches have been used to learn the shapes of the BIM elements and thereby verify the mapping between BIM elements and IFC entities. These models performed well for elements with distinct shapes but were limited when their shapes were highly similar. This study proposed a method to improve the performance of the element type classification by using an Ensemble model that leverages not only shapes characteristics but also the relational information between individual BIM elements. The accuracy of the Ensemble model, which merges MVCNN and MLP, was improved 0.03 compared to the existing deep learning model that only learned shape information.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.36-38
• /
• 2000

An optoelectronic database filter chip for high performance database computers and applications is proposed. The proposed device is designed to perform the selection and projection operations of relational database operation on-the-fly in page-parallel manner to increase the overall performance of a database system. The device utilizes CMOS smart pixel array consists of detector and combinational logic circuit to perform the selection and projection operation.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.123-131
• /
• 2020

The pattern query in graph database has advantages of easy query expression and high query processing performance compared to relational database SQL. However, unlike the relational database, the graph database may not utilize the advantages of pattern query depending on modeling because the methodology for building the logical data model is not defined. In this study, in the is-a node modeling method that appears during the graph modeling process, we experiment that there is a difference in performance between graph pattern query when designing with a generalization model and designing with a specialization model. As a result of the experiment, it was shown that better performance can be obtained when the is-a node is designed as a specialization model. In addition, when writing a pattern query, we show that if a variable is bound to a node or edge, performance may be better than that of the variable of not bounded. The experimental results can be presented as an is-a node modeling method for pattern query and a graph query writing method in the graph database.

• Journal of KIISE:Databases
• /
• v.34 no.1
• /
• pp.18-34
• /
• 2007

In order to provide various business analysis methods, OLAP(On-Line Analytical Processing) systems represent their data with multidimensional structures. These multidimensional data are often delivered to users in the horizontal format of tables whose columns are corresponding to values of dimension attributes. Since the horizontal tables nay have a large number of columns, they cannot be stored directly in relational database systems. Furthermore, the tables are likely to have many null values (i.e., sparse tables). In order to manage the horizontal tables efficiently, we can store them as the vertical format of tables which has dimension attribute names as their columns thus transforms the columns of horizontal tables into rows. In this way, every queries for horizontal tables have to be transformed into those for vertical tables. This paper proposed a technique for transforming horizontal table queries into vertical table ones by utilizing not only traditional relational algebraic operators but also the PIVOT operator which recent DBMS versions are providing. For achieving this goal, we designed a relational algebraic expression equivalent to the PIVOT operator and we formally proved their equivalence. Then, we developed a transformation technique for horizontal table queries using the PIVOT operator. We also performed experiments to analyze the performance of the proposed method. From the experimental results, we revealed that the proposed method has better performance than existing methods.