Multi-Tenant Database Partition Key Format for Data Access

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing database storage access schemes face challenges in security, cost, latency, and throughput, particularly in adapting to high-volume, multi-tenant, single-table database environments, where efficient data access and security are critical for scalability and performance.

Innovation Solution

A computer-implemented method using a partition key format with a sequence of frames, where the first frame is an entity ID (EID) and the second frame is an item type ID (TID), along with optional additional frames for sub-type ID (SEG) and random number (RND), to efficiently locate and manage data items across partitions in a single table database, enhancing security and reducing latency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If data items are stored in a single table design with traditional addressing schemes, then storage space optimization is achieved, but access speed and latency deteriorate in high-volume multi-tenant environments

Engineering Contradiction:
Improvedata access speedVSAvoidaddressing scheme complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The partition key is segmented into multiple frames (EID frame, TID frame, SEG frame, RND frame) with specific functions. This segmentation allows the system to efficiently route data access requests by processing each frame in sequence, improving access speed while maintaining a structured addressing scheme suitable for single-table designs.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a hierarchical dimension to the addressing scheme by organizing the partition key into nested frames. This multi-dimensional structure (frames within frames) enables efficient data location in high-volume environments without requiring complex external indexing structures.

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

2Reliability

If traditional database access schemes are used, then implementation simplicity is maintained, but security and fine-grained access control deteriorate

Engineering Contradiction:
ImprovesecurityVSAvoidpartition key format complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The partition key is divided into functionally distinct frames where the EID frame identifies the entity, the TID frame identifies the data type, and the SEG frame provides sub-type segmentation. This segmentation enables fine-grained access control by allowing the system to enforce security policies at each frame level, improving security without requiring separate access control mechanisms.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Each frame in the partition key structure has a specific local function and quality. The EID frame handles entity identification and security, the TID frame handles data type routing, and the SEG frame handles sub-type differentiation. This local quality assignment improves security by ensuring that each component performs its specialized function optimally.

Inventive Principle:
Principle #3Local quality

3Loss of time

If data items are distributed across partitions without structured key formats, then throughput may improve, but latency and data location efficiency deteriorate

Engineering Contradiction:
Improvedata location timeVSAvoidpartition key structure complexity
Core Design Contradiction:
Loss of timeVSDevice complexity

Solution Approach 1:

The partition key frames are constructed in a predetermined hierarchical order (EID, TID, SEG, RND) before data storage. This preliminary structuring enables the database system to quickly locate data by processing frames in sequence, reducing data location time while maintaining an organized partition structure that supports efficient throughput.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The nested frame structure adds a hierarchical dimension to partition key organization. By organizing keys into nested frames rather than flat structures, the system enables multi-level indexing and faster data location without sacrificing partition distribution efficiency.

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

4Productivity

If existing NoSQL addressing approaches are used, then scalability is improved, but cost and latency deteriorate in single-table multi-tenant scenarios

Engineering Contradiction:
ImprovethroughputVSAvoidaccess latency
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The segmented partition key structure allows the database to process different frames at different optimization levels. Commonly accessed frames (EID, TID) can be processed quickly for low-latency operations, while less frequent frames (SEG, RND) support high-throughput distribution, enabling the system to achieve both low latency and high productivity simultaneously.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the structural parameters of the partition key from traditional flat formats to a hierarchical frame structure. This parameter change enables the system to optimize for both speed and throughput by allowing different query patterns to utilize different frame levels, reducing access latency while maintaining high productivity in multi-tenant environments.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11789949B2Method and system of performing an operation on a single-table, multi-tenant database and partition key format therefor
Publication Date: 2023.10.17 COMMAND ALKON INC
  • US11789949B2 patent drawing
  • US11789949B2 patent drawing
  • US11789949B2 patent drawing

AI summary

A partition key format for allocating partitions to data items in a single table database, where the data items are owned by different entities. The partition key format including a sequence of a plurality of frames, wherein a first of said frames is an identifier of the requesting entity (EID), and a second one of said frames is an identifier of the type of data item (TID).