EWAH – A compressed bitmap class in C++
github.com
github.com
Probably because the index is built to answer a "different kind of queries". There is a blog commenting on those "other" queries[2]. In the same blog the author discusses some other compressed data structures included in the library.
1: https://github.com/simongog/sdsl-lite 2: http://alexbowe.com/rrr/
There are some really interesting approaches to compressed data structures that preserve fast random access. This comparison of less exotic encodings was a good read too:
b) I haven't used SDSL much or RRR bit vectors, but IIRC it's more designed for maximum compactness as well as quick popcount & select type operations. You can do that with EWAH, but a lot of the power of EWAH and its ilk (BBC, WAH, etc.) is with set operators like AND, OR & ANDNOT. Does SDSL have the same kind of optimizations?
So yes, the problems they are solving are different, even though the input data is the same.
(It also reminded me of the joke "Why does Edward Woodward have so many 'd's in his name?")