• Title/Summary/Keyword: Database Structure

Search Result 1,357, Processing Time 0.031 seconds

Analyzing Morpheme of the Natural Language to Express the Symptoms of Korean Medicine (한의학 증상용어의 형태소 분석을 위한 자연어 표기 분석)

  • Kim, Hye-Eun;Sung, Ho-Kyung;Eom, Dong-Myung;Lee, Choong-Yeol;Lee, Byung-Wook
    • Journal of Society of Preventive Korean Medicine
    • /
    • v.17 no.2
    • /
    • pp.179-187
    • /
    • 2013
  • Objectives : In many cases, patient's symptoms have been recorded on EMR in natural language instead of medical terminologies. It is possible to build a database by analyzing the symptoms of Korean Medicine(KM) that indicates patient's symptoms in natural language. Using the database, when doctors record patient's symptoms on EMR in natural language, conversely it'll be also possible to extract the symptoms of KM from those natural language. The database will enhance the value of EMR as a medical data. Methods : In this study, we aimed to make data structure of the terminologies that represent the symptoms of KM. The data structure is combinations of smallest unit in natural language. We made the database by analyzing morpheme of the natural language to express the symptoms of KM. Results & Conclusions : By classifying the natural language in 15 features, we made the structure of concept and the data available for morphological analysis.

Construction of Full-text Database by SGML (문서기술언어 SGML에 의한 전문 데이터베이스의 구축)

  • Kim, Chang-Bong
    • Journal of Information Management
    • /
    • v.27 no.4
    • /
    • pp.35-56
    • /
    • 1996
  • SGML(Standard Generalized Markup Language) and its application to full-text database including a table, a figure and a picture are explained. A structure of SGML based full-text database Is defined by DTD(document type definition) written in SGML, and full-text itself is described with generalized markup depending on DTD. This article explains how to represent a document structure : a hierarchical structure like a chapter, a section, or a paragraph, or non-hierarchical(referencial) structure like a note, a table, a figure or a picture. Merits of SGML, electronic publishing, a retrieval system or hypertext and SGML tools are also described.

  • PDF

The Study on Information Visualization Methods Using 3D interactive Animation (3차원 인터랙티브 애니메이션을 활용한 정보시각화 방법에 관한 연구)

  • 김성곤
    • Archives of design research
    • /
    • v.17 no.1
    • /
    • pp.299-308
    • /
    • 2004
  • The methods of presenting information are more variable with advanced computer media technology. However, when we visualize information of database, it is more difficult to understand data meaning by complex date, which is not required by user. To compose new information, user needs to combine own his memory and new information presenting result. To be quickly explored new information and be exactly understood relationship of data structure, the data presenting of visualized information is more structured and presented with meaning form. It is possible to make information visualization system, which users can explore database by oneself, with supporting interaction to be able to control and combine relationship of three-dimensional scene graphic structure, presenting factors of animation and data structure of database. There are several diagrams, such as VR diagram, Form structure diagram and simulated diagram as the case study.

  • PDF

Comparison and Analyzing System for Protein Tertiary Structure Database expands LOCK (LOCK을 확장한 3차원 단백질 구조비교 및 분석시스템의 설계 및 구현)

  • Jung Kwang Su;Han Yu;Park Sung Hee;Ryu Keun Ho
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.247-258
    • /
    • 2005
  • Protein structure is highly related to its function and comparing protein structure is very important to identify structural motif, family and their function. In this paper, we construct an integrated database system which has all the protein structure data and their literature. The structure queries from the web interface are compared with the target structures in database, and the results are shown to the user for future analysis. To constructs this system, we analyze the Flat-File of Protein Data Bank. Then we select the necessary structure data and store as a new formatted data. The literature data related to these structures are stored in a relational database to query the my kinds of data easily In our structure comparison system, the structure of matched pattern and RMSD valure are calculated, then they are showed to the user with their relational documentation data. This system provides the more quick comparison and nice analyzing environment.

RDB Schema Model of XML Document for Storage Capacity and Searching Efficiency (저장 공간과 검색 효율을 위한 XML 문서의 RDB 스키마 모델)

  • Kim Jeong-Hee;Kwak Ho-Young;Kwon Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.4
    • /
    • pp.19-28
    • /
    • 2006
  • XML instances for purpose of information exchange are normally stored in the legacy relational database. Therefore, integrations with relational database are required for effective XML applications. To support these requirements, virtual decomposition storage or decomposition storage methods which save separates structures of instances to relational database have researched. However, these storage methods contain different information of schema structure and layers which has caused difficulties to process query during search operation as well as increased overheads due to duplicate savings for separate storages. Therefore, in this research, additional field of 'Eltype' has introduced to previous database schema structure to instance and schema structure, provide consistent level information and propose storage structure to map each field to schema field of relational database. As results, XML instance and structures can be stored together to minimize overheads and required storage-space. Also, synchronized storage layer structure provides easier processing of search query.

  • PDF

A Load Balancing Method Using Ring Network Structure in the Grid Database (그리드 데이터베이스에서 링 기반 연결 구조를 이용한 부하 분산 기법)

  • Jang Yong-Il;Shin Soong-Sun;Park Soon-Young;Bae Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.9
    • /
    • pp.1107-1117
    • /
    • 2006
  • In this paper, a load balancing method using ring network structure in the Grid database is proposed. In the Grid database, generally, data is replicated for performance and availability. And, user's request is transferred to node and processed in that node which has target data. But, in such environment, a decline of performance can be occurred because unbalanced workload. A traditional research is proposed to solve unbalanced load problem. However, the Grid database has a number of systems and user's request always changes dynamically. Therefore, a traditional research can not be applied. The proposed method connects each node which has a same replicated data through ing network structure. If workload is overflowed in some node, user's request is transferred to a linked node which has a target data. And, this node stops another request processing until workload is decreased. Then, it changes the link structure through sending a message to a previous node, to stop request forwarding from a previous node. This paper shows a proposed method increases performance than existing research through performance evaluation and is more suitable for a complex and dynamic environment.

  • PDF

An Evaluation of Access Performance of STEP-based CAD Database (STEP 기반 CAD 데이터베이스의 액세스 성능 평가 실험)

  • Kim, Junh-Wan;Han, Soon-Hung
    • IE interfaces
    • /
    • v.17 no.2
    • /
    • pp.226-232
    • /
    • 2004
  • In shipbuilding area, data sharing is one of the crucial issues. Recently, for collaborative design, ship structural CAD systems adopt the database as its primary storage. Database is useful to deal with the large amount of design information among the heterogeneous design department and design stage. To make the database-based CAD system object-oriented database(OODB) and object-relational database(ORDB) can be used. It is important to select proper database because the CAD system performance mainly depends on access performance of database. In this research, using prototype CAD system from other research, access performance of OODB and ORDB form CAD system was evaluated. STEP application protocol was used as the database schema and experiment was made in query by property and query by region. The results give some idea of how to choose the database for CAD systems.

The Development of Web Database for the Construction Information of Spatial Structure (대공간구조물 건설정보의 웹 데이터베이스 개발)

  • Jang, Myung-Ho;Park, Sang-Yoon;Sur, Sam-Yeol
    • Proceeding of KASS Symposium
    • /
    • 2008.05a
    • /
    • pp.27-30
    • /
    • 2008
  • Even though the frequency of constructing spatial structure is increasing currently, the problem is that no efficient medium to provide information of goof quality on spatial structure is existed. The information is available only for some limited number of major construction companies with experiences, not for the academic world, officials. It costs us much time and money gaining the information for spatial structure without integrated media. Thus the purpose of this study is to develop an integrated web database model for spatial structure.

  • PDF

An Integration Algorithm of X-tree and kd-tree for Efficient Retrieval of Spatial Database (공간 데이터베이스의 효율적인 검색을 위한 X-트리와 kd-트리의 병합 알고리즘)

  • Yoo, Jang-Woo;Shin, Young-Jin;Jung, Soon-Key
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.12
    • /
    • pp.3469-3476
    • /
    • 1999
  • In spatial database based on spatial data structures, instead of one-dimensional indexing structure, new indexing structure which corresponds to multi-dimensional features of spatial objects is required. In order to meet those requirements, in this paper we proposed new indexing structure for efficient retrieval of spatial database by carrying through the feature analysis of conventional multi-dimensional indexing structures. To improve the sequential search method of supernodes in the conventional X-tree and to reduce the retrieval time in case of generating the huge supernode, we proposed a indexing structure integrating the kd-tree based on point index structure into the X-tree. We implemented the proposed indexing structure and analyzed its retrieval time according to the dimension and distribution of experimental data.

  • PDF

The T-tree index recovery for distributed main-memory database systems in ATM switching systems (ATM 교환기용 분산 주기억장치 상주 데이터베이스 시스템에서의 T-tree 색인 구조의 회복 기법)

  • 이승선;조완섭;윤용익
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.1867-1879
    • /
    • 1997
  • DREAM-S is a distributed main-memory database system for the real-time processing of shared operational datra in ATM switching systems. DREAM-S has a client-server architecture in which only the server has the diskstorage, and provides the T-Tree index structure for efficient accesses to the data. We propose a recovery technique for the T-Tree index structre in DREAM-S. Although main-memory database system offer efficient access performance, the database int he main-memory may be broken when system failure such as database transaction failure or power failure occurs. Therfore, a recovery technique that recovers the database (including index structures) is essential for fault tolerant ATM switching systems. Proposed recovery technique relieves the bottleneck of the server processors disk operations by maintaining the T-Tree index structure only in the main-memory. In addition, fast recovery is guaranteed even in large number of client systems since the T-Tree index structure(s) in each system can be recovered cncurrently.

  • PDF