Key-Value Data Access Without Record De-serialization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data access systems are inefficient as they require de-serializing entire records from a data store for each transaction request, leading to high time and processing power consumption, especially in systems handling millions of requests daily.
Innovation Solution
A data access system that generates a table of key-value pairs for each record, allowing direct access and update of individual data values without de-serializing the entire record, using a data service module to manage access and updates independently of the data store's primary key structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the entire record is retrieved and de-serialized for each transaction request, then data access is possible, but time consumption and processing power increase significantly
Solution Approach 1:
The patent segments the record into individual fields, allowing the system to access only the specific field data needed for each transaction request rather than retrieving and de-serializing the entire record. This is achieved by creating a data access layer that queries the data store for specific field values using the primary key, thereby reducing time consumption while maintaining data access capability.
Solution Approach 2:
The patent extracts only the necessary field data from the record based on the transaction request type, rather than extracting the entire record. The data access layer identifies and retrieves only the specific fields required for processing the transaction, eliminating the need to de-serialize unnecessary data and reducing processing time.
2Reliability
If the entire record is retrieved and de-serialized for each transaction request, then data access is possible, but processing power consumption increases
Solution Approach 1:
The patent segments the record into individual fields, allowing the system to access only the specific field data needed for each transaction request rather than retrieving and de-serializing the entire record. This segmentation reduces the computational workload and processing power required, as the system only processes the minimal necessary data for each transaction.
Solution Approach 2:
The patent applies partial action by retrieving only the necessary portion of the record (specific fields) rather than the entire record. This partial retrieval approach reduces processing power consumption by avoiding the de-serialization and processing of unnecessary data, while still providing complete data access capability for the required fields.
3Stability of the object's composition
If the entire record is locked for access, then data consistency is maintained, but concurrent access to different values is prevented
Solution Approach 1:
The patent segments the record into individual fields, enabling fine-grained locking where only the specific field being accessed or modified is locked, rather than locking the entire record. This segmentation allows multiple transactions to concurrently access and modify different fields of the same record simultaneously, maintaining data consistency for each field while improving overall system productivity and concurrent access capability.
4Ease of operation
If frequent de-serialization and serialization operations are performed, then data access and updates are possible, but processing efficiency decreases
Solution Approach 1:
The patent extracts only the necessary field data from the record based on the transaction request type, rather than extracting the entire record. This selective extraction eliminates the need for frequent de-serialization and serialization operations, as the system works directly with the extracted field values, thereby improving processing efficiency while maintaining ease of data access and updates.
Data Source
AI summary
Methods and systems are presented for accessing various data values in a record stored in a data store independently from other data values in the record and without taking computationally expensive or storage-intensive procedures such as de-serializing a record based on a primary key. A data service module is provided to access each record in a data store, and generate for the records a table including a map of key-value pairs representing the data values in the records. When the data service module receives a request from an application for accessing a first data value in a first record, the data service module may retrieve a first key-value pair corresponding to the first data value in the first record without de-serializing the record. The data service module then provides a first value of the first key-value pair to the application.