Abstract | ||
---|---|---|
Recent research shows that database performance can be significantly improved by the effective cache utilization of conventional microprocessors. Researchers have modified existing index structures into ones optimized for CPU cache performance in main memory database environments. The Cache Sensitive B+-Tree and recently developed Cache Sensitive T-Tree are the most well-known cache conscious index structures. In this paper, we present an experimental performance study to show how cache conscious trees perform on different types of modern CPU processors. We perform experiment evaluation on basic tree operations, search, range search, and insertion/deletion operation. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1145/2108616.2108668 | ICUIMC |
Keywords | Field | DocType |
database performance,cache conscious tree,cpu cache performance,cache sensitive b,modern microprocessors,effective cache utilization,index structure,well-known cache conscious index,basic tree operation,experimental performance study,cache sensitive t-tree,cpu cache,t tree | Cache-oblivious algorithm,Cache invalidation,Cache pollution,Cache,Computer science,Parallel computing,Cache algorithms,Real-time computing,Page cache,Cache coloring,Smart Cache | Conference |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ig-hoon Lee | 1 | 53 | 5.43 |
Jae-won Lee | 2 | 0 | 0.34 |
Junho Shim | 3 | 559 | 77.12 |
Sang-goo Lee | 4 | 832 | 151.04 |