621 search results - page 44 / 125 » Efficient algorithms for minimizing tree pattern queries |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...
DASFAA
2007
IEEE
14 years 2 months ago
2007
IEEE
Finding all the occurrences of a twig pattern on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms, Tw...
IEEEICCI
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper investigates possible connection strategies in sparsely connected associative memory models. This is interesting because real neural networks must have both efficient p...