Boolean Search

Boolean search is a structured approach to searching databases that uses logical operators to narrow, expand, or exclude results. It’s widely used in recruiting to search platforms like LinkedIn, Google, ATS systems, and CRM databases more precisely than a standard keyword search allows.

The method is named after George Boole, a 19th-century English mathematician whose work on logical algebra forms the basis of how modern search engines handle these operators.

The three core operators work as follows:

AND narrows the search. Searching “Java AND Python” returns only results that contain both terms, filtering out anything that mentions just one.

OR expands the search. Searching “Java OR Python” returns results containing either term, which is useful when a role could be filled by candidates with different but equivalent skill sets.

NOT excludes results. Searching “developer NOT junior” removes results containing the excluded term, helping filter out candidates or content that don’t fit the criteria.

In recruiting, combining these operators, often with quotation marks for exact phrases and parentheses to group terms, lets sourcers build precise searches that surface the right candidates rather than wading through irrelevant results.