Database Storage Lifecycle Control for Multi-Table Deletion Policies

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional database systems require manual and repetitive definition of deletion policies for tables, leading to inefficiencies, resource waste, and errors due to table name changes, causing unnecessary retention of stale data.

Innovation Solution

A deletion criterion is defined by an administrator and applied to multiple tables, with periodic execution, allowing data transfer to temporary storage and providing historical execution information, thereby improving resource utilization and reducing stale data retention.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If manual deletion policies are defined for each table, then deletion accuracy is improved, but management complexity and time consumption increase

Engineering Contradiction:
Improvedeletion accuracyVSAvoidpolicy management complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The deletion criterion is designed to be universally applicable across multiple tables simultaneously. Instead of defining separate deletion policies for each table, the system allows a single criterion to be applied to any table in the database system, reducing management complexity while maintaining deletion accuracy through standardized evaluation rules.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The deletion policy management is segmented into independent components: the deletion criterion definition, the table selection mechanism, and the execution engine. This segmentation allows the criterion to be defined once and reused across different tables, separating the deletion logic from the table-specific implementation details.

Inventive Principle:
Principle #1Segmentation

2Reliability

If deletion policies are manually defined for each table, then deletion precision is improved, but time consumption increases

Engineering Contradiction:
Improvedeletion precisionVSAvoidpolicy definition time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The deletion criterion is defined in advance with generic conditions (such as data age thresholds or status flags) that can be applied to multiple tables. This preliminary definition of the criterion structure allows for rapid application to different tables without requiring time-consuming redefinition for each table, while maintaining precision through structured evaluation logic.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

A single deletion criterion can be universally applied to multiple tables, eliminating the need to manually define separate policies for each table. This multi-functionality reduces the time required for policy management while preserving deletion precision through consistent evaluation rules applied across all target tables.

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Adaptability or versatility

If table names are changed, then data flexibility is improved, but deletion policy validity deteriorates

Engineering Contradiction:
Improvedata flexibilityVSAvoidpolicy validity
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The deletion criterion is designed to dynamically adapt to table name changes. Instead of being hard-coded with specific table names, the criterion uses flexible selection mechanisms (such as schema patterns or metadata-based matching) that automatically identify the correct tables even when their names change, maintaining policy validity while allowing data flexibility.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system incorporates feedback mechanisms where the deletion engine queries the current database schema to identify tables matching the criterion's selection criteria. This feedback loop ensures that when table names change, the system automatically updates its target list without requiring manual policy redefinition, maintaining both flexibility and validity.

Inventive Principle:
Principle #23Feedback

4Loss of information

If stale data is retained due to manual policy management, then data availability is improved, but storage efficiency deteriorates

Engineering Contradiction:
Improvedata availabilityVSAvoidstorage efficiency
Core Design Contradiction:
Loss of informationVSLoss of energy

Solution Approach 1:

The deletion criterion execution is designed to run continuously or periodically across all tables, ensuring that stale data is consistently identified and removed without interruption. This continuous action prevents data accumulation and maintains storage efficiency while ensuring data availability is maintained through controlled deletion practices.

Inventive Principle:
Principle #20Continuity of useful action

Solution Approach 2:

The system performs self-service deletion by automatically identifying and removing stale data based on the defined criterion, without requiring manual intervention. The deletion engine autonomously evaluates tables, identifies matching records, and executes deletions, thereby maintaining storage efficiency while preserving necessary data availability through automated management.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS12487977B2Storage lifecycle control in a database system
Publication Date: 2025.12.02 SNOWFLAKE INC
  • US12487977B2 patent drawing
  • US12487977B2 patent drawing
  • US12487977B2 patent drawing

AI summary

Systems and methods are provided for controlling the deletion of data in a database system. The system receives input comprising a deletion criterion for a database system. The system applies the deletion criterion to a set of tables of the database system. The system determines that an individual portion of the set of tables satisfies the deletion criterion. In response to determining that the individual portion of the set of tables satisfies the deletion criterion, the system transfers the individual portion of the set of tables to a temporary storage system.