17847146. COMPUTING RESOURCE CONSERVATION WITH BALANCED TRAVERSALS AND PRECOMPUTATIONS FOR CONNECTED DATA SETS simplified abstract (Microsoft Technology Licensing, LLC)
Contents
- 1 COMPUTING RESOURCE CONSERVATION WITH BALANCED TRAVERSALS AND PRECOMPUTATIONS FOR CONNECTED DATA SETS
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 COMPUTING RESOURCE CONSERVATION WITH BALANCED TRAVERSALS AND PRECOMPUTATIONS FOR CONNECTED DATA SETS - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Original Abstract Submitted
COMPUTING RESOURCE CONSERVATION WITH BALANCED TRAVERSALS AND PRECOMPUTATIONS FOR CONNECTED DATA SETS
Organization Name
Microsoft Technology Licensing, LLC
Inventor(s)
Anders Tungeland Gjerdrum of Tromso (NO)
Jan-Ove Karlberg of Tromso (NO)
COMPUTING RESOURCE CONSERVATION WITH BALANCED TRAVERSALS AND PRECOMPUTATIONS FOR CONNECTED DATA SETS - A simplified explanation of the abstract
This abstract first appeared for US patent application 17847146 titled 'COMPUTING RESOURCE CONSERVATION WITH BALANCED TRAVERSALS AND PRECOMPUTATIONS FOR CONNECTED DATA SETS
Simplified Explanation
The patent application describes a solution for balancing traversals and precomputations for connected data sets with access control. It introduces a process that starts with the highest hierarchy tier of a request and traverses the current hierarchy tier laterally. At each node, it determines if the requested operation is permitted. If not, the node and its subtree are omitted, and the recursion halts for that branch. If permitted, the node is included in the cumulative result, and the recursion continues to lower hierarchy tiers. Some examples utilize precomputed aggregates to avoid traversing branches with aggregates.
- The solution balances traversals and precomputations for connected data sets with access control.
- It starts with the highest hierarchy tier of a request and traverses laterally.
- It determines if the requested operation is permitted at each node.
- Nodes and their subtrees are omitted if the operation is not permitted.
- Nodes are included in the cumulative result if the operation is permitted.
- Precomputed aggregates are used to avoid traversing branches with aggregates.
Potential Applications
This technology can be applied in various domains where connected data sets with access control are involved, such as:
- Social media platforms
- Enterprise resource planning systems
- Healthcare information systems
- Financial systems
- Supply chain management systems
Problems Solved
The technology solves the following problems:
- Balancing traversals and precomputations for connected data sets
- Ensuring access control for commutative operations
- Efficiently omitting nodes and subtrees that are not permitted
- Leveraging precomputed aggregates to optimize traversal
Benefits
The technology offers the following benefits:
- Improved performance by balancing traversals and precomputations
- Enhanced security by enforcing access control for commutative operations
- Efficient processing by omitting unnecessary nodes and subtrees
- Optimization through the use of precomputed aggregates
Original Abstract Submitted
Example solutions balance traversals and precomputations for connected data sets subject to access control. When a request for a commutative operation on a connected data set is received, a downwardly recursive process starts with the current hierarchy tier set to a highest hierarchy tier of the request. The process traverses the current hierarchy tier laterally. At each discovered node in the current hierarchy tier, a determination is made whether the requested operation is permitted to include a discovered node. If not, that node and any nodes hierarchically below it are omitted from the operation. That node and its subtree are skipped and the recursion halts for that branch. If, however, the requested operation is permitted to include the node, it is incorporated into the cumulative result and the recursion continues while there remains a lower hierarchy tier. Some examples leverage precomputed aggregates to avoid traversing branches having aggregates.
