Towards Cost-based Optimizations of Twig Content-based Queries

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F08%3A00018955" target="_blank" >RIV/61989100:27240/08:00018955 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Towards Cost-based Optimizations of Twig Content-based Queries

Popis výsledku v původním jazyce

In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for this purpose. Some effort has been expended in the optimization of XML query processing. There are not many works that take cost-based query optimizations into account. In the previous work, we find some cost-based considerations, however, they work only with one type of structural join and one type of underlying index. There are worksdepicted two types of query processing as well. The first type applies an element-based index, the second type applies a navigation in a persistent DOM-like structure. In our work, we propose usage of two path-based indices that provide significant potential for a query optimization based on a cost-based join selection.

Název v anglickém jazyce

Towards Cost-based Optimizations of Twig Content-based Queries

Popis výsledku anglicky

In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for this purpose. Some effort has been expended in the optimization of XML query processing. There are not many works that take cost-based query optimizations into account. In the previous work, we find some cost-based considerations, however, they work only with one type of structural join and one type of underlying index. There are worksdepicted two types of query processing as well. The first type applies an element-based index, the second type applies a navigation in a persistent DOM-like structure. In our work, we propose usage of two path-based indices that provide significant potential for a query optimization based on a cost-based join selection.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GP201%2F06%2FP113" target="_blank" >GP201/06/P113: Metody pro efektivní vyhledávání v rozsáhlých kolekcích slabě strukturovaných dat</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

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

DATESO 2008 - DATABASES, TEXTS, SPECIFICATIONS, OBJECTS: PROCEEDINGS OF THE 8TH ANNUAL INTERNATIONAL WORKSHOP

ISBN

978-80-248-1746-0

ISSN

—

e-ISSN

—

Počet stran výsledku

3

Strana od-do

—

Název nakladatele

VŠB - Technická univerzita Ostrava

Místo vydání

Ostrava

Místo konání akce

Desná, Česká Republika

Datum konání akce

16. 4. 2008

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

EUR - Evropská akce

Kód UT WoS článku

000272440700007