Database Index Node Reuse via Invalid Marking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing database index rebuilding process is time-consuming and resource-intensive, especially during data refreshing, where all data entries are deleted and reinserted, leading to significant performance degradation and increased workloads.
Innovation Solution
The method involves reusing the existing index by marking nodes associated with deleted data entries as invalid and updating them with new data entry information, reducing the need to rebuild the entire index from scratch.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all data entries are deleted and new data entries are inserted during database refresh, then the database can be updated with new data, but the index must be rebuilt from scratch which is time-consuming and requires extra computing resources
Solution Approach 1:
The patent recovers and reuses the existing index structure after data deletion instead of discarding it entirely. The index nodes are marked as invalid but the overall index framework is preserved and reused when new data is inserted, avoiding the need to rebuild the entire index from scratch
Solution Approach 2:
The patent performs preliminary marking of index nodes as invalid during the data deletion phase, so that when new data is inserted, the index structure is already prepared and can be efficiently updated without requiring complete reconstruction
2Reliability
If all data entries are deleted and new data entries are inserted during database refresh, then the database can be updated with new data, but a new index must be built which needs extra computing resources
Solution Approach 1:
The patent recovers and reuses the existing index structure after data deletion instead of discarding it entirely. The index nodes are marked as invalid but the overall index framework is preserved and reused when new data is inserted, avoiding the need to rebuild the entire index from scratch
Solution Approach 2:
The patent copies and reuses the existing index node structure rather than creating new index nodes from scratch. The invalid markers are applied to existing nodes which are then reused with new data associations, reducing computational overhead
3Stability of the object's composition
If the index is deleted together with data entries during the deleting procedure, then the index remains consistent with the database state, but a new index must be built during inserting new data entries which is time-consuming
Solution Approach 1:
The patent recovers and reuses the existing index structure after data deletion instead of discarding it entirely. The index nodes are marked as invalid but the overall index framework is preserved and reused when new data is inserted, avoiding the need to rebuild the entire index from scratch
Solution Approach 2:
The patent dynamically transitions index nodes from a valid state to an invalid state during deletion, rather than statically deleting the entire index structure. This dynamic state change allows for efficient recovery and reuse of the index framework during subsequent insertion operations
Data Source
AI summary
Embodiments of the present invention provide computer-implemented methods, computer systems and computer program products. According to one embodiment of the present invention, an index of a database is obtained, where the index includes at least one node associated with index information of at least one old data entry that has been deleted from the database, and the node is marked as invalid. Then, a node included in the index is selected based on a key value in index information of a new data entry in response to the new data entry being inserted into the database. Next, the selected node is updated with the index information of the new data entry.