Lawrence Berkeley National Laboratory

Most physics analysis jobs involve multiple selection steps on the input data. These selection steps are called \it cuts or \it queries. A common strategy to implement these queries is to read all input data from files and then process the queries in memory. In many applications the number of variables used to define these queries is a relative small portion of the overall data set therefore reading all variables into memory takes unnecessarily long time.In this paper we describe an integration effort that can significantly reduce this unnecessary reading by using an efficient compressed bitmap index technology. The primary advantage of this index is that it can process arbitrary combinations of queries very efficiently, while most other indexing technologies suffer from the ''curse of dimensionality'' as the number of queries increases. By integrating this index technology with the ROOT analysis framework, the end-users can benefit from the added efficiency with out having to modify their analysis programs. Our performance results show that for multi-dimensional queries, bitmap indices outperform the traditional analysis method up to a factor of 10.