I used some of the test data on the website to test my implementation [1] but didn't really compare to their other indexes.
Also make sure to always use the chilean mirror as the italian one is outdated (2005).
I used some of the test data on the website to test my implementation [1] but didn't really compare to their other indexes.
Also make sure to always use the chilean mirror as the italian one is outdated (2005).
Thanks for the code, I've seen you are using libcds's wavelet tree. I was wondering if you had implemented your own, since apart from libcds and sdsl (and some unreadable research code) I couldn't find any other implementation of the WT so I'm always curious to see if there are any developments in the engineering of wavelet trees, the current implementations are still too slow to be really useful, I think.
This paper [1] is the most recent practical wavelet tree paper I know of.
Instead of RRR it uses RLE and gamma codes. Oddly, I have found no comparisons between this approach and RRR. I would expect RLE to compress better, and it is also conceptually simpler, but I don't know how fast it is.