BitSet | BestHub

Java Architect Essentials

Oct 13, 2021 · Fundamentals

Understanding BitMap, BitSet, and Bloom Filter: Principles, Operations, and Applications

This article explains the principles of BitMap, BitSet, and Bloom Filter data structures, illustrating how they use bits to efficiently store, add, delete, and query large sets of integers, and discusses their practical applications such as fast sorting, deduplication, and membership testing.

AlgorithmBitSetBitmap

0 likes · 12 min read

Understanding BitMap, BitSet, and Bloom Filter: Principles, Operations, and Applications

Top Architect

Jan 2, 2021 · Fundamentals

Understanding Bitmap, BitSet, and Bloom Filter: Memory‑Efficient Data Structures for Large‑Scale Data

This article explains the bitmap concept, demonstrates how to store and query billions of integers using bitwise operations, introduces BitSet and Bloom Filter implementations, and provides practical Java code snippets for adding, removing, and checking elements while highlighting their memory‑saving advantages.

BitSetBitmapBloom Filter

0 likes · 12 min read

Understanding Bitmap, BitSet, and Bloom Filter: Memory‑Efficient Data Structures for Large‑Scale Data

Java Architect Essentials

Oct 6, 2020 · Backend Development

Using Redis to Count Website Visits: Hash, Bitset, and Probabilistic Algorithms

The article explains three Redis-based techniques—Hash, Bitset, and HyperLogLog—for counting daily page visits on high‑traffic sites, detailing command usage, memory trade‑offs, and the pros and cons of each method.

BackendBitSetHyperLogLog

0 likes · 6 min read

Using Redis to Count Website Visits: Hash, Bitset, and Probabilistic Algorithms