193 search results - page 4 / 39 » Join Reordering by Join Simulation |
145
click to vote
PARLE
1993
15 years 7 months ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
209
Voted
AB
2008
Springer
15 years 5 months ago
2008
Springer
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
93
Voted
VLDB
1989
ACM
15 years 7 months ago
1989
ACM
Conventional approachesto execution of database queries on general purpose multiprocessorsattempt to maximizesystemthroughputusinginter-queryparallelism with a fixed numberof proc...
117
click to vote
SIGMOD
1995
ACM
15 years 7 months ago
1995
ACM
A number of execution strategies for parallel evaluation of multi-join queries have been proposed in the literature; their performance was evaluated by simulation. In this paper w...
99
Voted
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...