The MongoDB Query Language (MQL) supports various logical operators, including $and, $or, and $not. However, the $not operator has unique semantics in MQL, particularly regarding missing values. The query engine must handle negations in a way that matches documents where the specified field is missing. The simplification of Boolean expressions can improve query performance by reducing computational overhead and enabling better plan generation. A modified Quine–McCluskey algorithm and Petrick's method on an efficient bitset representation of Boolean expressions are used to simplify complex filters. This approach boosts performance by taking advantage of the speed and simplicity of bitwise operations, which are generally quicker and more straightforward than working with the more complex AST structure. The simplification technique can lead to a 18,100% throughput improvement in demanding cases involving large collections and selective indexes.