Sciweavers

43 search results - page 2 / 9
» Estimating Answer Sizes for XML Queries
Sort
View
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
13 years 8 months ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
DEXAW
2007
IEEE
124views Database» more  DEXAW 2007»
13 years 8 months ago
XML Query Optimisation: Specify your Selectivity
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
Sven Hartmann, Sebastian Link
IANDC
2011
91views more  IANDC 2011»
12 years 11 months ago
Queries on Xml streams with bounded delay and concurrency
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
Olivier Gauwin, Joachim Niehren, Sophie Tison
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 6 months ago
Rewriting Regular XPath Queries on XML Views
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
Wenfei Fan, Floris Geerts, Xibei Jia, Anastasios K...
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 4 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin