• 제목/요약/키워드: data structure

검색결과 14,820건 처리시간 0.032초

Data Flow 시스템에서 구조체 분산 처리 방식 (A Structure Distributed Processing Method in Data Flow Systems)

  • 맹성열;현운몽;하영호;임인철
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
    • /
    • 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.

  • PDF

고체 추진기관 구조체 설계 프로그램 개발을 위한 설계 부품 자료 구조 (Data Structure for the Design Program of Solid Rocket Motors)

  • 이강수;김원훈;이방업
    • 한국CDE학회논문집
    • /
    • 제17권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.

A Data Quality Management Maturity Model

  • Ryu, Kyung-Seok;Park, Joo-Seok;Park, Jae-Hong
    • ETRI Journal
    • /
    • 제28권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.

  • PDF

An Architecture for Efficient RDF Data Management Using Structure Index with Relation-Based Data Partitioning Approach

  • Nguyen, Duc;Oh, Sang-yoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제5권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.

부식을 고려한 판형교의 LCC 분석 데이터구조 설계 (Data Structure Modeling for the LCC Analysis of the Plate Girder Bridge Considering Corrosion)

  • 김동현;김봉근;이상호
    • 한국방재학회:학술대회논문집
    • /
    • 한국방재학회 2007년도 정기총회 및 학술발표대회
    • /
    • 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.

  • PDF

An Information Structure Graph: A Structural Formalization of Information Semantics

  • Lee, Choon-Yeul
    • 정보기술과데이타베이스저널
    • /
    • 제7권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.

  • PDF

ISO 15926 국제 표준을 이용한 원자력 플랜트 기자재 분류체계 (Development of the ISO 15926-based Classification Structure for Nuclear Plant Equipment)

  • 윤진현;문두환;한순흥;조광종
    • 한국CDE학회논문집
    • /
    • 제12권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.

시간지원 데이터를 위한 분리 저장 구조와 데이터 이동 방법 (A Time-Segmented Storage Structure and Migration Strategies for Temporal Data)

  • 윤홍원;김경석
    • 한국정보처리학회논문지
    • /
    • 제6권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.

  • PDF

효율적인 NDB 설계 및 유통 정보 NETWORK 활성화 방안 (The Activation Plan of Chain Information Network And Efficent NDB Design)

  • 남태희
    • 한국컴퓨터정보학회지
    • /
    • 제1권2호
    • /
    • pp.73-94
    • /
    • 1995
  • 본 논문은 유통정보 네트워크 활성화 방안에 대하여 효율적인 NDB(Network Data Base)을 설계하였다. NDB(Network Data Base)의 구조는 논리 구조, 격납 구조, 물리 구조로 형성되어 데이터는 하나의 레코드로서 표현되고 데이터들 간의 관계는 링크로서 표현되었다. 또한 데이터베이스의 논리적 구조를 표현한 자료 구조도(Data Structure Diagram:DSD)가 계층 모델로 나타내었다. 각 노드는 레코드 타입을 나타내었고, 타입들을 연결하는 방향을 지닌 링크, 논리적인 격납 형태로 구성되어 데이터베이스를 설계하는데 물리 매체상 서로 연관성 있게 설계되어 자료의 검색과 억세스 효율에 큰 영향을 미쳤다. 또한 설계된 시스템에 네트워크를 형성하고, 네트워크 표준화를 위해 OSI 환경하에서 POS(Point Of Sale)시스템을 이용하여 효율적인 유통 정보 네트워크를 활성화시켰다.

  • PDF

반모서리 기반의 삼각망 자료 구조 개발 (Development of Halfedge-based Triangular Mesh Data Structure)

  • 정연찬;장민호
    • 한국CDE학회논문집
    • /
    • 제14권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.