Journal Title
Title of Journal: World Wide Web
|
Abbravation: World Wide Web
|
|
|
|
|
|
|
|
Authors: Andrei Arion Angela Bonifati Ioana Manolescu Andrea Pugliese
Publish Date: 2007/09/06
Volume: 11, Issue: 1, Pages: 117-151
Abstract
XML path summaries are compact structures representing all the simple parentchild paths of an XML document Such paths have also been used in many works as a basis for partitioning the document’s content in a persistent store under the form of path indices or path tables We revisit the notions of path summaries and pathdriven storage model in the context of currentday XML databases This context is characterized by complex queries typically expressed in an XQuery subset and by the presence of efficient encoding techniques such as structural node identifiers We review a path summary’s many uses for query optimization and given them a common basis namely relevant paths We discuss summarybased tree pattern minimization and present some efficient summarybased minimization heuristics We consider relevant path computation and provide a time and memoryefficient computation algorithm We combine the principle of path partitioning with the presence of structural identifiers in a simple pathpartitioned storage model which allows for selective data access and efficient query plans This model improves the efficiency of twig query processing up to two orders of magnitude over the similar tagpartitioned indexing model We have implemented the pathpartitioned storage model and path summaries in the XQueC compressed database prototype 8 We present an experimental evaluation of a path summary’s practical feasibility and of tree pattern matching in a pathpartitioned store
Keywords:
.
|
Other Papers In This Journal:
|