• Title/Summary/Keyword: XML 트리

Search Result 206, Processing Time 0.022 seconds

A method of Multi-Layer Visualizations for XTM (XTM을 위한 다층적 시각화 방법)

  • 박영조;박호병;조용윤;유재우
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10b
    • /
    • pp.529-531
    • /
    • 2004
  • 웹 상에는 많은 자원들과 정보들이 존재한다. XML은 이러한 자원들과 정보들을 구조화하기 위해서 개발되었다. XTM(XML Topic Maps)은 XML의 형태로 자원들과 정보들에 의미를 부여할 수 있는 언어이다. XTM은 Topic과 Association을 이용해서 자원들과 정보들이 가진 의미를 표현한다 XTM상에서 나타나는 Topic과 Association은 매우 거대하고 다양하기 때문에 모든 Topic과 Association을 한꺼번에 표현하기 어렵다 또한, 사용자가 수백만개의 Topic과 Association에서 원하는 Topic과 Association을 찾기 어렵다. 따라서 이러한 문제점을 해결하기 위해서 다양한 시각화 방법이 연구되었다. 현재 Topic Maps을 표현할 때 트리, 그래프, 맵 등 하나의 구조를 이용해서 표현한다. 하지만 추상화정도에 따라 시각화 방법은 장ㆍ단점을 지닌다. 본 논문에서는 웹 상의 자원, 정보들과 의미 사이에 여러 계층이 존재하는 다층적 시각화를 제안한다. 각 계층은 독립적인 표현구조로 나타내어 추상화정도에 따라 최적화된 구조를 사용한다. 사용자는 자신이 원하는 Topic과 Association을 점진적 접근을 통해서 원하는 Topic과 Association을 검색할 수 있다. 또한 Topic이 Association의 member처럼 사용되는 경우, 시각적으로 Topic이 표현되면 Topic은 연결된 Association과 직접적인 연결을 갖는다.

  • PDF

GML 응용스키마를 이용한 공간데이터베이스 스키마 모델링

  • 정호영;이민우;전우제;박수홍
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2003.11a
    • /
    • pp.30-39
    • /
    • 2003
  • GML 데이터는 공간 및 비공간 정보를 동시에 갖는 GIS 데이터의 특징과 구조적(structured)인 XML 데이터의 성격을 함께 가지고 있어 일반적인 DBMS에 저장되기 힘들다. XML 저장이 가능한 데이터베이스는 공간데이터 처리 능력이 부족하고, 공간데이터베이스는 XML 데이터를 저장하기 어렵다. 본 연구는 GML 데이터가 공간데이터베이스에 저장될 수 있도록 GML 응용스키마로부터 공간데이터베이스 스키마를 모델링하는 방법을 제안한다. 이를 위하여 객체관계형 데이터베이스의 특징인 복합 애트리뷰트(composite attribute)와 추상데이터타입(ADT)을 이용한 GML 스키마의 맵핑 규칙을 정하였다. 맵핑 규칙은 OGC SQL 스키마에 적합하도록 GML 데이터의 공간 정보와 비공간 정보를 분리하여 저장시킨다. 따라서 저장된 데이터는 공간데이터베이스가 제공하는 공간 연산자/함수 및 인덱스를 통하여 다양한 공간/비공간 질의가 빠르게 수행될 수 있다.

  • PDF

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.

Multi-Path Index Scheme for the Efficient Retrieval of XML Data (XML 데이타의 효과적인 검색을 이한 다중 경로 인덱스)

  • Song, Ha-Joo;Kim, Hyoung-Joo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.1
    • /
    • pp.12-23
    • /
    • 2001
  • Extended path expressions are used to denote multiple paths concisely by using '$\ast$' character. They are convenient for expressing OQL queries to retrieve XML data stored in OODBs. In this paper, we propose a multi-path index scheme as a new index scheme to efficiently process queries with extended path expressions. Our proposed index scheme allocates a unique path identifier for every possible single path in an extended path expression and provides functionalities of both a single path indexing and multiple path indexing through the composition of index key and path identifier while using only a index structure. The proposed index scheme provides better performance than single-path index schemes, and is practical since it can be implemented by little modification of leaf records of a B+-tree index.

  • PDF

Design of Visual Tool for Efficient Descripting of Binary ECG File Formats (바이너리 심전도 파일 포맷의 효율적인 디스크립션을 위한 시각적 도구 설계)

  • Koo, Heung-Seo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.1
    • /
    • pp.26-31
    • /
    • 2007
  • In this study, A BED(Binary ECG description) based binary ECG conversion system is that supports the conversion of a binary ECG format into XML-based HL7 aECG for interoperability of ECG. HL7 aECG is a XML based standard lot interoperability of ECG waveform. However, it is difficult for beginners to write the BED document of binary BED conversion system in XML. We implement a BED Studio on the Java Servlet engine that allows beginners to write BED documents more easily. Our system consists of three parts: Visual Editor, Text Editor, and Format Checking Viewer. Format Checking Viewer support users to detect the format errors in the XML files, so-called BED documents, that describe the data format of the targer binary ECG file in the BED-based binary ECG conversion system, so may reduce the format errors in BED documents.

Construction of a Adaptive Domain Profile Parser in the SCA (SCA에서 적응형 도메인 프로파일 파서의 구축 방법)

  • Bae, Myung-Nam;Lee, Byung-Bog;Park, Ae-Soon;Lee, In-Hwan;Kim, Nae-Soo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.1
    • /
    • pp.103-111
    • /
    • 2009
  • In SCA, the core framework must include the domain parser to parse the domain profile and thus reconstructs the platform on the time including the starting of the platform, the initialization of the new radio, and etc. The domain profile is described in XML and it includes the characteristics about the software component or the hardware device in a platform. Elementarily, the core framework has to have within the domain profile parser in order to parse the domain profile. In this paper, in order to apply to the limited environment like the mobile terminal, we propose the method for reducing the size of the domain profile parser and for strengthening the independency of the XML parser vendor to have with the domain profile parser. Therefore, domain profile parser can be solve the problem like the overhead about the DOM tree creation due to the repetitive parsing of the domain profile, the compatibility degradation by the specific XML parser vender, the dependency about the domain profile technique, and etc.

An Approach for Integrated Modeling of Protein Data using a Fact Constellation Schema and a Tree based XML Model (Fact constellation 스키마와 트리 기반 XML 모델을 적용한 실험실 레벨의 단백질 데이터 통합 기법)

  • Park, Sung-Hee;Li, Rong-Hua;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.3
    • /
    • pp.519-532
    • /
    • 2004
  • With the explosion of bioinformatics data such proteins and genes, biologists need a integrated system to analyze and organize large datasets that interact with heterogeneous types of biological data. In this paper, we propose a integration system based on a mediated data warehouse architecture using a XML model in order to combine protein related data at biology laboratories. A fact constellation model in this system is used at a common model for integration and an integrated schema it translated to a XML schema. In addition, to track source changes and provenance of data in an integrated database employ incremental update and management of sequence version. This paper shows modeling of integration for protein structures, sequences and classification of structures using the proposed system.

Context-based Incremental Preference Analysis Method in Ubiquitous Commerce (유비쿼터스 상거래 환경의 컨텍스트 기반 점진적 선호 분석 기법)

  • Ku Mi Sug;Hwang Jeong Hee;Choi Nam Kyu;Jung Doo Young;Ryu Keun Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.7 s.96
    • /
    • pp.1417-1426
    • /
    • 2004
  • As Ubiquitous commerce is coming personalization service is getting interested. And also the recommendation method which offers useful information to customer becomes more important. However, most of them depend on specific method and are restricted to the E-commerce. For applying these recommendation methods into U-commerce, first it is necessary that the extended context modeling and systematic connection of the methods to complement strength and weakness of recommendation methods in each commercial transaction. Therefore, we propose a mod-eling technique of context information related to personal activation in commercial transaction and show incremental preference analysis method, using preference tree which is closely connected to recommendation method in each step. And also, we use an XML indexing technique to effi-ciently extract the recommendation information from a preference tree.

AST Creating and Crosscutting Concern Weaving Mechanism for Class Optimization in .NET Framework (닷넷 프레임워크에서 클래스 최적화를 위한 추상구조트리 생성 및 크로스커팅 위빙 메커니즘)

  • Lee, Seung-Hyung;Park, Je-Yeon;Song, Young-Jae
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.2
    • /
    • pp.89-98
    • /
    • 2010
  • The enterprise system is becoming more complex and larger. With the changes of the times, the system is developing to object-oriented programming method(OOP). However, the same code inserts to the core class repetitiously in the OOP, that causes a decrease in productivity and a trouble of application of another requirement. To solve this weak point, we propose a weaving mechanism what applies to metadata and crosscutting concern. For a class optimization and an integration between different languages, we take the following way. This paper uses three ways, those are, metadata generation using reflection, transformation to Abstract Syntax Tree, and mapping through crosscutting information specified XML. Through the proposed theory, class optimization can be accomplished by solving a functional decentralization and a confusion of codes.

An Efficient Storage Schema Construction and Retrieval Technique for Querying OWL Data (OWL 데이타 검색을 위한 효율적인 저장 스키마 구축 및 질의 처리 기법)

  • Woo, Eun-Mii;Park, Myung-Jae;Chung, Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.34 no.3
    • /
    • pp.206-216
    • /
    • 2007
  • With respect to the Semantic Web proposed to overcome the limitation of the Web, OWL has been recommended as the ontology language used to give a well-defined meaning to diverse data. OWL is the representative ontology language suggested by W3C. An efficient retrieval of OWL data requires a well-constructed storage schema. In this paper, we propose a storage schema construction technique which supports more efficient query processing. A retrieval technique corresponding to the proposed storage schema is also introduced. OWL data includes inheritance information of classes and properties. When OWL data is extracted, hierarchy information should be considered. For this reason, an additional XML document is created to preserve hierarchy information and stored in an XML database system. An existing numbering scheme is utilized to extract ancestor/descendent relationships, and order information of nodes is added as attribute values of elements in an XML document. Thus, it is possible to retrieve subclasses and subproperties fast and easily. The improved query performance from experiments shows the effectiveness of the proposed storage schema construction and retrieval method.