• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1125-1128
• /
• 1987

This paper proposes a method which distributes the structure data represented by a tree and handles it. To distribute and handle the structure data, this method partitions a structure data and distributes the partitioned structure in multiple processing element and allocates the partitioned structure. Each processing element includes the structure memory to store the partitioned structure and the structure controller to handle efficiently the distributed structure. As the structure is distributed and is stored in the structure memory and is handled by the structure controller, the processing time is reduced.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.5
• /
• pp.364-374
• /
• 2012

In this paper, we proposed a data structure to represent structural components of solid rocket motors (SRM) in an automated design program. To propose the data structure, we searched the necessary functions for the automated design program should have. In order to design the structural components of solid rocket motors sufficiently with a design program, it should have the functions to represent the shapes of the components, the drawing and analysis models, the design variables, various product structures, interferences, characteristic properties, design equations, and tightening sets. By modifying the data structure of an element object that is a general purpose data structure to represent a general component of a product, a new data structure was proposed to satisfy all the necessary functions with optimum. Finally, a design program for the structural components of solid rocket motors was developed successfully with the proposed data structure.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.191-204
• /
• 2006

Many previous studies of data quality have focused on the realization and evaluation of both data value quality and data service quality. These studies revealed that poor data value quality and poor data service quality were caused by poor data structure. In this study we focus on metadata management, namely, data structure quality and introduce the data quality management maturity model as a preferred maturity model. We empirically show that data quality improves as data management matures.

• International Journal of Internet, Broadcasting and Communication
• /
• v.5 no.1
• /
• pp.14-17
• /
• 2013

RDF data is widely used for exchanging data nowadays to enable semantic web era. This leads to the need for storing and retrieving these data efficiently and effectively. Recently, the structure index in graph-based perspective is considered as a promising approach to deal with issues of complex query graphs. However, even though there are many researches based on structure indexing, there can be a better architectural approach instead of addressing the issue as a part. In this research, we propose architecture for storing, query processing and retrieving RDF data in efficient manner using structure indexing. Our research utilizes research results from iStore and 2 relation-based approaches and we focus on improving query processing to reduce the time of loading data and I/O cost.

• 한국방재학회:학술대회논문집
• /
• 2007.02a
• /
• pp.497-500
• /
• 2007

Data structure was designed not only to estimate LCC but also to analyze time-variant reliability index of plate girder bridges. Information model for data structure was categorized into cost information, cost variable information, user cost information, and reliability analysis information according to the characteristic of data. EXPRESS language of STEP was adopted to describe the data structure for the electronic representation of LCC information. The suitability of the developed data structure was verified by estimating LCC and analyzing time-variant reliability index of a plate girder bridge considering corrosion on the basis of the constructed test database.

• The Journal of Information Technology and Database
• /
• v.7 no.1
• /
• pp.55-65
• /
• 2000

Information semantics is a well-known issue in areas of information systems researches. It describes what data mean, how they are created, where they can be applied to ; thus, it provides indispensable information for management of data. This article proposes to formalize information semantics by the processes that data are created or transformed. A scheme is proposed to describe an information production structure, which is called an information structure graph. An information structure graph is a directed graph, whose leaves are primary input data objects and whose root and internal nodes are output objects. Information semantics is derived from an information structure graph that has data as its root. For this, rules are proposed to manipulate and compare graphs. The structural relationships among information structure graphs are mapped into semantic relationships among data.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.3
• /
• pp.191-199
• /
• 2007

In order to construct a data warehouse of process plant equipment, a classification structure should be defined first, identifying not only the equipment categories but also attributes of an each equipment to represent the specifications of equipment. ISO 15926 Process Plants is an international standard dealing with the life-cycle data of process plant facilities. From the viewpoints of defining classification structure, Part 2 data model and Reference Data Library (RDL) of ISO 15926 are seen to respectively provide standard syntactic structure and semantic vocabulary, facilitating the exchange and sharing of plant equipment's life-cycle data. Therefore, the equipment data warehouse with an ISO 15926-based classification structure has the advantage of easy integration among different engineering systems. This paper introduces ISO 15926 and then discusses how to define a classification structure with ISO 15926 Part 2 data model and RDL. Finally, we describe the development result of an ISO 15926-based classification structure for a variety of equipment consisting in the reactor coolant system (RCS) of APR 1400 nuclear plant.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.851-867
• /
• 1999

Numerous proposals for extending the relational data model as well as conceptual and object-oriented data models have been suggested. However, there has been relatively less research in the area of defining segmented storage structure and data migration strategies for temporal data. This paper presents the segmented storage structure in order to increment search performance and the two data migration strategies for segmented storage structure. this paper presents the two data migration strategies : the migration strategy by Time granularity, the migration strategy by LST-GET. In the migration strategy by Time Granularity, the dividing time point to assign the entity versions to the past segment, the current segment, and future segment is defined and the searching and moving process for data validity at a granularity level are described. In the migration strategy by LST-GET, we describe the process how to compute the value of dividing criterion. searching and moving processes are described for migration on the future segment and the current segment and entity versions 새 assign on each segment are defined. We simulate the search performance of the segmented storage structure in order to compare it with conventional storage structure in relational database system. And extensive simulation studies are performed in order to compare the search performance of the migration strategies with the segmented storage structure.

• KSCI Review
• /
• v.1 no.2
• /
• pp.73-94
• /
• 1995

In this paper, design of efficient NDB(Network Data Base) for the activation plan of chain information network. The DB structure build up, logical structure, store structure, physical structure, the data express for one's record, and the express using linked in the releation of data. Also express as hierarchical model on the DSD(Data Structure Diagram) from the database with logical structure. Each node has express on record type, the linked in course of connective this type, the infuence have efficent of access or search of data, in the design for connection mutually a device of physical, design for database, and construction a form of store for logical. Also activation of chain information network of efficent, using POS(Point Of Sale) system in OSI(Open Systems Interconnection) environment for network standardization, and build up network a design for system.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.1
• /
• pp.33-41
• /
• 2009

Triangular mesh models are widely used in reverse engineering, computer graphics, rapid prototyping and NC(numerical controller) tool-path generation. Triangular mesh models are generated from point clouds, surface models and solid models. A halfedge-based triangular mesh data structure is proposed and the development considerations are presented. In the presented data structure, halfedge is the key data structure. Halfedge stores its triangle index and the order in the triangle. Triangles do not store the halfedge lists explicitly. Halfedge is referred by value and defined when it is required. Proposed data structure supports four design requirements: efficient rendering, compact memory, supporting efficient algorithms and easy programming.