• Title/Summary/Keyword: XML Data Processing

Search Result 396, Processing Time 0.028 seconds

An XML-QL to SQL Translator for Processing XML Data (XML 데이타 처리를 위한 XML-QL to SQL 번역기)

  • Jang, Gyeong-Ja;Lee, Gi-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.1
    • /
    • pp.1-8
    • /
    • 2002
  • XML has been proposed as an international standard for organizing and exchanging a great diversity of the Web data. It is important to retrieve components of stored XML documents that are needed by a wide variety of applications. In this paper, we suggest a method to store XML documents and to retrieve an XML data. In other words, we suggest the method of retrieving XML data is using XML -QL. So we need to mapping XML-QL to SQL translator on top of an RDBMS. The contributions of this paper include, besides the detailed design and implementation of the translator, demonstration of feasibility of such a translator, and a comprehensive classification of XML queries and their mappings to SQL relational queries.

Query Processing using Information of Parent Nodes in Partitioned Inverted Index Tables (분할된 역 인덱스 테이블에서 부모노드의 정보를 이용한 질의 처리)

  • Kim, Myung-Soo;Hwang, Byung-Yeon
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.7
    • /
    • pp.905-913
    • /
    • 2008
  • Many heterogeneous XML documents are being widely used with the increasing employment of XML, and the importance of data structure research for more efficient document management has been growing steadily. We propose a query processing technique which uses parent node information in a partitioned inverted index tree. The searching efficiency of these heterogeneous documents is greatly influenced by the number of query processing and the amount of target data sets in many ways. Therefore, considering these two factors is very important for designing a data structure. First, our technique stores parent node's information in an inverted index table. Then using this information, we can reduce the number of query processing by half. Also, the amount of target data sets can be lessoned by using partitioned inverted index table. Some XML documents collected from the Internet will be used to demonstrate the new method, and its high efficiency will be compared with some of the existing searching methods.

  • PDF

An XML Structure Translation System using Schema Structure Data Mapping (스키마 구조 데이타 매핑을 이용한 XML 구조변환 시스템)

  • 송종철;김창수;정회경
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.5
    • /
    • pp.406-418
    • /
    • 2004
  • Last days, various kinds of applications and system were individually introduced into specific groups or enterprises by different objective without considering interoperability among those. However, the environment for data processing is changing rapidly in these days. And now the necessity is growing to integrate and couple applications and system in the process dimension for more flexible and quicker data processing on these application programs and system. When integrating these application programs or system, an integration based on XML is recommended as it is one of good methods which will the additional cost and satisfy the requirements of the integration. This is because the XML is not only device-independent data type which can be used any platform, but also it uses XSLT, the document conversion standard established by W3C, which allows easy data conversion from one to another type on occasion of demands. This paper studies a design and implementation of system to convert XML structure. This system shows the structure of source- side providing data and destination-side processing data with using XML schema that defines structural information of a XML document. And this system defines the structure relationship of desired form as mapping structural information and data. This system creates the XSLT document that defines conversion rule between two structures based information which is defined. The XSLT document which is created as described above will convert data to be appropriate to the structure of the destination- side. By implementing this system, it is able to apply a document into various kinds of structure without considering specific system or platform and it is able to construct XSLT document to which meaning of desired form can be given. This paper aims to offer a process conversion between documents and to improve interoperability and scalability, so that we can contribute to build XML document processing environment

Extracting OWL Ontology from XML instances via XML Schema

  • Pham, Thi Thu Thuy;Lee, Young-Koo;Lee, SungYoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.801-802
    • /
    • 2009
  • Currently, XML and its schema language have become the standard for data representation and information exchange format on the current web. Unfortunately, problems happen when integrating different data sources since XML mainly supports the document structure but lack consideration on sharing knowledge of data. Meanwhile, Semantic Web technologies, such as Web Ontology Language (OWL), can include the structure as well as the semantics of the data. Therefore, finding a way to integrate XML data as OWL ontology receives a high interest nowadays. In this paper we present a mapping notation to convert XML Schema to OWL domain knowledge and an effective method to transform XML instances into OWL individuals. While keeping the XML original structure, our work also adds more semantics for the XML document. Moreover, whole of the transformation processes are done automatically without any user interference. Further, our transforming approach provides the solution for duplicate element names in XML document which has not mentioned in the previous work. Our results in existing OWL syntaxes can be loaded immediately by OWL editors and Semantic Web applications.

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.

A Study on Efficient Distributed Data Processing POS System of PKI Based (PKI 기반의 효율적인 분산처리 Point of sales 시스템에 관한 연구)

  • Kang Min-Gyun;Kim Seok-Soo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.11a
    • /
    • pp.200-204
    • /
    • 2005
  • POS system that become that is supply net administration and computerization fetters of customer management that become point in distribution network constructed database and use XML-Encryption that is certificate techniques of PKI and standard of security for security that is XML's shortcoming and design distributed processing POS system using XML for data integration by introduction of Ubiquitous concept. This POS system has four advantages. First, high portability Second, efficiency of data transmission. Third, improvement of data process speed. Fourth, security of data.

  • PDF

Genealogy-based Indexing Technique for XML Documents (XML문서를 위한 족보 기반 인덱싱 기법)

  • 이월영;용환승
    • Journal of KIISE:Databases
    • /
    • v.31 no.1
    • /
    • pp.72-81
    • /
    • 2004
  • Theses days, a number of data over the Internet are represented using XML because of a virtue of XML. In proportion to the increase of XML data, query processing techniques are required that support quickly and efficiently the diverse queries to search the useful information on XML documents. But, up to now, the researches handling queries for XML data are methodologies focusing on how to process regular path expressions. Therefore, we have developed a new genealogy-based indexing technique to solve various queries such as not only regular path expression but also simple path expression, path expression referencing other elements, and so on. Also, we have applied this technique on object-relational model and evaluated the performance for many documents and various query types. The result shows improved performance in comparison with the other storage techniques.

XML Fragmentation for Resource-Efficient Query Processing over XML Fragment Stream (자원 효율적인 XML 조각 스트림 질의 처리를 위한 XML 분할)

  • Kim, Jin;Kang, Hyun-Chul
    • The KIPS Transactions:PartD
    • /
    • v.16D no.1
    • /
    • pp.27-42
    • /
    • 2009
  • In realizing ubiquitous computing, techniques of efficiently using the limited resource at client such as mobile devices are required. With a mobile device with limited amount of memory, the techniques of XML stream query processing should be employed to process queries over a large volume of XML data. Recently, several techniques were proposed which fragment XML documents into XML fragments and stream them for query processing at client. During query processing, there could be great difference in resource usage (query processing time and memory usage) depending on how the source XML documents are fragmented. As such, an efficient fragmentation technique is needed. In this paper, we propose an XML fragmentation technique whereby resource efficiency in query processing at client could be enhanced. For this, we first present a cost model of query processing over XML fragment stream. Then, we propose an algorithm for resource-efficient XML fragmentation. Through implementation and experiments, we showed that our fragmentation technique outperformed previous techniques both in processing time and memory usage. The contribution of this paper is to have made the techniques of query processing over XML fragment stream more feasible for practical use.

Nested Interval Encoding with Continued Fractions for XML Storage & Retrieval (Nested Interval 을 이용한 XML 문서의 저장 및 질의 기법)

  • Song, Yong-Ho;Na, Gap-Joo;Lee, Sang-Won
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.11a
    • /
    • pp.27-30
    • /
    • 2005
  • XML(Extensible Markup Language)이 데이터 표현(data representation)과 문서 교환(data exchange)의 표준으로 지정됨에 따라 데이터베이스(database, DB)에 XML 문서를 저장하고 질의하기 위한 연구가 활발히 진행되고 있다. 특히, 현재 주류를 이루고 있는 관계형 DB 에 저장하기 위한 XML 인덱싱(indexing) 기법에 대한 연구도 다양하게 진행되고 있다. 본 논문에서는 XML 문서를 관계형 DB 에 효율적으로 저장하고 질의하기 위한 방법으로서 기존의 트리(tree) 구조의 데이터를 관계형 DB 에 Nested Interval 인덱싱 기법을 적용하여 XML 문서를 저장하는 방법에 대해 연구한다. 기존의 저장 기법들의 경우 XML 문서를 효율적으로 질의하기 위한 인덱싱을 수행하기 때문에 입력 후 추가되는 노드(node), 혹은 노드 집합의 입력 시에는 전체 혹은 일부분의 XML 문서를 재-인덱싱 해야 하는 비효율이 있다. 그러나, Nested Interval 의 경우에는 재-인덱싱이 불필요하다. 본 논문에서는 기존의 트리 구조 데이터의 인덱싱 기법들에 대한 비교와 함께 Nested Interval 을 이용한 XML 문서의 인덱싱 기법에 대해 기술한다.

  • PDF

An XML Query System in a Wrapper System for Integrating Heterogeneous Biological Databases (이질의 생물 정보원 통합을 위한 랩퍼 시스템에서의 XML 질의 처리 시스템)

  • Park Eun-Koung;Kang Dong-Wan;Jung Chai-Young;Kim Hyun-Ju;Bae Jong-Min
    • The KIPS Transactions:PartD
    • /
    • v.12D no.4 s.100
    • /
    • pp.553-568
    • /
    • 2005
  • In order to integrate distributed biological information sources physically or virtually, it is necessary to overcome the heterogeneity of information sources and support a superior generality and adaptation in order to satisfy user's various demands. In this paper, we present a flexible and general XML query engine of a wrapper system in designing the middleware system to integrate data as well as application programs. Since this query engine applies user-defined XML view, it is possible to composite flexible integrated query. The query processing in a wrapper requires view composition, query translation into local sources, and generation of XML documents from local query results. We present a query processing model based on the view tree, where the n views and the XML queries are represented by the view tree. Moreover, to confirm the generality of our query processing model, we present a methodology of query processing for relational databases, web sources, and application programs whose return types of query results are relational tuples or XML documents.