Fast and Tiny Structural Self-Indexes for XML

Details Fast and Tiny Structural Self-Indexes for XML Fast and Tiny Structural Self-Indexes for XML

2010-12-28

arxiv.org/abs/1012.5696v1

Computer Science

Databases

13 pages

Scientific paper

XML document markup is highly repetitive and therefore well compressible using dictionary-based methods such as DAGs or grammars. In the context of selectivity estimation, grammar-compressed trees were used before as synopsis for structural XPath queries. Here a fully-fledged index over such grammars is presented. The index allows to execute arbitrary tree algorithms with a slow-down that is comparable to the space improvement. More interestingly, certain algorithms execute much faster over the index (because no decompression occurs). E.g., for structural XPath count queries, evaluating over the index is faster than previous XPath implementations, often by two orders of magnitude. The index also allows to serialize XML results (including texts) faster than previous systems, by a factor of ca. 2-3. This is due to efficient copy handling of grammar repetitions, and because materialization is totally avoided. In order to compare with twig join implementations, we implemented a materializer which writes out pre-order numbers of result nodes, and show its competitiveness.

Affiliated with

Also associated with

No associations

Rating

Fast and Tiny Structural Self-Indexes for XML does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast and Tiny Structural Self-Indexes for XML, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast and Tiny Structural Self-Indexes for XML will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427699