Non-Relational Database Storage Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Non-relational databases face data redundancy issues and inefficient query processing due to the need for multiple tables to separate static and dynamic data, which increases storage requirements and communication overhead in distributed environments.

Innovation Solution

A method and system for data storage in non-relational databases that categorize data into static and dynamic sections within a single table, using pre-defined string-type row keys to store static data in a static data storage area and dynamic data in a dynamic data storage area, reducing redundancy and optimizing query processing by eliminating the need for multiple tables and minimizing master-slave communication.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If data items are stored in a single table without separation, then query processing is simpler and communication overhead is reduced, but data redundancy increases significantly

Engineering Contradiction:
Improvequery processing efficiencyVSAvoiddata storage redundancy
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The patent segments data items into static data sections (province name, city name, station name) and dynamic data sections (PM2.5 values, timestamps). Static sections are stored once in a static data storage area, while dynamic sections are stored in a dynamic data storage area, eliminating redundancy while maintaining query efficiency through a unified table interface.

Inventive Principle:
Principle #1Segmentation

2Quantity of substance

If static and dynamic data are separated into two tables, then data redundancy is reduced, but device complexity and communication overhead increase

Engineering Contradiction:
Improvedata storage redundancyVSAvoidtable structure complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent merges the static data storage area and dynamic data storage area into a single unified table structure. This allows the system to enjoy the redundancy-reduction benefits of data separation while maintaining the simplicity of a single table interface, eliminating the need for complex multi-table joins and reducing communication overhead in distributed environments.

Inventive Principle:
Principle #5Merging (Combining)

3Adaptability or versatility

If data is stored in multiple tables with connections, then data organization becomes more structured, but communication between master and slave nodes increases

Engineering Contradiction:
Improvedata organization structureVSAvoidcommunication overhead
Core Design Contradiction:
Adaptability or versatilityVSLoss of energy

Solution Approach 1:

The patent introduces a new dimensional organization within a single table by creating distinct storage areas (static and dynamic) that are logically separated but physically unified. This allows structured data organization without requiring multiple physical tables, thereby reducing inter-node communication overhead in distributed database systems while maintaining data structure integrity.

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

Data Source

PatentUS10552394B2Data storage with improved efficiency
Publication Date: 2020.02.04 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US10552394B2 patent drawing
  • US10552394B2 patent drawing
  • US10552394B2 patent drawing

AI summary

This disclosure provides a computer-implemented method for data storage in a non-relational database. The method comprises receiving a data item to be inserted into a table in the non-relational database. The method further comprises determining a dynamic data section and a static data section of the received data item. The method further comprises in response to the static data section not existing in the static data storage area, storing the static data section in the static data storage area. The method further comprises storing the dynamic data section in the dynamic data storage area.