Database Security Policy Management via Fast Traverse Block Indexing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current security systems for databases face inefficiencies in managing large numbers of security policies, leading to increased traversal time and resource consumption due to the need to traverse multiple B-trees for index entry retrieval, which can impact the effectiveness of time-sensitive security systems.
Innovation Solution
The creation of a fast traverse block (FTB) associated with index tables, which stores a copy of non-leaf data in a CPU-level2 index structure, reducing the need to load unrelated pages into the buffer pool and allowing for faster retrieval of index entries by grouping similar items together, thus decreasing traversal time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple B-trees are used to store and retrieve index entries for security policies, then the security system can manage multiple security policies, but the traversal time and resource consumption increase
Solution Approach 1:
The patent combines multiple B-tree index structures into a single flat hash table structure. Instead of maintaining separate B-trees for different security policies, all index entries are stored in one unified hash table, eliminating the need to traverse multiple tree structures and reducing traversal time while maintaining the ability to manage multiple security policies.
Solution Approach 2:
The patent creates a copy of the index entries in a optimized flat hash table structure. The original B-tree structures are preserved for security policy management, while a copied flat structure is used for fast traversal during security judgments, allowing simultaneous maintenance of policy versatility and fast retrieval.
2Reliability
If multiple B-trees are traversed to retrieve index entries, then all security policies can be checked, but the resource consumption increases
Solution Approach 1:
The patent merges multiple B-tree index entries into a single flat hash table, consolidating the data structure that needs to be traversed. This reduces the computational resources required for traversal while maintaining complete coverage of all security policies through the unified structure.
Solution Approach 2:
The patent replaces the mechanical B-tree traversal mechanism with a hash-based direct access mechanism. Instead of following tree paths and comparing keys sequentially, the system uses hash functions to directly compute and access the required index entries, significantly reducing computational overhead and resource consumption.
3Ease of operation
If B-tree structures are used for index entry storage, then the data can be organized, but the traversal complexity increases
Solution Approach 1:
The patent substitutes the B-tree mechanical traversal structure with a hash table direct-access structure. The hash function automatically organizes data by computing bucket locations from key values, eliminating the need for complex tree traversal logic while maintaining effective data organization through hash-based grouping.
Solution Approach 2:
The patent copies index entries from the B-tree structure into a flat hash table format. This copied structure maintains the organizational benefits of indexed data while removing the traversal complexity of tree structures, allowing simple direct access to any index entry through hash computation.
Data Source
AI summary
In an approach, a processor obtains a plurality of security policies for managing security of a database, the security policies defining respective sets of items to be monitored. A processor stores, respectively, the sets of items defined by the plurality of security policies in one or more item tables based on a predetermined criterion, the predetermined criterion comprising security policy relevance, security policy structure, and available space in the one or more item tables. A processor creates, for each of the one or more item tables, one or more respective index tables associated with the items in the respective item table. A processor creates, for each of the one or more item tables, a fast traverse block (FTB) associated with the created one or more respective index tables.