Dynamic Compression Dictionary for Database Value Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Value List Compression techniques for database tables are inefficient due to expensive access to uncompressed values, linear degradation of access performance with the number of values, inability to modify compressed values in place, and inefficient storage of new values in positional lists.
Innovation Solution
Implementing a dynamic compression dictionary in conjunction with a static compression dictionary, allowing for direct access and modification of values, and using a first bit to specify the dictionary for compressed code values, with the dynamic dictionary growing as values are inserted and remaining unsorted for efficient insertion and modification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If a positional list is used to store uncompressed values, then new values can be appended easily, but access to uncompressed values becomes expensive and performance degrades linearly with the number of values
Solution Approach 1:
The patent transforms the static positional list into a dynamic structure by introducing a dynamic compression dictionary that can grow and evolve. The dictionary maintains insertion order for new values while enabling efficient access through a combination of compressed code values and dynamic updates, resolving the contradiction between easy insertion and fast access
Solution Approach 2:
The patent segments the storage structure into multiple components: a static compression dictionary for known values, a dynamic compression dictionary for new values, and compressed code values. This segmentation allows each component to optimize for its specific function, with the dynamic dictionary handling new value insertion efficiently while maintaining access performance through structured organization
2Productivity
If a static compression dictionary is used, then compression is efficient for known values, but new values cannot be added to the dictionary and must be stored as uncompressed values
Solution Approach 1:
The patent introduces a dynamic compression dictionary that evolves alongside the data. New values are automatically added to the dynamic dictionary as they appear, allowing the system to adapt to changing data patterns while maintaining efficient compression. This dynamic structure resolves the contradiction by enabling both efficient compression of known values and adaptability to new values
Solution Approach 2:
The patent merges the static and dynamic compression dictionaries into a unified system where both dictionaries work together. The static dictionary provides efficient compression for known values, while the dynamic dictionary captures new values. This combination allows the system to maintain high compression efficiency while adapting to new data, resolving the contradiction between compression efficiency and adaptability
3Productivity
If compressed values are stored in a fixed structure, then storage is efficient, but modifications cannot occur in place and require deletion and reinsertion
Solution Approach 1:
The patent introduces dynamic structures that allow in-place modifications. The dynamic compression dictionary and associated bit structures enable compressed values to be modified directly without requiring deletion and reinsertion. This dynamic approach maintains storage efficiency while enabling easy modification, resolving the contradiction between storage efficiency and ease of modification
Data Source
AI summary
A system and method for compressing data. The system and method employ a static compression dictionary, or look-up table, containing a predetermined number of uncompressed data values and corresponding compressed code values for replacing uncompressed data values with their corresponding compressed code values to reduce data storage requirements. The system and method further employ a dynamic compression dictionary, to which uncompressed data values and corresponding compressed code values are added as required to compress uncompressed data values not contained within the static compression dictionary.