In this section we will review the steps you take in order to perform an effective search using databases and other resources. Every search begins with a research question or topic. If you have not developed your research question or chosen your topic you will need to complete this first step.
Step 1: Develop a research question or choose a topic
Step 2: Brainstorm your search terms, including MeSH terms, that should be included in your search
Step 3: Use Boolean logic to combine your terms
Step 4: Perform a preliminary search to determine if their is any literature on your topic (You can schedule an appointment with a librarian to assist you with performing your preliminary search.)
Step 5: Keep a record of your search strategy
PICO is an acronym for:
PICO is used to create a researchable question based on a clinical situation you have encountered. Based on your PICO question, you will identify keywords and/or subject terms to use in database searches.
You can use PICO to develop your clinical question.
Which population are you studying? (Consider age, gender, ethnicity, group with a certain disorder, etc.)
What do you want to do for the patient? (Consider therapy, exposure to a disease, risk behavior, prognostic factor, preventative measure, or diagnostic test)
Are you comparing two interventions or variables? (Consider absence of disease, absence of risk factor, or use of placebo)
What is the expected result or what do you hope to accomplish, improve or affect? (Consider disease incidence, accuracy of a diagnosis, rate of occurrence of adverse outcome, survival or mortality rates)What is the expected result or what do you hope to accomplish, improve or affect? (Consider disease incidence, accuracy of a diagnosis, rate of occurrence of adverse outcome, survival or mortality rates)
The type of study can generally be worked at by looking at three issues (as per the Tree of design in Figure 1):
For observational study the main types will then depend on the timing of the measurement of outcome, so our third question is: