Determining a group of related products on a computing device
View Patent ↗A computing device configured for determining a group of related products is described. The computing device includes a processor and instructions stored in memory that is in electronic communication with the processor. The computing device obtains product data that identifies a first product and a second product. The computing device also obtains license data. The computing device further identifies a relationship between the first product and the second product based on the license data. The computing device additionally determines a group of related products based on the relationship. The computing device also performs an operation based on the group.
1. A computing device configured for determining a group of related products, comprising:
a processor;
memory in electronic communication with the processor;
instructions stored in the memory, the instructions being executable to:
obtain product data that identifies a first product and a second product;
obtain license data;
identify a relationship between the first product and the second product based on the license data;
determine a group of related products based on the relationship, wherein determining the group of related products comprises:
generating an adjacency matrix for identifying related products; and
generating a connectivity matrix based on the adjacency matrix; and
perform an operation based on the group.
2. The computing device of claim 1 , wherein performing the operation based on the group comprises performing a compliance calculation based on the group.
3. The computing device of claim 1 , wherein the group is a licensable unit.
4. The computing device of claim 1 , wherein determining the group of related products further comprises:
identifying a unique row of the connectivity matrix; and
forming a distinct group for each unique row of the connectivity matrix.
5. The computing device of claim 1 , wherein determining the group of related products further comprises:
generating a hash set for storing a hash code for each unique row of the connectivity matrix;
determining if the hash code for a row exists in the hash set;
adding each unique hash code to the hash set, wherein the hash set identifies each unique row of the connectivity matrix; and
forming a distinct group for each unique row of the connectivity matrix.
6. The computing device of claim 1 , wherein determining the group of related products further comprises:
sorting the connectivity matrix through row exchanges and corresponding column exchanges to left align values of the connectivity matrix; and
forming a distinct group for each block of values centered along a main diagonal of the connectivity matrix.
7. The computing device of claim 1 , wherein the instructions are further executable to perform a Boolean OR operation on the relationship.
8. A method for determining a group of related products on a computing device, comprising:
obtaining product data that identifies a first product and a second product;
obtaining license data;
identifying, by the computing device, a relationship between the first product and the second product based on the license data;
determining, by the computing device, a group of related products based on the relationship, wherein determining the group of related products comprises:
generating an adjacency matrix for identifying related products; and
generating a connectivity matrix based on the adjacency matrix; and
performing an operation based on the group.
9. The method of claim 8 , wherein performing the operation based on the group comprises performing a compliance calculation based on the group.
10. The method of claim 8 , wherein the group is a licensable unit.
11. The method of claim 8 , wherein determining the group of related products further comprises:
identifying a unique row of the connectivity matrix; and
forming a distinct group for each unique row of the connectivity matrix.
12. The method of claim 8 , wherein determining the group of related products further comprises:
generating a hash set for storing a hash code for each unique row of the connectivity matrix;
determining if the hash code for a row exists in the hash set;
adding each unique hash code to the hash set, wherein the hash set identifies each unique row of the connectivity matrix; and
forming a distinct group for each unique row of the connectivity matrix.
13. The method of claim 8 , wherein determining the group of related products based on the relationship further comprises:
sorting the connectivity matrix through row exchanges and corresponding column exchanges to left align values of the connectivity matrix; and
forming a distinct group for each block of values centered along a main diagonal of the connectivity matrix.
14. The method of claim 8 , wherein the method further comprises performing a Boolean OR operation on the relationship.
15. A non-transitory, tangible computer-readable medium for determining a group of related products, comprising executable instructions for:
obtaining product data that identifies a first product and a second product;
obtaining license data;
identifying a relationship between the first product and the second product based on the license data;
determining a group of related products based on the relationship, wherein determining the group of related products comprises:
generating an adjacency matrix for identifying related products; and
generating a connectivity matrix based on the adjacency matrix; and
performing an operation based on the group.
16. The computer-readable medium of claim 15 , wherein performing the operation based on the group comprises performing a compliance calculation based on the group.
17. The computer-readable medium of claim 15 , wherein determining the group of related products further comprises:
identifying a unique row of the connectivity matrix; and
forming a distinct group for each unique row of the connectivity matrix.
18. The computer-readable medium of claim 15 , wherein determining the group of related products further comprises:
generating a hash set for storing a hash code for each unique row of the connectivity matrix;
determining if the hash code for a row exists in the hash set;
adding each unique hash code to the hash set, wherein the hash set identifies each unique row of the connectivity matrix; and
forming a distinct group for each unique row of the connectivity matrix.
19. The computer-readable medium of claim 15 , wherein determining the group of related products further comprises:
sorting the connectivity matrix through row exchanges and corresponding column exchanges to left align values of the connectivity matrix; and
forming a distinct group for each block of values centered along a main diagonal of the connectivity matrix.
20. The computer-readable medium of claim 15 , wherein the instructions are further executable to perform a Boolean OR operation on the relationship.