GiST scan acceleration using coprocessors
DaMoN '12 Proceedings of the Eighth International Workshop on Data Management on New Hardware
| Hi-index | 0.00 |
According to the advance of technologies, the speed gap between CPU and main memory is getting larger every year. Due to the speed gap, it was perceived important to make the most use of the cache residing between CPU and main memory, and there have been a lot of research efforts on this issue. Among those is the research on cache conscious trees for reducing the cost for accessing main memory indexes. Cache conscious trees were designed to cause as few cache misses as possible based on the characteristics of the cache. The most widely known cache conscious trees are the CSB+-tree, the pkB-tree, and the CR-tree. Since it is costly and error-prone to implement every cache conscious tree separately, we need a new systematic approach. An analogous approach was made for the disk based indexes. The Generalized Search Tree (GiST) was proposed as a framework for development of disk based indexes. The GiST basically provides the common features for disk based balanced search trees. Hence, when developing a disk based index using the GiST, only the features specific to the index need to be implemented. However, the GiST has the weakness that it cannot be efficiently used for main memory indexes because it was originally designed for the disk based indexes.