Boolean+Searches

Boolean Searches

Why are Boolean Searches recommended ?

They are an effective way of achieving the object of your search on the NET

If your Web searches are not returning the kind of information youʹre looking for, generally it is not you but the vast array of information available on the NET

However, it could be the way youʹre conducting your searches.

Refine your search query using special keywords called ʺBooleanʺ

( Pronounced BOO‐lee‐an) operators.

These clever little words can narrow your search, and reduce the amount of irrelevant material ( Referred to in “ Geekspeak” as ʺCrappolaʺ) that comes up as a result of to broad a search definition.

The technical definition of Boolean is :‐

ʺ Of, or relating to a logical combinatorial system utilizing variables, such as propositions and computer logic elements, through the operators :‐

AND, OR, NOT, IF, THEN and EXCEPT.ʺ

That is a mouthful in anyone’s language.

In simple terms, Boolean searches include the words AND, OR, NOT, and NEAR.

When used in conjunction with your search keywords, these operators help narrow or refine your searches.

Basic rules to follow when launching Boolean searches:

1. Use the word AND to search for information containing more than one keyword.

For example, if you type ʺInternet AND legislation,ʺ your query will give you only information containing both of your keywords.

2. Use the word OR to search for results containing at least one of your keywords. For example, ʺElfs OR Leprechaunsʺ would return any document that contained either of the words.

3. The word NOT tells the search engine to look for results that do not contain the keyword.

For example, ʺPets NOT Spiders.ʺ

4. The word NEAR shows results that contain the keywords only when they appear within approximately ten words of each other.

For example, ʺBush NEAR Problem.ʺ

A Boolean search can achieve better results faster than non‐Boolean searches and will save you time and NOT (Pun ) add to your frustration.