Key-Value Data Format Segmentation for Storage Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing amount of data in lightweight formats like JSON for real-time server-to-client services leads to excessive storage resource consumption and decreased communication efficiency, with existing compression methods requiring binary encoding that makes data difficult to read and search.
Innovation Solution
A method to process data in key-value pairs by removing duplicated keys and reorganizing the format into a key portion followed by a value portion, with keys arranged in a predetermined order, allowing for efficient storage and transmission while maintaining readability and searchability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If data is stored in lightweight formats like JSON for real-time services, then readability and ease of parsing are improved, but storage resource consumption increases and communication efficiency decreases
Solution Approach 1:
The patent segments the data structure by separating keys from values and organizing them in a standardized format with key portion followed by value portion. This segmentation allows for more efficient storage by eliminating redundant key repetitions while maintaining the lightweight format's readability and parseability.
Solution Approach 2:
The patent changes the structural parameters of the data format by imposing a predetermined order on keys and corresponding values. This parameter change transforms the conventional JSON structure into a more compact representation that reduces storage requirements while preserving the human-readable and machine-parseable characteristics.
2Ease of operation
If data is stored in lightweight formats like JSON for real-time services, then readability and ease of parsing are improved, but communication efficiency decreases
Solution Approach 1:
By segmenting the data into key portion and value portion with a clear boundary, the patent enables more efficient parsing operations. The standardized structure with predetermined key ordering allows parsers to quickly navigate and extract information without processing redundant key repetitions, thereby improving communication efficiency while maintaining parseability.
Solution Approach 2:
The patent performs preliminary organization of keys in a predetermined order before data transmission or storage. This preliminary action reduces the computational overhead during parsing and communication operations, as the structured format eliminates the need for repeated key matching and validation that plagues conventional JSON formats.
3Adaptability or versatility
If conventional JSON format is used with duplicated keys for each data object, then data structure flexibility is maintained, but storage space is wasted
Solution Approach 1:
The patent merges duplicate keys into a single key portion that serves multiple data objects. By combining redundant key information into one location and maintaining a predetermined order, the patent eliminates storage space waste while preserving the ability to access and interpret data from multiple objects, thus maintaining structural flexibility without the bloat of repeated keys.
Solution Approach 2:
The standardized key portion with predetermined ordering serves multiple functions simultaneously: it provides unique identification, establishes data relationships, and enables efficient access patterns. This universal key structure replaces the need for repeated keys in each data object, reducing storage waste while maintaining the adaptability needed for various data structures and query patterns.
Data Source
AI summary
Disclosed are a computer-implemented method, a computer system and a computer program product for processing data in a data format with key-value pairs. All keys can be extracted from a plurality of data objects of the data. Duplicated keys can be removed such that only one of the same keys remains. The data in the data format can be reorganized into a format with a key portion followed by a value portion. The extracted keys can be arranged in the key portion in a predetermined order. The values of each of the plurality of data objects can be arranged in the value portion in an order corresponding to the order of the keys.