A comparison of scanning algorithms

Abstract

Three implementation techniques for main memory database systems are described and compared, namely, the compilation, vectorization, and adaptive methods. The adaptive method can be combined with the standard, compilation, and vectorization methods. Experiments show that, with standard optimization techniques like vectorization and compilation, a performance increase of a factor of five can be obtained. The adaptive method turned out to be favorable only in combination with the vectorization and compilation approach. Experience with applying these techniques indicates that the performance increase is well worth the added implementation effort for both the compilation and vectorization approach.<>