Random-read data compression?

Question

Java

There are ~11-13GB files, binary if it matters.
The data in the file is sorted, which allows you to perform a quick search on them by the algorithm - Bisection method .
The essence of the question is whether it is possible to compress the data while leaving the possibility of this search.
While looking in the direction of bzip2, independent blocks on which you can also "jump", is there a better solution, or maybe ready-made ones?