Boolean Search

Boolean search is defined as the structured process of using mathematical operators such as AND, OR, and NOT to limit the search on databases like Google, LinkedIn, ATS, CRM, etc. It helps to find more relevant search results when you have been given a unique set of instructions. Boolean search is based on George Boolean logic, who was a 19th century English mathematician.

Boolean Search Operators

• AND: An AND operator narrows down the search results. Between two keywords, it results in a search for posts containing both of the words. For example, “Cats AND Dogs” will retrieve all posts that contain both words.
• OR: An OR operator expands the search. It will return any posts that contain at least one of the search terms.
• NOT: A NOT operator excludes posts containing the keyword.