Name
Abstract | ||
|---|---|---|
Researchers have modified existing index structures into ones optimized for CPU cache performance in main memory database environments. A Cache Sensitive B+-Tree is one of them. It is designed to minimize the impact of cache misses for B+-Trees and it has been known to be more effective than other types of main memory index structure including T-Trees. In this paper, we introduce a Cache Sensitive T-Tree (CST-Tree) and show how T-Trees can also be redesigned to be cache sensitive. We present an experimental performance study which shows that our Cache Sensitive T-Trees can outperform the original T-Trees and Cache Sensitive B+-Trees on average 65 percent and 17 percent, respectively. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-71703-4_35 | DASFAA |
Keywords | Field | DocType |
cpu cache performance,cache sensitive t-trees,main memory index structure,main memory database environment,cache sensitive b,index structure,original t-trees,experimental performance study,cache sensitive t-tree | Cache-oblivious algorithm,Cache invalidation,Cache pollution,Computer science,Cache,Parallel computing,Page cache,Cache algorithms,Cache coloring,Smart Cache | Conference |
Volume | ISSN | Citations |
4443 | 0302-9743 | 8 |
PageRank | References | Authors |
0.81 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ig-hoon Lee | 1 | 53 | 5.43 |
| Junho Shim | 2 | 559 | 77.12 |
| Sang-goo Lee | 3 | 832 | 151.04 |
| Jonghoon Chun | 4 | 175 | 21.31 |