This page provides many different techniques and strategies to help you find what you need in library databases. Library databases work differently than search engines like Google. The tips on this page will make you a more effective searcher when using the library's resources. These techniques can be used in any library database.
Boolean operators define the relationship between search terms.
diabetes AND children = articles about children with diabetes
diabetes OR children = articles about either diabetes or children
diabetes NOT children = articles about diabetes, but excludes articles mentioning children with diabetes
Here is a series of Venn diagrams to show you how the Boolean operators limit or expand searches.
Image attribution: CC BY-SA 4.0 by Cecelia Vetter
Proximity Searching in EBSCO:
Proximity searching is an advanced search strategy to search for two or more words that occur within a certain number of words from each other. The proximity operators are composed of a letter (N or W) and a number (to specify the number of words). The number cannot exceed 255.
The proximity operator is placed between the words that are to be searched, as follows:
Near Operator (N): N5 finds the words if they are a maximum of five words apart from one another, regardless of the order in which they appear. For example, type tax N5 reform to find results that have a maximum of five words between the beginning and ending terms, that would match tax reform as well as tax that has been submitted for reform.
Within Operator (W): W8 finds the words if they are within eight words of one another, in the order in which you entered them. For example, type tax W8 reform to find results that would match tax reform but would not match reform of income tax.
In addition, multiple terms can be used on either side of the operator. See the following examples:
Note: Boolean operators (AND, OR, NOT) are not case sensitive unless they have been configured as such by your institution's administrator.