Boolean search gets its name from Boolean algebra — the mathematical logic framework developed by George Boole in the 19th century. In recruiting, it refers to the use of AND, OR, NOT, and parentheses to build search strings that return exactly the candidate profiles you are looking for, filtering out irrelevant results.
The core operators work as follows: AND narrows results by requiring both terms to be present ("Python AND Django" returns only profiles mentioning both); OR broadens results by accepting either term ("JavaScript OR TypeScript" returns profiles with either skill); NOT excludes results containing a term ("marketing NOT digital" returns marketing profiles not focused on digital); and parentheses group terms to control the order of logic operations ("(Python OR Java) AND machine learning" finds candidates with machine learning experience and at least one of the two languages).
Boolean search is applicable across multiple tools: LinkedIn Recruiter, Indeed CV search, Google (using site: operator to search LinkedIn profiles), ATS candidate databases, and many CV databases. Each platform has slightly different syntax requirements — LinkedIn Recruiter, for example, requires operators to be in uppercase to be recognised as Boolean operators rather than literal search terms.
A well-constructed Boolean search string can be reused, shared across recruiting teams, and iterated based on results. Starting with a broad string and progressively narrowing with NOT operators to exclude irrelevant profiles is more efficient than starting narrow and missing candidates, then broadening.
Key Points: Boolean Search
- AND operator: Narrows results — both terms must be present. Used to require core qualifications to appear together.
- OR operator: Broadens results — either term is acceptable. Used to capture skill variations, synonyms, and alternative titles.
- NOT operator: Excludes results — profiles containing the excluded term are filtered out. Used to remove irrelevant industries or roles.
- Parentheses: Group operators to control logical order, enabling complex queries with multiple AND/OR combinations.
- Quotation marks: Force exact phrase matching — "machine learning engineer" returns only that exact phrase, not profiles with those words in different positions.
How Boolean Search Works in Treegarden
Boolean Search in Treegarden
Treegarden's candidate database search supports Boolean-style queries, enabling recruiters to search across all candidate CVs and profiles using keyword combinations. The AI Recruiter feature accepts natural language queries — effectively translating recruiter intent into structured database searches without requiring manual Boolean construction. For recruiters who prefer explicit control, keyword filters and tag combinations provide precision targeting within the candidate database.
Related HR Glossary Terms
Frequently Asked Questions About Boolean Search
On LinkedIn Recruiter and many professional databases, yes — AND, OR, NOT must be in uppercase to be recognised as logical operators rather than literal words. If you type 'python and django' in LinkedIn Recruiter, the 'and' is treated as a search term, not an operator, producing different results than 'python AND django'. In Google search, capitalisation doesn't matter — Google recognises lowercase 'and' and 'or' as operators. In ATS candidate database searches, the behaviour varies by platform — check your specific tool's documentation. The safe practice is to always capitalise Boolean operators to ensure they are interpreted correctly regardless of the platform.
A Boolean search string is a complete structured query that combines terms and operators to define the candidate profile you are seeking. Building one effectively starts with the role requirements: identify the must-have skills, the acceptable variations of those skills (e.g., JavaScript OR TypeScript OR React), the job title variations (e.g., "software engineer" OR "software developer" OR "software architect"), any industry or company experience requirements, and any terms to exclude (e.g., NOT intern NOT junior if you need a senior profile). Combine these elements using AND to require co-occurrence of key groups, OR within groups to capture variations, NOT to exclude irrelevant terms, and parentheses to group the logic correctly. Test the string, review the results, and refine based on what you see.
Boolean search remains highly relevant because it gives recruiters explicit, auditable control over search logic. AI sourcing tools can surface relevant candidates through semantic matching — finding profiles that are contextually similar to a description even without exact keyword matches — but they operate as black boxes where the recruiter cannot see exactly why a particular candidate was surfaced or excluded. Boolean search is transparent: you can see exactly what the query is looking for and trace why any specific result was returned. The most effective sourcing combines both: AI tools for broad discovery and semantic matching, and Boolean refinement for precision targeting when you need to apply specific inclusion and exclusion criteria.
Google Boolean search for candidate sourcing uses the site: operator to restrict results to specific platforms, combined with Boolean operators to filter by relevant terms. A typical LinkedIn sourcing string looks like: site:linkedin.com/in "software engineer" ("Python" OR "Django") ("London" OR "Remote") -job -jobs -hiring. This searches LinkedIn profile pages for software engineers with Python or Django, based in London or working remotely, excluding LinkedIn job posting pages. The minus sign (-) is Google's NOT equivalent. Quotation marks enforce exact phrase matching. This technique — sometimes called 'X-Ray searching' — surfaces public LinkedIn profiles without requiring a LinkedIn Recruiter subscription, though it is limited to publicly visible profile content.