Filters are essential probabilistic data structures used for membership testing, efficiently determining if an element belongs to a set. They offer low memory overhead and high throughput by representing elements compactly, often residing in CPU caches. As a result, filters have become indispensable across diverse domains for efficient data querying. This chapter introduces the fundamental concept of filters, application scenarios, and four categories of filters designed for varying scenarios.