• Title/Summary/Keyword: Structural Query

Search Result 86, Processing Time 0.019 seconds

A Study on the Ontology Query Module based on Natural Language (자연어 기반 온톨로지 질의 모듈 연구)

  • Kim, Won-Pil;Kong, Hyun-Jang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.1
    • /
    • pp.146-151
    • /
    • 2010
  • For an application of ontology, query processing is mandatory field for efficient information search in the ontology. Other query processing systems tend to analyze only facts and to simply provide structural information for users. In fact, the systems do not have big difference with database systems or text based information processing systems. Therefore, in this research, the method which can provide the inferred information based on axioms is suggested in order to maximize reusability of ontology.

Semantics in XML Data Processing (XML 데이터 처리에서 시맨틱)

  • Jin, Min
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.3
    • /
    • pp.1327-1335
    • /
    • 2011
  • XML is good at representing data with hierarchical and self-describing structure. There is no inherent semantics with XML. However, semantics of XML has come up with us as XML is used in wide and advanced applications. This paper surveyed semantics in XML data processing environment. XML semantics can be categorized into four groups according to its usage; structural semantics, relational semantics, extended semantics, and semantic web. Relational database is still a good alternative for storing and managing large volume of XML documents. We propose an extended relational semantics in order to exploit it in managing XML documents such as query processing.

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.

Real-time Virtual Integration of heterogeneous system and Union Query System

  • Min, Seong-Hyeon;Lee, Sang-Joon;Kwak, Ho-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.10
    • /
    • pp.107-114
    • /
    • 2016
  • In this paper, we propose the building method for the unified IoT service platform between the variety of legacy systems with the heterogeneous structures and the operating environments. To accommodate the structural diversity of legacy systems, we develop a virtual integrated structure and interface abstracting method. By this, the new platform can use the data sources of the legacy systems as if the data source is in the new platform. In a manner without modification of the legacy systems with performing minimum tasks, we proposes a model that can be integrated without affecting the availabilities of the legacy systems.

Effective Structural Joins using Level Information (레벨 정보를 이용한 효과적인 구조 조인 기법)

  • Kim, Jong-Ik
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.6
    • /
    • pp.582-587
    • /
    • 2008
  • Structural join is one of the most typical techniques for evaluating XML path queries. Recent researches for structural joins focus on techniques of skipping unnecessary elements using the horizontal distribution information of elements that is indexed on a structure like B+ tree. However, those techniques make the structural join complicated and cannot guarantee efficient join processing due to the overhead of an index structure. In this paper, we propose a new structural join technique that exploits the level information of XML elements. Our technique can skip unnecessary elements using level information, which is vertical distribution information of elements. Through the experimental results, we show that our technique can evaluate structural joins efficiently.

The Scheme for Path-based Query Processing on the Semantic Data (시맨틱 웹 데이터의 경로 기반 질의 처리 기법)

  • Kim, Youn-Hee;Kim, Jee-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.10
    • /
    • pp.31-41
    • /
    • 2009
  • In the Semantic Web, it is possible to provide intelligent information retrieval and automated web services by defining a concept of information resource and representing a semantic relation between resources with meta data and ontology. It is very important to manage semantic data such as ontology and meta data efficiently for implementing essential functions of the Semantic Web. Thus we propose an index structure to support more accurate search results and efficient query processing by considering semantic and structural features of the semantic data. Especially we use a graph data model to express semantic and structural features of the semantic data and process various type of queries by using graph model based path expressions. In this paper the proposed index aims to distinguish our approach from earlier studies and involve the concept of the Semantic Web in its entirety by querying on primarily extracted structural path information and secondary extracted one through semantic inferences with ontology. In the experiments, we show that our approach is more accurate and efficient than the previous approaches and can be applicable to various applications in the Semantic Web.

A Query Processing Technique for XML Fragment Stream using XML Labeling (XML 레이블링을 이용한 XML 조각 스트림에 대한 질의 처리 기법)

  • Lee, Sang-Wook;Kim, Jin;Kang, Hyun-Chul
    • Journal of KIISE:Databases
    • /
    • v.35 no.1
    • /
    • pp.67-83
    • /
    • 2008
  • In order to realize ubiquitous computing, it is essential to efficiently use the resources and the computing power of mobile devices. Among others, memory efficiency, energy efficiency, and processing efficiency are required in executing the softwares embedded in mobile devices. In this paper, query processing over XML data in a mobile device where resources are limited is addressed. In a device with limited amount of memory, the techniques of XML. stream query processing need to be employed to process queries over a large volume of XML data Recently, a technique Galled XFrag was proposed whereby XML data is fragmented with the hole-filler model and streamed in fragments for processing. With XFrag, query processing is possible in the mobile device with limited memory without reconstructing the XML data out of its fragment stream. With the hole-filler model, however, memory efficiency is not high because the additional information on holes and fillers needs to be stored. In this paper, we propose a new technique called XFLab whereby XML data is fragmented with the XML labeling scheme which is for representing the structural relationship in XML data, and streamed in fragments for processing. Through implementation and experiments, XML showed that our XFLab outperformed XFrag both in memory usage and processing time.

Searching Similar Example-Sentences Using the Needleman-Wunsch Algorithm (Needleman-Wunsch 알고리즘을 이용한 유사예문 검색)

  • Kim Dong-Joo;Kim Han-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.181-188
    • /
    • 2006
  • In this paper, we propose a search algorithm for similar example-sentences in the computer-aided translation. The search for similar examples, which is a main part in the computer-aided translation, is to retrieve the most similar examples in the aspect of structural and semantical analogy for a given query from examples. The proposed algorithm is based on the Needleman-Wunsch algorithm, which is used to measure similarity between protein or nucleotide sequences in bioinformatics. If the original Needleman-Wunsch algorithm is applied to the search for similar sentences, it is likely to fail to find them since similarity is sensitive to word's inflectional components. Therefore, we use the lemma in addition to (typographical) surface information. In addition, we use the part-of-speech to capture the structural analogy. In other word, this paper proposes the similarity metric combining the surface, lemma, and part-of-speech information of a word. Finally, we present a search algorithm with the proposed metric and present pairs contributed to similarity between a query and a found example. Our algorithm shows good performance in the area of electricity and communication.

  • PDF

Integration of Extended IFC-BIM and Ontology for Information Management of Bridge Inspection (확장 IFC-BIM 기반 정보모델과 온톨로지를 활용한 교량 점검데이터 관리방법)

  • Erdene, Khuvilai;Kwon, Tae Ho;Lee, Sang-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.33 no.6
    • /
    • pp.411-417
    • /
    • 2020
  • To utilize building information modeling (BIM) technology at the bridge maintenance stage, it is necessary to integrate large quantities of bridge inspection and model data for object-oriented information management. This research aims to establish the benefits of utilizing the extended industry foundation class (IFC)-BIM and ontology for bridge inspection information management. The IFC entities were extended to represent the bridge objects, and a method of generating the extended IFC-based information model was proposed. The bridge inspection ontology was also developed by extraction and classification of inspection concepts from the AASHTO standard. The classified concepts and their relationships were mapped to the ontology based on the semantic triples approach. Finally, the extended IFC-based BIM model was integrated with the ontology for bridge inspection data management. The effectiveness of the proposed framework for bridge inspection information management by integration of the extended IFC-BIM and ontology was tested and verified by extracting bridge inspection data via the SPARQL query.

Analysis of Indexing Schemes for Structure-Based Retrieval (구조 기반 검색을 위한 색인 구조에 대한 분석)

  • 김영자;김현주;배종민
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.5
    • /
    • pp.601-616
    • /
    • 2004
  • Information retrieval systems for structured documents provide multiple levels of retrieval capability by supporting structure-based queries. In order to process structure-based queries for structured documents, information for structural nesting relationship between elements and for element sequence must be maintained. This paper presents four index structures that can process various query types about structures such as structural relationships between elements or element occurrence order. The proposed algorithms are based on the concept of Global Document Instance Tree.

  • PDF