Hierarchical Data Spaces for Probabilistic Encrypted Queries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Relational and non-relational data management systems face inefficiencies in performing operations due to the need to scan entire columns of unsorted values, leading to increased computational overhead and potential security risks when dealing with encrypted data.
Innovation Solution
The system employs hierarchical data spaces with probabilistic operations using hierarchical path identifiers (HPIds) to perform composite operations efficiently, allowing operations to be executed probabilistically before evaluating data by value, thereby reducing computational load and maintaining data security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If relational data management systems scan entire columns of unsorted values to perform operations, then they can retrieve information by comparing or sorting values, but computational overhead increases and processing efficiency decreases
Solution Approach 1:
The patent segments data into hierarchical data spaces with multiple levels of organization. Instead of scanning entire columns, the system divides data into hierarchical path identifier (HPID) based segments that can be selectively accessed. This segmentation allows operations to target only relevant data portions rather than scanning all values in a column.
Solution Approach 2:
The patent applies preliminary action by organizing data into hierarchical structures with HPIDs before operations are performed. Data is pre-grouped and indexed using hierarchical path identifiers that enable quick location of relevant records. This preliminary organization eliminates the need for full column scans during operation execution.
2Reliability
If data is encrypted to maintain security, then data protection is improved, but operational complexity and processing difficulty increase
Solution Approach 1:
The patent introduces hierarchical path identifiers (HPIDs) as intermediaries between the encrypted data and the operation execution engine. HPIDs serve as metadata that guides operations without requiring decryption of the underlying data. This intermediary mechanism allows the system to perform operations on encrypted data by operating on the HPID structure rather than the encrypted values themselves.
Solution Approach 2:
The patent replaces the traditional mechanical approach of decrypting data to perform operations with a metadata-driven approach. Instead of mechanically decrypting and processing encrypted values, the system uses HPID-based routing and filtering to direct operations only to relevant encrypted data portions, substituting complex decryption/processing mechanics with simpler metadata-guided access patterns.
3Measurement precision
If entire columns are scanned to perform operations on unsorted data, then all potential matches can be found, but the time required for operation completion increases
Solution Approach 1:
The patent segments data access into hierarchical levels based on HPIDs. Instead of scanning entire columns, the system segments the search space into manageable hierarchical portions that can be evaluated independently. This allows the system to quickly identify and process only the segments that contain relevant matches, maintaining operation completeness while reducing execution time.
Solution Approach 2:
The patent applies partial action by performing operations only on the necessary portions of data identified through HPID matching, rather than executing operations on entire columns. The system performs exactly the amount of action needed - scanning and processing only those data segments that match the operation criteria, avoiding unnecessary processing of irrelevant data portions.
Data Source
AI summary
Method and apparatus for performing an operation are described. A method includes choosing at least one primary logical hierarchical data space. The at least one primary logical hierarchical data space may have a plurality of subdivisions. The method may further include determining at least one subdivision of the at least one primary logical hierarchical data space. The method may further include choosing at least one secondary logical hierarchical data space. The at least one secondary logical hierarchical data space may have a plurality of subdivisions. The method may further include determining at least one subdivision of the at least one secondary logical hierarchical data space. The method may further include performing at least one operation corresponding to the at least one subdivision of the at least one primary logical hierarchical data space. The method may further include performing at least one operation corresponding to the at least one subdivision of the at least one secondary logical hierarchical data space.


