| 摘要 |
One embodiment relates to an automated method for compressing an n-partite representation of an access control list or other binary relation. A first joining procedure is applied 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. A first re-factoring procedure generates updated first and second relations and an updated first intermediate set of elements, resulting in an updated n-partite representation. Other features, aspects and embodiments are also disclosed.
|
