Skip to Main Content
Unlike existing studies dealing with the selection of Bitmap Join Indexes for star join queries optimization, this paper presents three original features. The first one consists in addressing the problem with ant based approach that is more robust than the simple heuristic algorithms, which are usually used in the related works. The second interesting novelty resides in the metric used to prune the search space. The fitness function designed in the ant approach is brought from information retrieval technologies and is more refined than the frequency measure usually used. Finally, the third efficient aspect is in the data structure used to manage dynamically the storage in order to select the best promising indexes.