1018 search results - page 74 / 204 » On the minimization of XPath queries |
134
click to vote
PODS
2005
ACM
16 years 1 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
203
Voted
VSTTE
2012
Springer
13 years 9 months ago
2012
Springer
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
126
click to vote
BNCOD
1997
15 years 2 months ago
1997
Abstract. In this paper we present two improvements to the partitioning process: 1) A new dynamic bu er management strategy is employed to increase the average block size of I/O-tr...
113
click to vote
FQAS
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minim...
AAAI
1997
15 years 2 months ago
1997
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding ...