6004 search results - page 181 / 1201 » Parallelizing query optimization |
142
click to vote
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
131
click to vote
EUROPAR
2007
Springer
15 years 9 months ago
2007
Springer
How can sequential applications benefit from the ubiquitous next generation of chip multiprocessors (CMP)? Part of the answer may be a dynamic execution environment that automatica...
143
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
149
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
Most modern RDBMS depend on the query processing optimizer’s cost model to choose the best execution plan for a given query. Since the physical IO (PIO) is a costly operation to...
149
click to vote
DEXA
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...