Efficiently Querying Large XML Data Repositories: A Survey

  • Authors:

  • Gang Gou;Rada Chirkova

  • Affiliations:

  • -;-

  • Venue:
  • IEEE Transactions on Knowledge and Data Engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Extensible Markup Language (XML) is emerging as a de facto standard for information exchange among various applications on the World-Wide Web. There has been a growing need for developing high-performance techniques to query large XML data repositories efficiently. One important problem in XML query processing is twig pattern matching , that is, finding in an XML data tree D all matches that satisfy a specified twig (or path) query pattern Q. In this survey we review, classify, and compare major techniques for twig pattern matching.Specifically, we consider two classes of major XML queryprocessing techniques: the relational approach and the native approach. The relational approach directly utilizes existing relational database systems to store and query XML data, which enables the use of all important techniques that have been developed for relational databases, while in the native approach, specialized storage and query-processing systems tailored for XML data are developed from scratch to further improve XML query performance. As implied by existing work, XML data querying and management are developing in the direction of integrating the relational approach with the native approach, which could result in higher query-processing performance and also significantly reduce system-reengineering costs.