Plány vykonávání větveného dotazu nad XML daty

Kód výsledku v IS VaVaI

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

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Query Plans for Twig Content-based Queries of XML Data

Popis výsledku v původním jazyce

XML (Extensible Mark-up Language) has been embraced as a new approach to data modeling. Nowadays, more and more information is formated as semi-structured data, e.g. articles in a digital library, documents on the web and so on. Implementation of an efficient system enabling storage and querying of XML documents requires development of new techniques. Many different techniques of XML indexing have been proposed during recent years, however there are not much works about query optimization. Path-based approaches are considered as more efficient for processing simple-path queries than structural-based approaches. However, query plans of twig query processing usually consider only XML query processing based on structural joins. In this work, we describe query plans of twig query processing for path-based approaches. We introduce the technique for a selection of query path order and suitable path-join algorithm as well. We propose simple summary index, which supports query result size asse

Název v anglickém jazyce

Query Plans for Twig Content-based Queries of XML Data

Popis výsledku anglicky

XML (Extensible Mark-up Language) has been embraced as a new approach to data modeling. Nowadays, more and more information is formated as semi-structured data, e.g. articles in a digital library, documents on the web and so on. Implementation of an efficient system enabling storage and querying of XML documents requires development of new techniques. Many different techniques of XML indexing have been proposed during recent years, however there are not much works about query optimization. Path-based approaches are considered as more efficient for processing simple-path queries than structural-based approaches. However, query plans of twig query processing usually consider only XML query processing based on structural joins. In this work, we describe query plans of twig query processing for path-based approaches. We introduce the technique for a selection of query path order and suitable path-join algorithm as well. We propose simple summary index, which supports query result size asse

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

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 periodika

Digital Technology Journal

ISSN

1802-5811

e-ISSN

—

Svazek periodika

1

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

10

Strana od-do

—

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—