Skip List Indirect Links for Database Defragmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large skip lists, updating pointers during record relocation can be time-consuming, limiting access to the database during defragmentation processes.
Innovation Solution
The use of indirect links in a skip list data structure minimizes the impact on access by only modifying a few hash bucket pointers, reducing the time and computational resources required for record relocation, addition, and deletion operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If direct pointer updates are used during record relocation in large skip lists, then data structure integrity is maintained, but access time increases significantly and database operations are disrupted
Solution Approach 1:
The patent introduces an intermediary mechanism where record relocation is performed through a two-phase process: first marking the record as relocated (without immediately updating all pointers), then subsequently updating pointers in a controlled manner. This intermediary marking approach allows the skip list to maintain functional integrity during relocation while minimizing access disruptions, as most operations can proceed with the marked record until pointer updates are completed.
Solution Approach 2:
The patent applies preliminary action by performing the record relocation operation in advance of actual pointer updates. The record is physically moved and marked as relocated before the pointer structure is updated, allowing the system to prepare for the change without immediately impacting access operations. This staged approach separates the relocation action from the pointer update action, reducing the time window during which access is disrupted.
2Productivity
If traditional record relocation methods are used in skip lists, then all pointer updates are performed, but the time required for relocation increases and database access is blocked
Solution Approach 1:
The patent uses an intermediary marking state that allows record relocation to proceed independently of pointer updates. By introducing this intermediate state, the system can relocate records more efficiently without requiring immediate synchronization of all pointers, thus improving relocation efficiency while maintaining database access continuity for non-affected operations.
Solution Approach 2:
The patent segments the record relocation process into distinct phases: the physical relocation phase where the record is moved and marked, and the pointer update phase where links are refreshed. This segmentation allows different parts of the system to continue operating independently, improving overall productivity while maintaining ease of operation for ongoing database accesses.
3Stability of the object's composition
If pointer updates are performed during defragmentation, then data structure consistency is maintained, but computational resources and time are excessively consumed
Solution Approach 1:
The patent performs preliminary record relocation before pointer updates during defragmentation. By moving records to their final positions and marking them in advance, the system reduces the scope and complexity of subsequent pointer updates, thereby maintaining data structure consistency while reducing computational resource consumption during the defragmentation process.
Solution Approach 2:
The intermediary marking mechanism allows the system to distinguish between relocated and non-relocated records, enabling optimized pointer update strategies. This intermediary state reduces the computational burden by allowing selective updates only where necessary, rather than forcing comprehensive pointer recalculations across the entire data structure.
Data Source
AI summary
This disclosure provides various techniques that may allow for accessing values stored in a data structure that stores multiple values corresponding to database transactions using a skip list. A key may be used to traverse the skip list to access data associated with the key. The skip list maintains on ordering of multiple keys, each associated with a particular record in the data structure, using indirect links between data records in the data structure that reference buckets included in hash table. Each bucket includes pointers to one or more records in the skip list.