XML query processing - Efficiency and optimality

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86085201" target="_blank" >RIV/61989100:27240/12:86085201 - isvavai.cz</a>

Výsledek na webu

<a href="http://delivery.acm.org/10.1145/2360000/2351478/p8-baca.pdf?ip=158.196.157.82&acc=ACTIVE%20SERVICE&CFID=180535456&CFTOKEN=91658825&__acm__=1364373370_a59e22cc1289e7e5183f59a2996fac42" target="_blank" >http://delivery.acm.org/10.1145/2360000/2351478/p8-baca.pdf?ip=158.196.157.82&acc=ACTIVE%20SERVICE&CFID=180535456&CFTOKEN=91658825&__acm__=1364373370_a59e22cc1289e7e5183f59a2996fac42</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/2351476.2351478" target="_blank" >10.1145/2351476.2351478</a>

Jazyk výsledku

angličtina

Název v původním jazyce

XML query processing - Efficiency and optimality

Popis výsledku v původním jazyce

XML (Extensible Mark-up Language) is a well established format which is often used for modeling of semi-structured data. XPath and XQuery are de facto standards among XML query languages and searching for occurrences of a twig pattern query (TPQ) in an XML document is one of their core tasks. There is a large number of different approaches addressing the TPQ matching problem. The aim of this article is to compare the state-of-the-art techniques and give an overview which can help to understand the relationships between different methodologies used in this area. We distinguish three main areas of a TPQ processing: (1) index data structures and XML document partitioning, (2) join algorithms, and (3) cost-based optimizations. We cover the most important techniques in each area and explain their relationships and possible combinations.

Název v anglickém jazyce

XML query processing - Efficiency and optimality

Popis výsledku anglicky

XML (Extensible Mark-up Language) is a well established format which is often used for modeling of semi-structured data. XPath and XQuery are de facto standards among XML query languages and searching for occurrences of a twig pattern query (TPQ) in an XML document is one of their core tasks. There is a large number of different approaches addressing the TPQ matching problem. The aim of this article is to compare the state-of-the-art techniques and give an overview which can help to understand the relationships between different methodologies used in this area. We distinguish three main areas of a TPQ processing: (1) index data structures and XML document partitioning, (2) join algorithms, and (3) cost-based optimizations. We cover the most important techniques in each area and explain their relationships and possible combinations.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F10%2F0573" target="_blank" >GAP202/10/0573: Zpracování XML dat v heterogenních a dynamických prostředích</a><br>

Návaznosti

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

Rok uplatnění

2012

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

ACM International Conference Proceeding Series 2012

ISBN

978-1-4503-1234-9

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

8-13

Název nakladatele

ACM

Místo vydání

New York

Místo konání akce

Praha

Datum konání akce

8. 8. 2012

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

WRD - Celosvětová akce

Kód UT WoS článku

—