NoSQL Database Querying via Segmented Table Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Database systems face challenges in handling large data sets, experiencing performance penalties and decreased throughput as data size increases, and struggle to provide robust query capabilities while avoiding record conflicts.
Innovation Solution
The implementation of a NoSQL database system that uses multiple tables with designated hash keys and range keys to enable flexible querying based on multiple indices, allowing for efficient data retrieval and conflict handling through the creation of secondary tables and index-based querying.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional database systems are used to maintain large data sets, then data storage capability is provided, but performance penalties and decreased throughput occur as data size increases
Solution Approach 1:
The patent divides the data storage system into multiple tables with different purposes. Each table is optimized for specific query patterns, allowing the system to handle large data sets by querying only relevant tables rather than scanning entire data sets. This segmentation enables maintaining large quantities of data while preserving high throughput for targeted queries.
2Quantity of substance
If traditional database systems handle large data sets, then data storage is provided, but computational cost of queries and updates increases
Solution Approach 1:
The patent creates different table structures with different qualities optimized for specific operations. Some tables are optimized for read operations with pre-computed indices, while others are optimized for write operations. This local quality optimization allows the system to handle large data sets with reduced computational cost by using the appropriate table structure for each operation type.
3Adaptability or versatility
If robust query capability is provided on large data sets, then data retrieval is enabled, but record conflicts arise during updates
Solution Approach 1:
The patent segments data into multiple tables with clear ownership and update responsibilities. By dividing the data model, the system reduces the likelihood of concurrent updates to the same data, thereby minimizing record conflicts. Each table can be optimized for its specific query patterns while maintaining update reliability.
4Quantity of substance
If database systems are scaled to handle larger data sets, then data storage capacity increases, but performance penalties occur
Solution Approach 1:
The patent implements a segmented table structure where data is divided into multiple optimized tables. This allows the system to scale storage capacity by adding more tables rather than expanding a single monolithic table, thereby maintaining query performance as data volume increases.
Solution Approach 2:
The patent employs pre-computed indices and pre-organized data structures in each table that enable fast query execution. This preliminary action of organizing data during insertion allows for rapid retrieval operations even as the overall data set grows, preventing performance penalties during scaling.
Data Source
AI summary
A method and apparatus for facilitating data set query is disclosed. In the method and apparatus one or more tables may be created for the data set, whereby each table of the one or more tables may enable searching the data set using one or more records that are associated with one or more indices of the data set. Upon receiving a request to search the data set, a table of the one or more table is identified based at least in part on the one or more bases for query and is searched to provide a yielded record.