Computer-implemented method for compressing representation of binary relation
First Claim
Patent Images
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.
2 Assignments
0 Petitions
Accused Products
Abstract
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.
-
Citations
17 Claims
-
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; andapplying 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. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer-readable medium configured with computer-readable program code to compress a n-partite representation of an access control list, the computer-readable medium comprising:
-
computer-readable program code configured to apply 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; andcomputer-readable program code configured to apply 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. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. An automated method for compressing a 4-partite representation of an access control list, the method comprising:
-
applying a first joining procedure to join first and second relations in the 4-partite representation and so eliminate a first intermediate set of elements, resulting in a first 3-partite representation; applying a first re-factoring procedure to generate updated first and second relations and an updated first intermediate set of elements, resulting in an updated 4-partite representation; applying a second joining procedure to join second and third relations in the 4-partite representation and so eliminate a second intermediate set of elements, resulting in a second 3-partite representation; and applying a second re-factoring procedure to generate updated second and third relations and an updated second intermediate set of elements, resulting in a further updated 4-partite representation; and determining whether a complexity of the further updated 4-partite representation is lower than a complexity of 4-partite representation and/or the updated 4-partite representation. - View Dependent Claims (16, 17)
-
Specification