Tag Archives: DiscoverEd

BOO-lean operators

Posted on by
Reply

We know Hallowe’en was last week, but saw this on Twitter and it’s too good not to share! If you’ve ever wondered what library staff (and mathematicians and engineers and many other professions) talk about when they mention Boolean operators or logic gates, this handy infographic from @38mo1 may help!

A grid of three images across, two rows deep. Each image shows an example of Boolean searching/logic gates using halloween images of pumpkins and phrases to demonstrate. The first shows Trick OR Treat, two circles which overlap with the entire shape coloured. The second shows Trick AND Treat with just the overlapping area coloured. The third shows Trick XOR Treat with the area inside the circles which does not overlap coloured. The fourth shows Trick NOR Treat, with the area outside the circles and overlap coloured. The fifth shows Trick NAND Treat, with everything in the image apart from the overlapping area coloured. The sixth shows Trick XNOR Treat, which shows everything outside the circles plus the overlapping areas coloured but not the main body of each circle.

Traditionally search engines and databases used Boolean operators along with keywords to help you search more constructively. Some (like Google) now accept natural language searching, but many academic or technical databases still require you to search in this format.

For example, if you search on DiscoverEd:

  • “Property Law” OR Servitudes: 70,745 results.
  • “Property Law” NOT Servitudes: 57,500 results.
  • “Property Law” AND Servitudes: 154 results.

Those little connecting words can make all the difference!

For more help with searching, watch this short video (9 minutes) about Search Techniques on our Law Librarian Media Hopper Channel. Unfortunately pumpkins not included.