XPath Query Processing

XPath Query Processing

Bibliografske podrobnosti
Main Authors:	Gottlob, G, Koch, C
Format:	Conference item
Izdano:	Springer 2003

Podobne knjige/članki

Efficient Algorithms for Processing XPath Queries
od: Gottlob, G, et al.
Izdano: (2002)

Efficient algorithms for processing XPath queries
od: Gottlob, G, et al.
Izdano: (2005)

The complexity of XPath query evaluation
od: Gottlob, G, et al.
Izdano: (2003)

The complexity of XPath query evaluation and XML typing
od: Gottlob, G, et al.
Izdano: (2005)

XPath Query Evaluation: Improving Time and Space Efficiency
od: Gottlob, G, et al.
Izdano: (2003)

XPath Processing in a Nutshell
od: Gottlob, G, et al.
Izdano: (2003)

XPath processing in a nutshell
od: Gottlob, G, et al.
Izdano: (2003)

XPath Leashed
od: Benedikt, M, et al.
Izdano: (2008)

Efficient evaluation of frequently issued similar XPath queries
od: Ong, Chin Sin.
Izdano: (2009)

Querying XML : XQuery, XPath, and SQL/XML in context /
od: Melton, Jim, 1946-, et al.
Izdano: (2006)

Querying archetype-based EHRs by search ontology-based XPath engineering
od: Stefan Kropf, et al.
Izdano: (2018-05-01)

XPath for DL ontologies
od: Kostylev, E, et al.
Izdano: (2015)

XPath satisfiability in the presence of DTDs
od: Benedikt, M, et al.
Izdano: (2008)

Axiomatizing Hybrid XPath with Data
od: Carlos Areces, et al.
Izdano: (2021-07-01)

Visual oXPath: robust wrapping by example
od: Kranzdorf, J, et al.
Izdano: (2012)

Visual oXPath: robust wrapping by example.
od: Kranzdorf, J, et al.
Izdano: (2012)

An extension of data automata that captures XPath
od: Mikołaj Bojańczyk, et al.
Izdano: (2012-02-01)

Monadic Queries over Tree−Structured Data
od: Gottlob, G, et al.
Izdano: (2002)

Conjunctive queries over trees
od: Gottlob, G, et al.
Izdano: (2006)

Conjunctive Queries over Trees
od: Gottlob, G, et al.
Izdano: (2006)

Conjunctive Queries over Trees
od: Gottlob, G, et al.
Izdano: (2004)

XPathTM 2.0 programmer's reference
od: 363355 Kay, Michael
Izdano: (2004)

Advanced Processing for Ontological Queries
od: Calì, A, et al.
Izdano: (2010)

Static analysis of navigational XPath over graph databases
od: Kostylev, E, et al.
Izdano: (2016)

Bottom-up automata on data trees and vertical XPath
od: Diego Figueira, et al.
Izdano: (2017-11-01)

On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
od: Frank Neven, et al.
Izdano: (2006-07-01)

XPath Node Selection over Grammar-Compressed Trees
od: Sebastian Maneth, et al.
Izdano: (2013-11-01)

XSLT 2.0 and XPath 2.0 programmer's reference /
od: 363355 Kay, Michael
Izdano: (2008)

FOXS-GSC—Fast Offset Xpath Service with HexagonS Communication
od: Celso A. R. L. Brennand, et al.
Izdano: (2023-07-01)

On the complexity of single−rule datalog queries
od: Gottlob, G, et al.
Izdano: (2003)

On the Complexity of Single−Rule Datalog Queries
od: Gottlob, G, et al.
Izdano: (1999)

Querying the Guarded Fragment
od: Barany, V, et al.
Izdano: (2010)

On Tractable Queries and Constraints
od: Gottlob, G, et al.
Izdano: (1999)

Ontological queries: Rewriting and optimization
od: Gottlob, G, et al.
Izdano: (2011)

Ontological Queries: Rewriting and optimization
od: Gottlob, G, et al.
Izdano: (2011)

Size and treewidth bounds for conjunctive queries.
od: Gottlob, G, et al.
Izdano: (2009)

The complexity of acyclic conjunctive queries
od: Gottlob, G, et al.
Izdano: (2001)

The Complexity of Acyclic Conjunctive Queries
od: Gottlob, G, et al.
Izdano: (1998)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1998)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (2002)