• Title/Summary/Keyword: Active XML Index

Search Result 2, Processing Time 0.015 seconds

Techniques of XML Fragment Stream Organization for Efficient XML Query Processing in Mobile Clients (이동 클라이언트에서 효율적인 XML 질의 처리를 위한 XML 조각 스트림 구성 기법)

  • Ryu, Jeong-Hoon;Kang, Hyun-Chul
    • The Journal of Society for e-Business Studies
    • /
    • v.14 no.4
    • /
    • pp.75-94
    • /
    • 2009
  • Since XML emerged as a standard for data exchange on the web, it has been established as a core component in e-Commerce and efficient query processing over XML data in ubiquitous computing environment has been also receiving much attention. Recently, the techniques were proposed whereby an XML document is fragmented into XML fragments to be streamed and the mobile clients receive the stream while processing queries over it. In processing queries over an XML fragment stream, the average access time significantly depends on the order of fragments in the stream. As such, for query performance, an efficient organization of XML fragment stream is required as well as the indexing for energy-efficient query processing due to the reduction of tuning time. In this paper, a technique of XML fragment stream organization based on query frequencies, fragment size, fragment access frequencies, and an active XML-based indexing scheme are proposed. Through implementation and performance experiments, our techniques were shown to be efficient compared with the conventional XML fragment stream organizations.

  • PDF

Indexing of XML with B+-tree (B+-tree를 이용한 XML 색인기법)

  • Kwon, Guk-Bong;Hong, Dong-Kweon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.1
    • /
    • pp.94-100
    • /
    • 2006
  • Computing paradigm shift to internet-based one has accelerated the use of XML in diverse applications. This phenomena has made the explosive increases of XML data and it triggered many active researches in maintaining very huge amount of XML data in turn. In this paper we present a persistent graph-based XML indexing lot data-centric XML data. In our approach we use 3 graphs to represent XML indexes and XML data itself. They are schema graph, data graph index. And then we have mapped those graphs to B+-trees the persistency. With our approach we can achieve linear query execution time with the increase of XML sizes.