Using Bloom filter, we will be getting space optimization. The cassandra framework also has an implementation of Bloom Filter. But in detail, how is this space optimization achieved?
A bloom filter isn't a "framework". It's really more like simply an algorithm. The implementation ain't very long.
Here's one in Java I've tried (.jar, source code and JavaDoc being all available):
"Stand alone Java implementations of Cuckoo Hashing and Bloom Filters" (you may want to Google for this in case the following link ain't working anymore):