13 search results - page 1 / 3 » Page Access Scheduling in Join Processing |
CIKM
1999
Springer
13 years 9 months ago
1999
Springer
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This r...
ADBIS
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
DEBU
2000
13 years 4 months ago
2000
Wide-area distribution raises significant performance problems for traditional query processing techniques as data access becomes less predictable due to link congestion, load imb...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
DAMON
2008
Springer
13 years 6 months ago
2008
Springer
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...