1. A computer-implemented method for compressing an n-partite representation of a binary relation where n is at least four, the method comprising: applying a first joining procedure to join first and second relations in the n-partite representation and so eliminate a first intermediate set of elements, resulting in a first (n−1)-partite representation; and applying a first re-factoring procedure to generate updated first and second relations and generate an updated first intermediate set of elements, resulting in an updated n-partite representation.