Results 1 
3 of
3
Counting Twig Matches in a Tree
, 2001
"... We describe efficient algorithms for accurately estimating the number of matches of a small nodelabeled tree, i.e., a twig, in a large nodelabeled tree, using a summary data structure. This problem is of interest for queries on XML and other hierarchical data, to provide query feedback and for cos ..."
Abstract

Cited by 74 (2 self)
 Add to MetaCart
and for costbased query optimization. Our summary data structure scalably representsapproximate frequencyinformation about twiglets (i.e., small twigs) in the data tree. Given a twig query, the number of matches is estimated by creating a set of query twiglets, and combining two complementary approaches: Set
Abstract Counting Twig Matches in a Tree
"... We describe efficient algorithms for accurately estimating the number of matches of a small nodelabeled tree, i.e., a twig, in a large nodelabeled tree, using a summary data structure. This problem is of interest for queries on XML and other hierarchical data, to provide query feedback and for cos ..."
Abstract
 Add to MetaCart
and for costbased query optimization. Our summary data structure scalably representsapproximate frequencyinformation about twiglets (i.e., small twigs) in the data tree. Given a twig query, the number of matches is estimated by creating a set of query twiglets, and combining two complementary approaches: Set
Counting Twig Matches in a Tree Zhiyuan ChenCornell Univ
"... 1 Introduction Hierarchical organization of data is ubiquitous. Traditionalexamples include (UNIX and Windows) file systems, where files ..."
Abstract
 Add to MetaCart
1 Introduction Hierarchical organization of data is ubiquitous. Traditionalexamples include (UNIX and Windows) file systems, where files