Index Tree Search Route Adjustment for Concurrent Database Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database indexing methods, particularly B-tree index structures, face performance degradation due to lock contention and low simultaneity when multiple threads operate simultaneously, leading to inefficient data retrieval times and resource consumption.
Innovation Solution
A method that initiates an index search from a root node of an index tree, performs tree searches along connected links, and determines whether to change the search route based on the comparison of target index keys with upper and lower bound keys, allowing for efficient data retrieval by maximizing the use of aligned index keys and reducing the need for lock contention.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a B-tree index structure is used with lock mechanism to maintain index matching when multiple threads operate simultaneously, then index structure integrity is maintained, but operation simultaneity is degraded and system performance is reduced
Solution Approach 1:
The patent extracts the lock mechanism from the index search process, allowing multiple threads to access and search the B-tree index structure simultaneously without contention. This is achieved by making the index structure inherently thread-safe through its design, separating the concern of index integrity from the concern of search operation synchronization.
Solution Approach 2:
The B-tree index structure is designed to be self-protecting against concurrent access issues through its inherent properties. The structure itself provides the necessary guarantees for simultaneous access without requiring external locking mechanisms, allowing each thread to safely navigate and search the index independently.
2Ease of operation
If traditional index search methods are used, then search simplicity is maintained, but data retrieval time increases when dealing with large amounts of data
Solution Approach 1:
The patent segments the index search process into distinct phases: navigating to the target node using the B-tree structure, and then searching within that node. This segmentation allows the efficient B-tree navigation to be combined with the simple linear search within nodes, achieving both speed and simplicity.
Solution Approach 2:
The patent applies different search strategies to different parts of the index structure. The B-tree portion uses efficient hierarchical navigation for getting to the correct node, while the node itself uses simple linear search for finding the specific key. This local optimization of search quality at different levels improves overall performance.
Data Source
AI summary
According to one exemplary embodiment of the present disclosure, disclosed is a computer program stored in a computer readable storage medium. The computer program causes operations for improving data retrieval performance to be performed when the computer program is executed by one or more processors of a computing device, and the operations include: an operation of initiating an index search for retrieving a target index key from a root node of an index tree; an operation of performing an index tree search to a child node along a link connected to the child node; and an operation of reading a currently searched node and determining whether to change an index search route.