Composite Key Querying in Multi-Tenant Non-Relational Databases
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Multi-tenant non-relational database systems lack an efficient method for customers to define and manage composite keys across shared tables, leading to limitations in querying and data retrieval, particularly in real-time scenarios with large datasets.
Innovation Solution
The system allows organizations to define composite keys for platform objects within a multi-tenant non-relational database environment, generating metadata models and data definition scripts that map these objects to the underlying database, enabling efficient querying and data retrieval through APIs and dynamic provisioning of access rights.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional multi-tenant database systems are used with shared tables, then data storage efficiency is improved, but querying and data retrieval efficiency deteriorates due to lack of composite key support
Solution Approach 1:
The patent segments the key structure into multiple fields (first key field, second key field, etc.) that can be independently defined and queried. This segmentation allows the system to maintain efficient storage in shared tables while enabling targeted queries on specific key segments, thus resolving the contradiction between storage efficiency and query efficiency.
Solution Approach 2:
The patent adds a dimensional layer to the key structure by introducing composite keys with multiple fields. This transforms the traditional single-dimension key into a multi-dimensional key space, allowing efficient querying across different dimensions while maintaining the underlying shared table structure for storage efficiency.
2Speed
If composite keys are implemented in multi-tenant non-relational databases, then data retrieval speed is improved, but system complexity increases
Solution Approach 1:
The patent implements a universal composite key mechanism that works across multiple tenants and data types in the non-relational database. This multi-functional approach allows the same composite key structure to serve different querying needs and data organization requirements, improving retrieval speed without proportionally increasing system complexity.
Solution Approach 2:
The patent introduces an intermediary layer (the composite key structure with multiple fields) that mediates between the simple storage model and complex querying requirements. This intermediary enables efficient data retrieval by providing structured access paths without fundamentally altering the underlying simple storage architecture.
3Ease of operation
If run-time querying is enabled for multi-tenant objects, then data accessibility is improved, but operational costs increase
Solution Approach 1:
The patent performs preliminary organization of data using composite keys during data insertion and update operations. This preliminary structuring enables efficient run-time querying without requiring expensive full-table scans or complex processing during query execution, thus improving data accessibility while controlling operational costs.
Solution Approach 2:
The composite key structure enables the database system to self-optimize query execution by automatically utilizing the defined key fields for data location and retrieval. This self-service capability reduces the need for expensive external query optimization and improves accessibility while maintaining cost efficiency.
Data Source
AI summary
Disclosed are examples of systems, apparatus, methods and computer program products for providing run-time querying of multi-tenant non-relational database objects. A database system maintains a multi-tenant non-relational database associated with a number of enterprises, a number of records, and a number of data objects for each of the enterprises, each data object having at least one composite key field. A request is received during runtime to query data related to a data object, and the system determines that the data object is defined to be used in associated with a non-relational database. The system then retrieves a metadata model of the data object, determines that the request includes at least one composite key field for the data object, and processes the requery to query data in synchronous fashion. Finally, a query response is provided to the user.