662 search results - page 80 / 133 » Trees, Automata and XML |
155
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
250
click to vote
ICDE
2001
IEEE
16 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...
143
Voted
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
160
click to vote
SIGMOD
2008
ACM
15 years 6 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
283
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...