157 search results - page 2 / 32 » A Path-based Approach for Efficient Evaluation of Twig Queri... |
ICDE
2001
IEEE
14 years 7 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
WEBDB
2004
Springer
13 years 11 months ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
WEBDB
2009
Springer
14 years 16 days ago
2009
Springer
The ubiquitous adoption of XML as the standard of data exchange over the web has led to increased interest in building efficient and scalable XML publish-subscribe (pub-sub) syste...
CIKM
2005
Springer
13 years 11 months ago
2005
Springer
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
EDBT
2006
ACM
14 years 6 months ago
2006
ACM
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...