Expiring Key-Value Mappings for Data Dictionary Stability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
As data records increase, the quantity of primary key IDs in a data dictionary increases constantly, leading to system crashes due to unendurability.
Innovation Solution
A maintenance method for a data dictionary that detects and deletes key-value pairs exceeding a predetermined duration threshold, recovering the primary key IDs for reuse, thereby reducing unnecessary storage and preventing system crashes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data records continuously increase, then the data dictionary maintains more primary key IDs, but system crash risk increases due to unendurability
Solution Approach 1:
The patent implements a maintenance mechanism that periodically identifies and deletes obsolete key-value pairs from the data dictionary based on expiration timestamps. When a key-value pair expires, its primary key ID is recovered and added to a pool of reusable IDs, allowing the system to maintain a bounded quantity of active primary key IDs while supporting continuous data record growth.
Solution Approach 2:
The system performs periodic maintenance operations to scan the data dictionary, identify expired key-value pairs based on timestamp comparisons, delete them, and recover their primary key IDs. This periodic cleanup prevents unbounded growth of the data dictionary and associated system resources.
2Measurement precision
If the data dictionary maintains all primary key IDs, then mapping accuracy is ensured, but maintenance costs increase due to continuous storage requirements
Solution Approach 1:
The patent implements a maintenance mechanism that periodically identifies and deletes obsolete key-value pairs from the data dictionary based on expiration timestamps. When a key-value pair expires, its primary key ID is recovered and added to a pool of reusable IDs, allowing the system to maintain a bounded quantity of active primary key IDs while supporting continuous data record growth.
Solution Approach 2:
The patent extracts the timestamp component from each key-value pair's value, enabling the system to determine expiration status independently. This extraction allows for efficient identification and removal of expired entries without affecting the integrity of active mappings.
3Ease of manufacture
If primary key IDs are continuously allocated without reuse, then allocation simplicity is maintained, but storage requirements grow unboundedly
Solution Approach 1:
The patent implements a maintenance mechanism that periodically identifies and deletes obsolete key-value pairs from the data dictionary based on expiration timestamps. When a key-value pair expires, its primary key ID is recovered and added to a pool of reusable IDs, allowing the system to maintain a bounded quantity of active primary key IDs while supporting continuous data record growth.
Solution Approach 2:
The patent changes the state of primary key IDs from permanently allocated to temporarily held, enabling reuse after expiration. By introducing expiration timestamps and a recovery mechanism, the system transforms the lifecycle of primary key IDs to allow cyclic allocation patterns rather than purely incremental growth.
Data Source
AI summary
One or more embodiments of this specification provide maintenance methods and apparatuses for a data dictionary. In an implementation, a method includes obtaining maintenance duration of a key-value pair maintained by a data dictionary, where a key of the key-value pair comprises a primary key comprised in a data record stored in a database, a value of the key-value pair comprises a primary key ID obtained by mapping the primary key. In response to determining that the maintenance duration reaches a predetermined duration threshold, deleting the key-value pair and writing the primary key ID into a list of IDs to be allocated.