621 search results - page 18 / 125 » Efficient algorithms for minimizing tree pattern queries |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
PODS
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...