Non-Relational Database Schema Generation via Key Relationship Grouping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database technologies, particularly relational databases, face challenges in handling high-concurrency and scalability demands, and lack the ability to integrate with non-relational databases due to the absence of a schema, hindering data matching, integration, and exchange processes.
Innovation Solution
A method and apparatus for generating a schema in non-relational databases by determining relationships among keys, grouping them, and creating a schema based on these groups, facilitating data processing across relational and non-relational databases.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If non-relational databases use key/value pair storage with flexible structures, then storage efficiency and scalability are improved, but the ability to perform data matching, integration, and exchange is lost
Solution Approach 1:
The patent introduces a schema generation system as an intermediary layer between the non-relational database and data processing operations. The system extracts keys from key/value pairs, determines their relationships, groups them into schemas, and generates structured representations that enable data matching, integration, and exchange while preserving the underlying flexible storage structure.
Solution Approach 2:
The patent segments the data processing task into distinct phases: extracting keys from key/value pairs, determining relationships among keys, grouping keys into schemas, and generating the final schema representation. This segmentation allows each phase to be optimized independently while working together to solve the overall problem.
2Ease of manufacture
If relational databases use fixed table structures, then data processing and integration are straightforward, but performance and scalability under high concurrency are limited
Solution Approach 1:
The patent changes the structural parameter of the database from fixed relational tables to flexible key/value pairs, allowing the schema to be dynamically generated from the data itself rather than imposed beforehand. This parameter change enables both high scalability and effective data processing capabilities.
3Quantity of substance
If no schema is used in non-relational databases, then storage overhead is reduced and flexibility is increased, but schema-based processing operations become impossible
Solution Approach 1:
The patent performs preliminary action by extracting keys from key/value pairs and determining their relationships before the actual data processing operations. This preliminary schema generation creates the necessary structure in advance, enabling subsequent data matching, integration, and exchange operations to proceed efficiently without requiring a pre-defined schema.
Data Source
AI summary
Embodiments of the present invention disclose a method and apparatus for generating a schema of a non-relational database. In the embodiments of the present invention, relationship among keys in at least one entry of a non-relational database may be determined, the keys may be grouped into at least one group based on the determined relationship, and a schema of the non-relational database may be generated according to the at least one group.