Colin Slater found memory usage problems with MatchPessimisticB in extremely dense reference fields. This is due to larger data structures that the code makes to the searching steps as fast as possible. The complexity and size of these could be reduced enabling quicker task creation and lower memory overhead at the cost of slightly slower matching. This ticket will implement this reduction in complexity and compare to previous run times.