On the efficiency of a prefix path holistic algorithm

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On the efficiency of a prefix path holistic algorithm

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

On the efficiency of a prefix path holistic algorithm

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F09%2F0990" target="_blank" >GA201/09/0990: Zpracování XML dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2009

Kód důvěrnosti údajů

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

Název statě ve sborníku

Database and XML technologies

ISBN

978-3-642-03554-8

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

—

Název nakladatele

Springer-Verlag

Místo vydání

Vienna

Místo konání akce

Lyon; France

Datum konání akce

24. 8. 2009

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000271210700003