Database Permission Schemas With Priority Merging for Query Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database systems face challenges in scalability, memory requirements, and inefficient data access due to group-based permission systems, which become exponentially complex and slow down operations in large-scale databases, especially when managing complex relationships and permissions.
Innovation Solution
A flexible data permission schema that allows access rights to be defined at various levels of data units, with priority-based merging of permission schemas to override conflicts, and a connection-oriented RDBMS that distributes data across compute resources, enabling efficient data access and analysis.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If group-based permission systems are used to manage database access, then access control is implemented, but system complexity increases exponentially and performance deteriorates in large-scale databases
Solution Approach 1:
The patent segments the permission system into multiple independent permission schemas, where each schema defines a specific set of access rights for different data units. Instead of using a monolithic group-based system, the permission definitions are divided into separate, manageable schemas that can be independently evaluated and merged, reducing the exponential complexity growth in large-scale databases.
Solution Approach 2:
The patent implements dynamic permission schema merging at query execution time based on priority rules. The system dynamically determines which permission schemas apply to each user and merges them according to defined priority relationships, allowing the permission evaluation process to adapt to different users and contexts without pre-computing all possible group combinations, thus reducing system complexity.
2Reliability
If group-based permission systems are used to manage database access, then access control is implemented, but query performance deteriorates due to exponential complexity
Solution Approach 1:
The patent performs preliminary actions by pre-defining permission schemas and their priority relationships in advance. During query execution, the system only needs to retrieve and merge the relevant pre-defined schemas based on user context, rather than evaluating all possible group combinations in real-time. This preliminary structuring of permission information significantly improves query performance while maintaining access control.
Solution Approach 2:
The patent changes the parameter of permission evaluation from group-based hierarchical checking to schema-based priority merging. By transforming the permission system into a set of parameterized schemas with explicit priority rules, the system achieves polynomial-time complexity for permission evaluation instead of exponential complexity, thereby improving query performance in large-scale databases.
3Reliability
If traditional database modification approaches are used, then data integrity is maintained, but service interruptions occur during schema changes
Solution Approach 1:
The patent implements periodic action by applying permission schemas at discrete query execution points rather than maintaining continuous locks during schema modifications. The system periodically evaluates which permission schemas apply to each user context and merges them on-demand, allowing schema changes to be made without requiring continuous service interruption, thus maintaining both data integrity and service availability.
4Reliability
If permission schemas are applied at query execution, then data access security is maintained, but processing overhead increases
Solution Approach 1:
The patent merges multiple permission schemas into a single effective permission set using priority-based conflict resolution rules. Instead of evaluating each permission schema separately for every query, the system merges the relevant schemas in advance based on user context and priority relationships, then applies the merged result. This merging operation reduces the total processing overhead while maintaining security by ensuring all applicable permissions are considered.
Data Source
AI summary
The present disclosure provides a computer-implemented method for applying access rights to a database comprising a plurality of data units. The method may comprise receiving a request from a user to perform an operation directed to at least a subset of data objects stored in the database. Next, access rights associated with the user may be determined. The access rights may comprise an access permission to a subset of one or more of the data units that is implemented by performing a filter operation. The operation and the filter operation may then be performed concurrently to the at least subset of data objects to obtain a filtered data set.