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.
Cite
@article{arxiv.cs/0602039,
title = {Path Summaries and Path Partitioning in Modern XML Databases},
author = {Andrei Arion and Angela Bonifati and Ioana Manolescu and Andrea Pugliese},
journal= {arXiv preprint arXiv:cs/0602039},
year = {2007}
}