On the efficiency of a prefix path holistic algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A86077629" target="_blank" >RIV/61989100:27240/09:86077629 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On the efficiency of a prefix path holistic algorithm
Original language description
In recent years, many approaches to XML twig pattern searching have been developed. Holistic approaches such as TwigStack are particularly significant in that they provide a powerful theoretical model for optimal processing of some query types. Holisticalgorithms use various partitionings of an XML document called streaming schemes and they prove algorithm optimality depending on query characteristics. In this article, we introduce a variant of the TwigStack algorithm which can work with various streaming schemes. Its efficiency does not deteriorate when the number of streams per query node is increased, as it does in the case of the iTwigJoin algorithm. Since the indices utilized by the iTwigJoin and our algorithm are exactly the same, we can use heuristics to select the appropriate algorithm. The aim of this paper is to show that the prefix path streaming scheme algorithms can be efficient even for documents with many labeled paths.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA201%2F09%2F0990" target="_blank" >GA201/09/0990: XML data processing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)