Path Summaries and Path Partitioning in Modern XML Databases

TL;DR

This paper explores how XML path summaries can optimize data access in modern XML databases, demonstrating their effectiveness through algorithms and experiments, especially when combined with path-partitioned storage.

Contribution

It introduces practical algorithms for building and using XML path summaries, showing their benefits in optimizing data access in current XML database systems.

Findings

Summaries significantly improve data access efficiency.

Combining summaries with path-partitioned stores yields better performance.

Extensive experiments validate the proposed methods.

Abstract

We study the applicability of XML path summaries in the context of current-day XML databases. We find that summaries provide an excellent basis for optimizing data access methods, which furthermore mixes very well with path-partitioned stores. We provide practical algorithms for building and exploiting summaries, and prove its benefits through extensive experiments.