Sciweavers

5 search results - page 1 / 1
» Taming XPath Queries by Minimizing Wildcard Steps
Sort
View
VLDB
2004
ACM
101views Database» more  VLDB 2004»
13 years 10 months 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
VLDB
2005
ACM
125views Database» more  VLDB 2005»
13 years 10 months ago
Rewriting XPath Queries Using Materialized Views
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
Wanhong Xu, Z. Meral Özsoyoglu
EDBT
2008
ACM
108views Database» more  EDBT 2008»
14 years 5 months ago
Revisiting redundancy and minimization in an XPath fragment
Redundancy and minimization of queries are investigated in a well known fragment of XPath that includes child and descendant edges, branches, wildcards, and multiple output nodes....
Benny Kimelfeld, Yehoshua Sagiv
JACM
2008
91views more  JACM 2008»
13 years 4 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
ICDE
2005
IEEE
101views Database» more  ICDE 2005»
13 years 10 months ago
Optimization of Nested XQuery Expressions with Orderby Clauses
— XQuery, the defacto XML query language, is a functional language with operational semantics, which precludes the direct application of classical query optimization techniques. ...
Song Wang, Elke A. Rundensteiner, Murali Mani