Indexed Data Locking for Compact Multi-Dimensional Access Control

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data locking mechanisms in database management systems are resource-intensive and inefficient, requiring significant computing resources and time, while also failing to effectively manage data access privileges.

Innovation Solution

A data locking mechanism that assigns indices to dataset members and stores lock states as combinations of these indices, reducing storage requirements by using index tables and locks tables to efficiently manage access control.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional data locking mechanisms are implemented in database management systems, then data access control is provided, but computing resources and time are excessively consumed

Engineering Contradiction:
Improvedata access controlVSAvoidcomputing resource efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent segments the data locking mechanism by separating index management from data storage. Index tables store unique index values while locks tables store lock states, dividing the traditional monolithic locking system into modular components that can be managed independently, reducing overall system resource consumption.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent creates index copies of data elements to enable efficient locking operations. By storing index values in separate index tables rather than managing full data structures, the system uses lightweight copies that consume minimal resources while maintaining the ability to control data access effectively.

Inventive Principle:
Principle #26Copying

2Reliability

If data locking mechanisms use traditional storage methods, then lock states are maintained, but storage requirements are excessive due to redundant data

Engineering Contradiction:
Improvelock state managementVSAvoidstorage requirements
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent extracts the index information from the main data storage structure and places it in separate index tables. This extraction eliminates redundancy by storing only the essential indexing information needed for locking operations, significantly reducing storage requirements while maintaining complete lock state management capability.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent introduces a new dimensional organization by creating separate index tables and locks tables that organize data in a multi-dimensional structure. Instead of storing all locking information in a single flat structure, the system uses multiple dimensions (index tables for unique values, locks tables for states) to achieve compact storage.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS12499103B2Data locking
Publication Date: 2025.12.16 SAP SE
  • US12499103B2 patent drawing
  • US12499103B2 patent drawing
  • US12499103B2 patent drawing

AI summary

A system and method to query, update, and reduce a size of locking data for a dataset including a fixed plurality of dimensions each having a fixed plurality of members comprising index tables for the dimensions and a locks table specifying one of a fixed plurality of lock states for the plurality of members, where the fixed plurality of members each have an associated index.