621 search results - page 39 / 125 » Efficient algorithms for minimizing tree pattern queries |
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most ...
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
ICDT
2010
ACM
13 years 11 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...