As random access memory gets cheaper, it becomes increasingly affordable to build
computers with large main memories. We consider decision support workloads within the …

Previous research has shown that cache behavior is important for main memory index
structures. Cache conscious index structures such as Cache Sensitive Search Trees (CSS …

Main memory capacities have grown up to a point where most databases fit into RAM. For
main-memory database systems, index structure performance is a critical bottleneck …

The performance of main-memory index structures is increasingly determined by the number
of CPU cache misses incurred when traversing the index. When keys are stored indirectly …

Recent studies have shown that cache-conscious indexes such as the CSB+-tree
outperform conventional main memory indexes such as the T-tree. The key idea of these …

In main-memory databases, the number of processor cache misses has a critical impact on
the performance of the system. Cache-conscious indices are designed to improve …

Publisher Summary This chapter proposes techniques to buffer accesses to memory
resident tree-structured indexes to avoid cache thrashing. It discusses several alternative …

We present the Height Optimized Trie (HOT), a fast and space-efficient in-memory index
structure. The core algorithmic idea of HOT is to dynamically vary the number of bits …

One approach to achieving high performance in a database management system is to store
the database in main memory rather than on disk. One can then design new data structures …

Disk access performance is a major bottleneck in traditional information retrieval systems.
Compared to system memory, disk bandwidth is poor, and seek times are worse. We …