System and method for automatic clean-up of redundant key-value pairs in a database
Inventors
Engelhart, Adam • Fichman, Paz • Khitrov, Alexey (Eli) • Peled, Niv
Assignees
Interested in licensing this patent?
MTEC can help explore whether this patent might be available for licensing for your application.
Publication Number
US-12632427-B2
Publication Date
2026-05-19
Expiration Date
Abstract
A system and method for automatic clean-up of redundant key-value pairs in a database is provided. The present disclosure comprises detecting a new key-value pair comprising a renamed key field or a new key field and a value field, in the database; identifying at least one redundant key-value pair in the plurality of key-value pairs of the database based on determining a similarity between the value field of the new key-value pair and a value field of at least one key-value pair in the plurality of key-value pairs; verifying whether one or more conditions are set for the at least one redundant key-value pair; and performing deletion of the identified at least one redundant key-value pair from the database, upon verification of the one or more conditions.
Core Innovation
The patent discloses a technique for automatic clean-up of redundant key-value pairs in a database comprising a plurality of key-value pairs. The technique detects a new key-value pair, including cases in which the new key-value pair comprises a renamed key field or a new key field and a value field, and identifies at least one redundant key-value pair by determining similarity between the value field of the new key-value pair and a value field of at least one key-value pair in the plurality of key-value pairs.
Redundancy is identified based on determining similarity between the value field of the new key-value pair and value fields of existing key-value pairs. The technique further performs one or more verification operations based on the at least one redundant key-value pair and one or more conditions, where the conditions comprise at least one association of the at least one redundant key-value pair with at least one ongoing process and/or a deletion operation schedule for the at least one redundant key-value pair.
The ongoing process comprises a computer program currently executing, and performing the one or more verification operations comprises monitoring the executing of the computer program. Deletion of the at least one redundant key-value pair from the database is performed based at least in part on output of the one or more verification operations indicating the at least one redundant key-value pair is free of association with the computer program. The technique can also involve flagging for deletion and supports deletion based on a deletion operation schedule.
Claims Coverage
The independent claims cover three implementations of the same core method: a method claim, a system claim, and a computer-readable medium claim. Across these independent claims, the core inventive features are detection of a new/renamed key-value pair, similarity-based identification of redundant key-value pairs, and verification that redundant entries are free of association with an executing computer program using association and/or a deletion operation schedule; deletion is then performed based on the verification output.
Detection of a new key-value pair and redundant detection via value field similarity
Detecting a new key-value pair in the database, wherein the new key-value pair comprises a renamed key field or a new key field and a value field; and identifying at least one redundant key-value pair in the plurality of key-value pairs of the database based on determining a similarity between the value field of the new key-value pair and a value field of at least one key-value pair in the plurality of key-value pairs.
Verification based on association with an ongoing process and/or deletion operation schedule
Performing one or more verification operations based on the at least one redundant key-value pair and one or more conditions, wherein the one or more conditions comprise at least one of: (a) at least one association of the at least one redundant key-value pair with at least one ongoing process, and (b) a deletion operation schedule for the at least one redundant key-value pair, wherein the at least one ongoing process comprises a computer program currently executing, and wherein performing the one or more verification operations comprises monitoring the executing of the computer program.
Deletion from the database based on verification output indicating freedom of association
Performing deletion of the at least one redundant key-value pair from the database based at least in part on output of the one or more verification operations indicating the at least one redundant key-value pair is free of association with the computer program.
The independent claims collectively provide coverage for automatically detecting new or renamed key-value pairs, identifying redundant key-value pairs by similarity between value fields, verifying that redundant entries have no association with a currently executing computer program and/or satisfy a deletion operation schedule, and deleting redundant key-value pairs based on the verification output.
Stated Advantages
Safe removal without data loss, based on verification indicating the redundant key-value pair is free of association with the computer program.
Documented Applications
Example domains/use cases include power grid / nuclear power plant environments.
Interested in licensing this patent?