Sciweavers

VLDB
2004
ACM
92views Database» more  VLDB 2004»
13 years 10 months ago
Write-Optimized B-Trees
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports b...
Goetz Graefe
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
14 years 5 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe