• Title/Summary/Keyword: Relational performance

Search Result 358, Processing Time 0.027 seconds

A Path Storing and Number Matching Method for Management of XML Documents using RDBMS (RDBMS를 이용하여 XML 문서 관리를 위한 경로 저장과 숫자 매칭 기법)

  • Vong, Ha-Ik;Hwang, Byung-Yeon
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.7
    • /
    • pp.807-816
    • /
    • 2007
  • Since W3C proposed XML in 1996, XML documents have been widely spreaded in many internet documents. Because of this, needs for research related with XML is increasing. Especially, it is being well performed to study XML management system for storage, retrieval, and management with XML Documents. Among these studies, XRel is a representative study for XML management and has been become a comparative study. In this study, we suggest XML documents management system based on Relational DataBase Management System. This system is stored not all possible path expressions such as XRel, but filtered path expression which has text value or attribute value. And by giving each node Node Expression Identifier, we try to match given Node Expression Identifier. Finally, to prove efficiency of the suggested technique, this paper shows the result of experiment that compares XPath query processing performance between suggested study and existing technique, XRel.

  • PDF

NVST DATA ARCHIVING SYSTEM BASED ON FASTBIT NOSQL DATABASE

  • Liu, Ying-Bo;Wang, Feng;Ji, Kai-Fan;Deng, Hui;Dai, Wei;Liang, Bo
    • Journal of The Korean Astronomical Society
    • /
    • v.47 no.3
    • /
    • pp.115-122
    • /
    • 2014
  • The New Vacuum Solar Telescope (NVST) is a 1-meter vacuum solar telescope that aims to observe the fine structures of active regions on the Sun. The main tasks of the NVST are high resolution imaging and spectral observations, including the measurements of the solar magnetic field. The NVST has been collecting more than 20 million FITS files since it began routine observations in 2012 and produces maximum observational records of 120 thousand files in a day. Given the large amount of files, the effective archiving and retrieval of files becomes a critical and urgent problem. In this study, we implement a new data archiving system for the NVST based on the Fastbit Not Only Structured Query Language (NoSQL) database. Comparing to the relational database (i.e., MySQL; My Structured Query Language), the Fastbit database manifests distinctive advantages on indexing and querying performance. In a large scale database of 40 million records, the multi-field combined query response time of Fastbit database is about 15 times faster and fully meets the requirements of the NVST. Our slestudy brings a new idea for massive astronomical data archiving and would contribute to the design of data management systems for other astronomical telescopes.

Snippet Extraction Method using Fuzzy Implication Operator and Relevance Feedback (연관 피드백과 퍼지 함의 연산자를 이용한 스니핏 추출 방법)

  • Park, Sun;Shim, Chun-Sik;Lee, Seong-Ro
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.3
    • /
    • pp.424-431
    • /
    • 2012
  • In information retrieval, search engine provide the rank of web page and the summary of the web page information to user. Snippet is a summaries information of representing web pages. Visiting the web page by the user is affected by the snippet. User sometime visits the wrong page with respect to user intention when uses snippet. The snippet extraction method is difficult to accurate comprehending user intention. In order to solve above problem, this paper proposes a new snippet extraction method using fuzzy implication operator and relevance feedback. The proposed method uses relevance feedback to expand the use's query. The method uses the fuzzy implication operator between the expanded query and the web pages to extract snippet to be well reflected semantic user's intention. The experimental results demonstrate that the proposed method can achieve better snippet extraction performance than the other methods.

Design and Implementation of a Query Processor for Document Management Systems (문서관리시스템을 위한 질의처리기 설계 및 구현)

  • U, Jong-Won;Yun, Seung-Hyeon;Yu, Jae-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.6
    • /
    • pp.1419-1432
    • /
    • 1999
  • The Document Management System(DMS) is a system which retrieves and manages library information efficiently. Since DMS manages the information using only one table, it does not need to provide join and view operations that spend high cost in traditional DBMS. In addition, DMs requires new operations because of their property. the operation has not been supported in existing DBMSs. In this paper we define a data language which represents the structure definition and process of data on the DMS. Especially we define Ranking and Proximity operation which is needed in Document Retrieval,. We also design and implement a query processor to process the query constructed with the data language. When the exiting query processors of relational DBMS are used as a query processor of DMS, they degrade the whole system performance. The proposed query processor not only overcomes such a problem but also supports new operation which is needed in DMS.

  • PDF

The Development of the Korean Medicine Symptom Diagnosis System Using Morphological Analysis to Refine Difficult Medical Terminology (전문용어 정제를 위한 형태소 분석을 이용한 한의학 증상 진단 시스템 개발)

  • Lee, Sang-Baek;Son, Yun-Hee;Jang, Hyun-Chul;Lee, Kyu-Chul
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.2
    • /
    • pp.77-82
    • /
    • 2016
  • This paper presents the development of the Korean medicine symptom diagnosis system. In the Korean medicine symptom diagnosis system, the patient explains their symptoms and an oriental doctor makes a diagnosis based on the symptoms. Natural language processing is required to make a diagnosis automatically through the patients' reports of symptoms. We use morphological analysis to get understandable information from the natural language itself. We developed a diagnosis system that consists of NoSQL document-oriented databases-MongoDB. NoSQL has better performance at unstructured and semi-structured data, rather than using Relational Databases. We collect patient symptom reports in MongoDB to refine difficult medical terminology and provide understandable terminology to patients.

Study on Sealing Characteristics of Solenoid Valve for Fuel Cells (연료전지용 솔레노이드 밸브의 실링 특성에 관한 연구)

  • Yun, So-Nam;Jeong, Hwang-Hun;Kim, Young-Bok;Kim, Dong-Gun;Heo, Duk-Yeal
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.10
    • /
    • pp.1193-1198
    • /
    • 2011
  • The solenoid valve used in fuel cell system need to have good sealing performance because the work fluid can explode in the system. Moreover, the temperature of the work fluid is extremely high in order to maintain the properties of the rubber ring that seals the solenoid valve. This study deals with the rubber ring which is made from a fluoro-elastomer. The life cycle of the rubber ring was estimated by the relational expression of Arrhenius, and the solenoid valve was tested to confirm the sealing characteristics.

An Autonomous Navigation System for Unmanned Underwater Vehicle (무인수중로봇을 위한 지능형 자율운항시스템)

  • Lee, Young-Il;Jung, Hee;Kim, Yong-Gi
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.3
    • /
    • pp.235-245
    • /
    • 2007
  • UUV(Unmanned Underwater Vehicle) should possess an intelligent control software performing intellectual faculties such as cognition, decision and action which are parts of domain expert's ability, because unmanned underwater robot navigates in the hazardous environment where human being can not access directly. In this paper, we suggest a RVC intelligent system architecture which is generally available for unmanned vehicle and develope an autonomous navigation system for UUV, which consists of collision avoidance system, path planning system, and collision-risk computation system. We present an obstacle avoidance algorithm using fuzzy relational products for the collision avoidance system, which guarantees the safety and optimality in view of traversing path. Also, we present a new path-planning algorithm using poly-line for the path planning system. In order to verify the performance of suggested autonomous navigation system, we develop a simulation system, which consists of environment manager, object, and 3-D viewer.

The Future of BlockChain Technology Leading Innovation in the Industrial Ecosystem (산업 생태계의 혁신을 선도할 블록체인 기술의 미래전망)

  • Kim, Jung-Sook
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.6
    • /
    • pp.324-332
    • /
    • 2018
  • Blockchain technology has the potential to revolutionize trust models and business processes in a variety of industries. However, it is considered to be the initial stage of the system that pursues autonomy rather than efficiency, and it is necessary to monitor and inspect the distributed ledger technology from the price and introduction time as compared with the existing relational DB transaction technology. However, domestic and foreign private sectors have already been activated by applying block-chain technology in the national domain, and the block chain is devoid of doubt that it is an exaggerated technology, characterized by the invariance of the record, transparency, and autonomous execution of business rules. It has begun to be utilized in history, identity, certification and auditing in the financial industry as well as various industries. In this paper, we analyze the problems such as security weakness, insufficient regulatory environment, technical consensus and lack of common standard. In addition, the business sense and possibility of the block chain technology is expected to be the innovation of the industrial ecosystem by entering into the reality system from the concept through monitoring the actual introduction performance in the field of copyright, logistics, health care and environment.

Classification of Proximity Relational Using Multiple Fuzzy Alpha Cut(MFAC) (MFAC를 사용한 근접관계의 분류)

  • Ryu, Kyung-Hyun;Chung, Hwan-Mook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.1
    • /
    • pp.139-144
    • /
    • 2008
  • Generally, real system that is the object of decision-making is very variable and sometimes it lies situations with uncertainty. To solve these problem, it has used statistical methods as significance level, certainty factor, sensitivity analysis and so on. In this paper, we propose a method for fuzzy decision-making based on MFAC(Multiple Fuzzy Alpha Cut) to improve the definiteness of classification results with similarity evaluation. In the proposed method, MFAC is used for extracting multiple a ${\alpha}$-level with proximity degree at proximity relation between relative Hamming distance and max-min method and for minimizing the number of data which are associated with the partition intervals extracted by MFAC. To determine final alternative of decision-making, we compute the weighted value between extracted data by MFAC From the experimental results, we can see the fact that the proposed method is simpler and more definite than classification performance of the conventional methods and determines an alternative efficiently for decision-maker by testing significance of sample data through statistical method.

RDBMS Based Efficient Method for Shortest Path Searching Over Large Graphs Using K-degree Index Table (대용량 그래프에서 k-차수 인덱스 테이블을 이용한 RDBMS 기반의 효율적인 최단 경로 탐색 기법)

  • Hong, Jihye;Han, Yongkoo;Lee, Young-Koo
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.5
    • /
    • pp.179-186
    • /
    • 2014
  • Current networks such as social network, web page link, traffic network are big data which have the large numbers of nodes and edges. Many applications such as social network services and navigation systems use these networks. Since big networks are not fit into the memory, existing in-memory based analysis techniques cannot provide high performance. Frontier-Expansion-Merge (FEM) framework for graph search operations using three corresponding operators in the relational database (RDB) context. FEM exploits an index table that stores pre-computed partial paths for efficient shortest path discovery. However, the index table of FEM has low hit ratio because the indices are determined by distances of indices rather than the possibility of containing a shortest path. In this paper, we propose an method that construct index table using high degree nodes having high hit ratio for efficient shortest path discovery. We experimentally verify that our index technique can support shortest path discovery efficiently in real-world datasets.