About: Reducing Temporary Trees in XQuery

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Reducing Temporary Trees in XQuery Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	The creation, maintenance and disposal of tree fragments during XQuery execution form a significant issue in the design of XQuery processors. The problem is further complicated by the definition of node identity which violates the functional nature of the XQuery language. This paper presents a novel mathematical model of XQuery execution that reflects temporary tree construction and manipulation, including navigation. Using this model as reference, an efficient algorithm of static analysis is presented that determines the level of information required at a particular place of the XQuery program. As a side effect, the algorithm also decides on the ordered/unordered context as defined by the XQuery language. Based on this algorithm, the amount of information stored during the execution as well as the complexity of operations may be significantly reduced. The creation, maintenance and disposal of tree fragments during XQuery execution form a significant issue in the design of XQuery processors. The problem is further complicated by the definition of node identity which violates the functional nature of the XQuery language. This paper presents a novel mathematical model of XQuery execution that reflects temporary tree construction and manipulation, including navigation. Using this model as reference, an efficient algorithm of static analysis is presented that determines the level of information required at a particular place of the XQuery program. As a side effect, the algorithm also decides on the ordered/unordered context as defined by the XQuery language. Based on this algorithm, the amount of information stored during the execution as well as the complexity of operations may be significantly reduced. (en)
Title	Reducing Temporary Trees in XQuery Reducing Temporary Trees in XQuery (en)
skos:prefLabel	Reducing Temporary Trees in XQuery Reducing Temporary Trees in XQuery (en)
skos:notation	RIV/00216208:11320/08:00101306!RIV12-AV0-11320___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1ET100300419), Z(MSM0021620838)
http://linked.open...iv/cisloPeriodika	5207
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Bednárek, David
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	391845
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/08:00101306
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	XQuery; Trees; Temporary; Reducing (en)
http://linked.open.../riv/klicoveSlovo	XQuery Trees Temporary Reducing
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[42B1AD1BE19F]
http://linked.open...i/riv/nazevZdroje	Lecture Notes In Computer Science
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization)
http://linked.open...UplatneniVysledku	2008
http://linked.open...v/svazekPeriodika	Neuveden
http://linked.open...iv/tvurceVysledku	Bednárek, David
http://linked.open...ain/vavai/riv/wos	000259393600004
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
issn	0302-9743
number of pages	16 (xsd:int)
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software