1 / 8

Boolean Search

Boolean Search. By Kristy Seymour. Why do I need to be familiar with the Boolean Search??. Limits the number of hits that return on a search. Search is faster and easier for the searcher.

kalia-rogers
Télécharger la présentation

Boolean Search

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Boolean Search By Kristy Seymour

  2. Why do I need to be familiar with the Boolean Search?? • Limits the number of hits that return on a search. Search is faster and easier for the searcher. • As a result searcher has a more productive search and is not frustrated and overwhelmed by irrelevant hits. • And less school day time is wasted by non-productive searches.

  3. Boolean Search • And • With the Boolean Search, and is used to limit a search to materials that include two or more search topics. • This narrows the search which can expedite the process or at times limit the search too much.

  4. Boolean Search • Or • Using OR will retrieve records in which AT LEAST one of the search terms is present. • Using or yields a lot of hits but can often be to wide of a search to be productive.

  5. Boolean Search • Not Any results containing the term after the word not will not be included in the results of the search.

  6. Boolean Search • Adjacent It is possible to search adjacent words or phrases. In most databases, putting quotes around the words will retrieve search terms occurring next to each other in the order entered.

  7. Boolean Search • ParenthesesParentheses are used to nest terms when more than one logical operator is used (and, or, not) so that the search engine knows how to read your query.

  8. Boolean Search • TruncationTruncation allows you to search words that begin with similar letters, but end differently. Most catalogs and databases use an asterisk (*) or a question mark (?) to represent remaining letters.

More Related