Efficient memory representation of XML documents

  • Authors:

  • Giorgio Busatto;Markus Lohrey;Sebastian Maneth

  • Affiliations:

  • Department für Informatik, Universität Oldenburg, Germany;FMI, Universität Stuttgart, Germany;Faculté I & C, EPFL, Switzerland

  • Venue:
  • DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times larger than the size of the document. A considerable amount of memory is needed to store the tree structure of the XML document. Here a technique is presented that allows to represent the tree structure of an XML document in an efficient way. The representation exploits the high regularity in XML documents by “compressing” their tree structure; the latter means to detect and remove repetitions of tree patterns. The functionality of basic tree operations, like traversal along edges, is preserved in the compressed representation. This allows to directly execute queries (and in particular, bulk operations) without prior decompression. For certain tasks like validation against an XML type or checking equality of documents, the representation allows for provably more efficient algorithms than those running on conventional representations.