85 search results - page 4 / 17 » Node Selection Query Languages for Trees |
108
click to vote
COLT
2010
Springer
14 years 7 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
BXML
2004
14 years 11 months ago
2004
: We present a grammar-based approach to specifying k-ary queries for XML documents. k-ary queries simultaneously locate k nodes of an input tree as specified by a given relation. ...
IDEAS
2008
IEEE
15 years 4 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
103
click to vote
DEXAW
2007
IEEE
15 years 1 months ago
2007
IEEE
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...
114
click to vote
IS
2011
14 years 1 months ago
2011
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...