Fast All-vs-All Conjunction Screening · 1 The problem

All-vs-all is n(n − 1)/2 pairs

The module screens every pair of a catalog; the count grows with the square of its size.