Supporting complex queries on multiversion XML documents

  • Authors:

  • Shu-Yao Chien;Vassilis J. Tsotras;Carlo Zaniolo;Donghui Zhang

  • Affiliations:

  • NCR;University of California, Riverside;University of California, Los Angeles;Northeastern University, Boston, MA

  • Venue:
  • ACM Transactions on Internet Technology (TOIT)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Managing multiple versions of XML documents represents a critical requirement for many applications. Recently, there has been much work on supporting complex queries on XML data (e.g., regular path expressions, structural projections, etc.). In this article, we examine the problem of implementing efficiently such complex queries on multiversion XML documents. Our approach relies on a numbering scheme, whereby durable node numbers (DNNs) are used to preserve the order among the nodes of the XML tree while remaining invariant with respect to updates. Using the document's DNNs, we show that many complex queries are reduced to combinations of range version retrieval queries. We thus examine three alternative storage organizations/indexing schemes to efficiently evaluate range version retrieval queries in this environment. A thorough performance analysis is then presented to reveal the advantages of each scheme.