Linked List Data Structure for Key-Based Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional key-based data structures are inefficient for storing and retrieving information about objects with frequent updates, as they either store all information in a single entry leading to inefficient access or use multiple entries requiring multiple keys, which complicates retrieval and expiration policies.
Innovation Solution
Storing multiple data items associated with the same business key in separate entries forming a linked list in reverse chronological order, with each entry referencing the previous one, and using a business key for retrieval and automatic expiration of the least recent items.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If all information for an object is stored in a single entry in a key-based data structure, then retrieval using a single business key is simple, but access efficiency deteriorates when frequent updates occur and expiration policies need to be enforced
Solution Approach 1:
The patent segments the single entry into multiple entries, each representing a different version or snapshot of the object's information. Each entry contains a subset of data items and is linked to the next entry through a pointer, creating a chain of historical versions. This segmentation allows efficient access to specific versions while maintaining retrieval simplicity through the business key.
2Productivity
If multiple entries are used to store various information for an object, then access efficiency improves for specific data items, but retrieval complexity increases requiring multiple keys
Solution Approach 1:
The patent merges multiple entries into a unified structure by introducing a business key that references the head of a linked list of entries. The entries are connected through pointers forming a chain, allowing retrieval of all related information through a single business key while maintaining efficient access to specific data items within the chain.
3Reliability
If multiple entries are used to store information for an object, then data expiration policies can be enforced more effectively, but device complexity increases
Solution Approach 1:
The patent introduces dynamic management of the entry chain through a head pointer that tracks the most recent entry. When new information arrives, the system dynamically creates new entries and updates the head pointer, automatically enforcing expiration policies by allowing old entries to be garbage collected. This dynamic approach manages complexity through clear pointer-based structure rather than complex control logic.
Data Source
AI summary
A processor stores a first data item in a first entry of a data structure in association with a first key. The processor stores a second data item in a second entry of the data structure in association with the second key. The processor causes the second entry of the data structure to reference the first entry of the data structure. The processor stores the second key in a third entry of the data structure in association with a business key. The business key is employed to identify a plurality of entries of the data structure comprising the first entry and the second entry.