Sciweavers

DASFAA
2004
IEEE

Counting Relaxed Twig Matches in a Tree

13 years 7 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 selectivity estimates for each relaxed XML query, using a natural generalization of the correlated subpath tree (CST) summary structure, and (2) carefully combines these estimates by analyzing the nature of overlap between the different relaxed twig queries.
Dongwon Lee, Divesh Srivastava
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where DASFAA
Authors Dongwon Lee, Divesh Srivastava
Comments (0)