Recently, a main memory index structure called the cache conscious-generalized search tree (CC-GiST) was proposed. The CC-GiST is such a novel index structure that it can be used for implementing all the existing cache conscious trees with the minimal efforts. It incorporates the pointer compression and the key compression techniques, which were adopted by the existing cache conscious trees to reduce the cache misses, in a single framework. In this paper, we formally analyze the performance of the CC-GiST. We compare the performance of the CC-GiST with the existing cache conscious trees. The result shows that the CC-GiST has the negligible overhead for supporting all the existing cache conscious trees in a single framework, and the performance of the tree is almost unaffected.