Path Summaries and Path Partitioning in Modern XML Databases
classification
💻 cs.DB
keywords
summariespathdatabasesaccessalgorithmsapplicabilitybasisbenefits
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.