Adaptive Data Compression for Threshold-Based Memory Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Organizations face challenges in managing memory storage and communication bandwidth due to increasing computing resources demands, particularly in financial institutions handling large volumes of electronic transactions, which can lead to memory depletion and communication slowdowns.
Innovation Solution
Implementing a memory management system that compresses data structures based on predetermined thresholds, using compression parameters to reduce the size of data elements and generate compressed data structures, thereby minimizing memory usage and communication delays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is stored in uncompressed format to maintain data integrity and accessibility, then data quality and retrieval speed are improved, but memory storage capacity is depleted faster
Solution Approach 1:
The patent applies parameter changes by transforming data from uncompressed to compressed format, altering the physical state of data storage. The compression process changes the density and size parameters of data structures while maintaining their informational content, allowing the same logical data to occupy less physical memory space.
Solution Approach 2:
The patent creates compressed copies of original data structures. Instead of modifying the original data directly, the system generates compressed representations that can be stored in place of or alongside the original data, enabling space-efficient storage while preserving data accessibility through decompression when needed.
2Reliability
If large volumes of transaction data are stored to meet regulatory requirements, then compliance is achieved, but memory usage exceeds allocation limits
Solution Approach 1:
The system changes the storage parameters of transaction data by applying compression algorithms that reduce the size of data structures holding regulatory-required information. This allows the same volume of compliant data to be stored within existing memory allocation limits.
Solution Approach 2:
The patent segments the memory management process into monitoring, evaluation, and compression phases. The system divides data management into individual data structure units that can be independently evaluated and compressed based on their size relative to thresholds, enabling granular control over memory usage while maintaining overall compliance.
3Reliability
If data structures are synchronized in real-time between computing systems to ensure data consistency, then data accuracy is improved, but communication bandwidth is consumed excessively
Solution Approach 1:
The patent applies parameter changes to communication data by compressing data structures before transmission. This transformation alters the size and density parameters of the data being communicated, reducing the bandwidth required for synchronization while maintaining data consistency across systems.
Solution Approach 2:
The system performs preliminary compression of data structures before they are transmitted for synchronization. By pre-compressing the data, the system reduces the communication overhead required for real-time synchronization, allowing data consistency to be maintained with lower bandwidth consumption.
4Speed
If uncompressed data structures are used to enable fast data processing and access, then processing speed is improved, but additional storage devices must be added to expand capacity
Solution Approach 1:
The patent changes the storage parameters by implementing compression that reduces data structure sizes. This allows the system to maintain faster processing speeds with existing storage capacity, eliminating or delaying the need to add additional storage devices to expand capacity.
Data Source
AI summary
Systems, devices and methods for adaptive compression of stored information includes a memory management computing device programmed to monitor a size of a plurality of data structures stored in a data repository. The computing device compares the size of each of a plurality of data structures to a predetermined threshold. When a size of an uncompressed data structure meets the threshold, the memory management computing device calculates a value of a first compression parameter based on a value of a first parameter and a value of a second parameter of each data element of the uncompressed data structure, calculates a value of a second compression parameter based the value of the first parameter of each data element of the uncompressed data structure, generates a compressed data structure based on the value of the first compression parameter and the second compression parameter; and replaces, in the data repository, the uncompressed data structure with the compressed data structure.