This study investigates relationships between file sizes, amounts of inform
ation contained in commonly used record linkage variables, and the amount o
f information needed for a successful probabilistic linkage project. We pre
sent an equation predicting the amount of information needed for a successf
ul linkage project. Match weights for variables commonly used in record lin
kage are measured using artificially created databases. Linkage algorithms
were successful when the sum of minimum weights for variables used in a lin
kage exceeded the predicted cutoff. Linkage results were acceptable when th
is sum was near the predicted cutoff. This technique enables researchers to
determine if enough information exists to perform a successful probabilist
ic linkage.