Hash-Based Resource Filtering Database Structure
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing resource access filtering systems face challenges in maintaining a compact database structure while ensuring high-speed access and frequent updates, while also protecting security and granularity of filtering categories.
Innovation Solution
A resource access filtering system that includes a generator unit to create a database structure using hashing to divide resource identifiers into hash portions, a filter unit to control access based on category codes, and an updater unit for incremental updates, allowing for efficient and secure access control.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Volume of stationary object
If the database structure is made compact to minimize size, then storage efficiency is improved, but access speed deteriorates
Solution Approach 1:
The database is segmented into multiple tables with hierarchical relationships. The main category table stores broad classifications, while sub-category tables store more specific classifications. This segmentation allows the database to maintain a compact overall structure while enabling fast access through targeted queries that only retrieve necessary portions of the data rather than scanning the entire database.
Solution Approach 2:
The patent introduces a multi-dimensional classification structure with multiple levels of categorization. Resources can be classified along different dimensional hierarchies (e.g., main category → sub-category → specific resource type). This dimensional approach allows the database to organize data compactly while providing multiple access paths for rapid retrieval based on different classification criteria.
2Reliability
If the database is updated frequently to maintain current filtering information, then filtering effectiveness is improved, but system stability deteriorates due to complete rebuilds
Solution Approach 1:
The database structure is designed to be dynamic and adaptable to frequent updates. The hierarchical table structure allows individual records and categories to be added, modified, or removed without requiring restructuring of the entire database. This dynamic design enables frequent updates to maintain current filtering information while preserving overall structural stability.
Solution Approach 2:
The database structure is pre-configured with a flexible hierarchical framework that anticipates future updates and categorization needs. By establishing this preliminary structural foundation, the system can accommodate frequent updates through simple data insertion and modification operations rather than requiring complete rebuilds, thus maintaining both effectiveness and stability.
3Speed
If the database structure is simplified for fast access, then access speed is improved, but security and granularity of filtering categories deteriorate
Solution Approach 1:
The database is segmented into functional modules (main category table, sub-category tables, resource tables) that can be independently queried and maintained. This segmentation allows the system to implement complex security rules and granular filtering categories within each module while maintaining fast access through targeted queries that only access relevant segments rather than the entire database structure.
Data Source
AI summary
A database structure (400) stores data representing a plurality of resource identifiers (200) such as URLs in a computing system. The URLs (200) are each associated with a respective category code (310). Each of resource identifiers (200) is hashed to provide a hash value (300) which is divided into at least first and second hash portions (301, 302). The first hash portions (301) index a main hash array (410) to select a main data block (421) in a main data section (420) holding a set of the second hash portions (302) and the respective category codes (310). For security and compactness, optionally the hash value (300) is further divided to provide a third hash portion (303) which is discarded and is not used to access the database (400). A database generation apparatus, a database search apparatus and a filtering apparatus, a method of creating a database structure and a method of retrieving data from a database structure, and to a computer readable storage medium having a database structure recorded thereon are each described.