Multi-Level Data Structure Comparison Using Commutative Digesting for Unordered Data Collections
AssigneeDell Products L.P.
InventorsDerek Labadie, Dominique Prunier
Life of this patent
Estimating the term…
Loading patent…
AssigneeDell Products L.P.
InventorsDerek Labadie, Dominique Prunier
Estimating the term…
Techniques are provided for comparing multi-level data structures using commutative digesting for unordered data collections. One method comprises obtaining two multi-level data structures, wherein at least one multi-level data structure comprises an unordered data collection; determining a data structure digest value for each the two multi-level data structures by accumulating a data element digest value for each data element of the respective multi-level data structure, wherein a data element digest value for a given data element comprising an unordered data collection is determined using a commutative accumulator function; and evaluating a similarity of the two multi-level data structures by comparing the respective data structure digest values. A data element digest value for a given data element comprising an ordered data collection can be determined using a noncommutative accumulator function that aggregates a digest value for each data element using a noncommutative operation.
A method, comprising:
An apparatus comprising:
A non-transitory processor-readable storage medium having stored therein program code of one or more software programs, wherein the program code when executed by at least one processing device causes the at least one processing device to perform the following steps:
Dependencies are inferred from the claim text.