Boolean Redux: Performance of Advanced versus Simple Boolean Searches and Implications for Upper-Level Instruction

If you need an accessible version of this item, please submit a remediation request.
Date
2020
Language
American English
Embargo Lift Date
Department
Committee Members
Degree
Degree Year
Department
Grantor
Journal Title
Journal ISSN
Volume Title
Found At
Abstract

Building off an earlier study, which examined whether or not it was beneficial to teach Boolean logic to introductory students, the present study examines the efficacy of Boolean OR searching in more advanced search strategies, for example, capstone projects and graduate theses and dissertations. Results show that both simple and advanced Boolean searches yield relevant results. Based on relevance, there is no compelling evidence that either search is superior. To capture all the literature on a topic, however, it is important that upper-level students know the relevant databases for their discipline and perform multiple searches. Results can help inform whether teaching Boolean search skills to upper-division students in disciplinary contexts is time well spent.

Description
item.page.description.tableofcontents
item.page.relation.haspart
Cite As
M. Sara Lowe, Sean M. Stone, Bronwen K. Maxson, Eric Snajdr, & Willie Miller. (2020). "Boolean redux: Performance of advanced versus simple boolean searches and implications for upper-level instruction." Journal of Academic Librarianship. Volume 46, Issue 6, November 2020, 102234
ISSN
Publisher
Series/Report
Sponsorship
Major
Extent
Identifier
Relation
Journal
Source
Alternative Title
Type
Article
Number
Volume
Conference Dates
Conference Host
Conference Location
Conference Name
Conference Panel
Conference Secretariat Location
Version
Full Text Available at
This item is under embargo {{howLong}}