Skip to main content

Computer Science: Essential Search Techniques

This guide describes ways to find information about computer science using resources available at the University of Regina.

Essential Search Techniques: Boolean Operators, Truncation, and Phrases

Almost all bibliographic databases, as well as the library catalogue and Summon, allow you to use Boolean operators, truncation, and phrases in your search statements. Using these can make your searches more effective.


Boolean Operators

The Boolean operators (named after 19th-century logician George Boole) are AND, OR, and NOT.

         cat AND dog    This retrieves items that have the word cat and the word dog.
cat OR dog This retrieves items that have the word cat or the word dog.
cat NOT dog This retrieves items that have the word cat but not the word dog. Use this with caution.

Boolean operators can be grouped with parentheses:

(cat OR feline) AND (dog OR canine)

Note: Most search engines do not require that Boolean operators be written in capital letters. However, a few do. If in doubt, capitalize.
 

Truncation

Truncation is used to retrieve items having various forms of words. It is especially useful for finding singular and plural forms of nouns.

In most database search engines, the truncation symbol is the asterisk ( * ).
In the U of R library catalogue, the truncation symbol is the question mark ( ? ).

randomi*    This retrieves items that have randomize, randomized, randomization, randomise, randomisability, etc.
 

Phrases

Phrases are sequences of words that appear together in the order specified. Use double quotation marks to indicate phrases.

"structured programming"   This retrieves items having this phrase, but not items in which structured appears somewhere and programming appears somewhere else, but not next to each other in that order.