Constructing Database Searches:
A Short Course
With Michael John Neill
(scroll down for specific schedule)
Typing names into search boxes does not solve all your genealogical problems. We will see how to construct searches, organize searches, and problem-solve and troubleshoot when individuals are not located easily. Our discussion will concentrate on those instances when people are difficult to find. We will not be concerned with "easy" searches. We will use FamilySearch, Ancestry.com, and other databases. The only fee-based database that will be used will be Ancestry.com and attendees must have their own access to Ancestry.com as it is NOT provided in your course registration. The course will consist of three lectures (topics and schedule below), problem
assignments, virtual follow-up discussions, group discussion board interaction,
and student submission of work (optional). There is no assigned grade—you get
from this what you put into it. Students will also be able to share their work
and ideas with other students.
Our lectures will be somewhat different--we will go through specific examples and situations and explain the different types of searches, wildcard, Boolean, string-based, etc. within the context of an example. That may seem like "diving in," but people tend to learn best by just doing. There will be reference information provided and time for discussion and commentary in the followup sessions and bulletin board interaction.
Our lectures will be somewhat different--we will go through specific examples and situations and explain the different types of searches, wildcard, Boolean, string-based, etc. within the context of an example. That may seem like "diving in," but people tend to learn best by just doing. There will be reference information provided and time for discussion and commentary in the followup sessions and bulletin board interaction.
Citation of sources is important, but lectures will not focus
on citation theory.
Students will need to choose someone they cannot find in a US Federal census and two other online databases (free ones).
Students will need to choose someone they cannot find in a US Federal census and two other online databases (free ones).
Course registration is only $30. Class size is limited to 30 to encourage group interaction. Attendees will need to register by 8 PM Central
Time on 30 November 2012. Class starts on 1 December 2012. Registration is limited and is on a first-come, first-served basis only.
- Assignment/Study 1—Organizing Your Searches--The basics of any search strategy is search-tracking and organization. We'll see why when you are stuck most of your work is done away from the website. Students will then create search strategies based upon their own problems.
- Assignment/Study 2—Troubleshooting & Determining Best Options--We will discuss ways to tweak your search based upon unsuccessful results, ways to get around incomplete or missing "help," pages, and determining what other databases contain the same information. We will also discuss when a manual search of the records may be necessary.
- Assignment/Study 3— Discussion and Analysis of Student Problems--We will look at all (or most) student problems that were submitted, concentrating on those that highlight problem areas or situations not already discussed in detail.
Lectures will be recorded for those who are unable to attend
or have audio/video issues.
Lectures and discussions will be via GotoMeeting.
Want to register—Registration is only $30 and can be done
using your PayPal account or a major credit card (just process your order as a
PayPal “guest.”).Click here to register. Email Michael at mjnrootdig@gmail.com
with questions.
Schedule
| December 2012 | ||||||
| Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday |
| 1 lecture 1 PM Central | ||||||
| 2 | 3 | 4 followup discussion 8 PM Central | 5 | 6 | 7 | 8 lecture 1 PM Central |
| 9 | 10 | 11 followup discussion 8 PM Central | 12 | 13 | 14 | 15 lecture 1 PM Central |
| 16 | 17 | 18 followup discussion 8 PM Centra | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
| 30 | 31 | |||||
