• Title/Summary/Keyword: 객체관계형 DBMS

Search Result 44, Processing Time 0.02 seconds

Retrieval Performance of XML Documents Using Object-Relational Databases (객체-관계형 데이터베이스에 의한 XML문헌의 검색성능 평가)

  • Kim, Hee-Sop
    • Journal of the Korean Society for information Management
    • /
    • v.21 no.2
    • /
    • pp.189-210
    • /
    • 2004
  • The purpose of this study is to evaluate the performance of XML retrieval based on ORDBMSs(Object-Relational Database Management Systems) approach. This paper describes indexing and retrieval methods for XML documents and the methodologies of experiments at INEX(Initiative for the Evaluation of XML retrieval). Like any other traditional information retrieval experiment, the test collection was consists of documents, topics/queries, task, relevance assessments and evaluation. EXIMA$^{TM}$ Supply, a kind of native XML DB based on ORDBMS technologies, is used for this experiment. Although this approach has many benefits, for example, no delay in storing and searching XML documents. but it showed relatively disappointed retrieval performance at INEX 2002. This result may caused since the given topics had to be decomposed and modified to be processed by the XPath processor, and during this modification the original meaning of topics can be changed inevitably and some important information nay pass over.r.

Design and Implementation of an OpenGIS Server based on GEUS (GEUS 기반 OpenGIS 서버의 설계 및 구현)

  • Zhang, Yan-Sheng;Yun, Jae-Kwan;Han, Ki-Joon
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 1999.06a
    • /
    • pp.21-32
    • /
    • 1999
  • 지리정보의 응용 분야가 나날이 광범위해지고 각 분야에서 수집하고 사용하는 지형공간 데이타와 이를 처리하기 위한 소프트웨어의 양도 급속도로 팽창해 가고 있다. 분산된 이러한 GIS자원들을 활용하고 상호운용할 수 있게 하기 위한 해결책이 바로 OpenGIS이다. GEUS는 GIS기술과 데이타베이스 기술을 하나로 통합한 혁신적인 GIS 솔루션으로써 UniSQL을 기초로 한 DBMS 엔진 레벨에서 공간 데이타 타입과 연산자를 기본적으로 제공하고 있는 세계 최초의 객체관계형 공간 DBMS이다. 광범위하게 존재하고 있는 GIS 사용자들이 표준적인 인터페이스를 통해 GEUS에 저장된 지형공간 정보와 제공하는 공간 연산들을 사용할 수 있게 하기 위하여 OGC의 'OpenGIS Simple Feature Specification for CORBA'에 정의된 표준 인터페이스의 구현이 필요하다. 이를 위해 본 논문에서는 GEUS에 기반한 OpenGIS 서버를 설계하고 구현하였다.

  • PDF

Designing Components for mapping from XML DTD to ORDB Schema (XML DTD의 객체-관계형 데이터베이스 스키마로의 변환을 위한 Component 설계)

  • 이정수;주경수
    • Journal of Information Technology Applications and Management
    • /
    • v.9 no.1
    • /
    • pp.71-84
    • /
    • 2002
  • As the application area of XML extends to the database from simple contents, the technology for the storage and management of XML also grows with the XML. One of the main issues is how to efficiently manage the XML by using the previous DBMS. Many studies have been performed for the efficient management based on the XML application and database interface. However, the XML data is based on the object and has the hierarchical structure. Accorkingly, a modeling plan needs to store the XML data on the variety type of database. In this paper, for easier connection between XML application and database system, we have designed components for the transformation from XML DTD to ORDB schema. The method of the design for the transformation from XML DTD to ORDB schema is chosen the method of CBD.

  • PDF

Object-Oriented Database Schemata and Queiy Processing for XML Data (XML 데이타를 위한 객체지향 데이터베이스 스키마 및 질의 처리)

  • Jeong, Tae-Seon;Park, Sang-Won;Han, Sang-Yeong;Kim, Hyeong-Ju
    • Journal of KIISE:Databases
    • /
    • v.29 no.2
    • /
    • pp.89-98
    • /
    • 2002
  • As XML has become an emerging standard for information exchange on the World Wide Web it has gained attention in database communities to extract information from XML seen as a database model. Recently, many researchers have addressed the problem of storing XML data and processing XML queries using traditional database engines. Here, most of them have used relational database systems. In this paper, we show that OODBSs can be another solution. Our technique generates an OODB schema from DTDs and processes XML queries, Especially, we show that the semi-structural part of XML data can be represented by the 'inheritance' and that this can be used to improve query processing.