Heuristic search for k-anonymization in a generalization lattice
AssigneeSnowflake Inc.
InventorDavid Jensen
Life of this patent
Estimating the term…
Loading patent…
AssigneeSnowflake Inc.
InventorDavid Jensen
Estimating the term…
An approach is disclosed that computes a path through a generalization lattice comprising a plurality of levels. For each of the levels, the approach uses a scoring function to compute one or more values from a node on a first level of the generalization lattice to one or more neighboring nodes on a second level of the generalization lattice. The approach then adds a best node from the neighboring nodes to the path based on the values. At the completion of computing scoring functions on the generalization lattice, the path comprises a best node from each of the plurality of levels. The approach then selects an optimal node from the best nodes in the path.
A method comprising:
A system comprising:
A non-transitory computer readable medium, having instructions stored thereon which, when executed by a processing device, cause the processing device to:
Dependencies are inferred from the claim text.