Sciweavers

443 search results - page 5 / 89
» Relational Approach to Logical Query Optimization of XPath
Sort
View
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 7 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
ICDT
2005
ACM
139views Database» more  ICDT 2005»
14 years 29 days ago
First Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
Maarten Marx
JACM
2008
91views more  JACM 2008»
13 years 7 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari
VLDB
2004
ACM
101views Database» more  VLDB 2004»
14 years 24 days ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng
PLANX
2007
13 years 9 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...