Consider a scenario where you need to efficiently find all occurrences of a relatively short pattern within a long text document. Which pattern matching algorithm would be most suitable, and why?

In this scenario, the Knuth-Morris-Pratt (KMP) algorithm would be most suitable. KMP is efficient for finding all occurrences of a short pattern in a long text document without unnecessary backtracking, as it preprocesses the pattern to avoid redundant comparisons.