Optimizing candidate check costs for bitmap indices

Doron Rotem, Kurt Stockinger, Kesheng Wu. Optimizing candidate check costs for bitmap indices. In Otthein Herzog, Hans-Jörg Schek, Norbert Fuhr, Abdur Chowdhury, Wilfried Teiken, editors, Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31 - November 5, 2005. pages 648-655, ACM, 2005. [doi]

@inproceedings{RotemSW05:0,
  title = {Optimizing candidate check costs for bitmap indices},
  author = {Doron Rotem and Kurt Stockinger and Kesheng Wu},
  year = {2005},
  doi = {10.1145/1099554.1099718},
  url = {http://doi.acm.org/10.1145/1099554.1099718},
  tags = {optimization},
  researchr = {https://researchr.org/publication/RotemSW05%3A0},
  cites = {0},
  citedby = {0},
  pages = {648-655},
  booktitle = {Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31 - November 5, 2005},
  editor = {Otthein Herzog and Hans-Jörg Schek and Norbert Fuhr and Abdur Chowdhury and Wilfried Teiken},
  publisher = {ACM},
  isbn = {1-59593-140-6},
}