Size Bucket Indexing Structure for Database Storage Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing information processing systems face inefficiencies in managing large data sets due to increased storage and computing resource requirements for indexing structures, leading to poor performance in search, update, and retrieval operations.
Innovation Solution
The implementation of a size bucket indexing structure that rounds record sizes to nearest predefined buckets, reducing storage and memory usage while enabling efficient querying by mapping specified record sizes to corresponding buckets.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional indexing structures are used to manage large data sets, then search and retrieval capabilities are provided, but storage and computing resource requirements increase significantly
Solution Approach 1:
The patent segments the indexing structure into multiple index files, where each index file corresponds to a specific data table and contains indexes for that table. This segmentation distributes the indexing load across multiple files rather than using a single monolithic index, reducing the storage and computing resources required for any single index operation while maintaining comprehensive search and retrieval capabilities across all data tables
Solution Approach 2:
The patent introduces a new dimension to traditional indexing by creating index files that are separate from and independent of the data table files. Each index file contains index records that reference data in the corresponding data table, adding a dimensional separation between data storage and index storage. This allows the system to optimize index structures independently from data tables, reducing overall resource requirements while maintaining query efficiency
2Productivity
If indexing structures are expanded to handle more data, then query capabilities are enhanced, but the complexity of the indexing structure increases
Solution Approach 1:
The patent divides the indexing structure into multiple segmentable index files, each handling a specific data table. This segmentation allows the system to process queries by accessing only relevant index files rather than searching through a single complex monolithic index, improving query processing efficiency while keeping individual index files manageable in complexity
Solution Approach 2:
The patent performs preliminary indexing actions by pre-processing data and creating index records before queries are executed. Index files are generated in advance with organized index records that can be quickly accessed during query processing, eliminating the need for complex real-time index construction during query execution and simplifying the overall indexing structure
Data Source
AI summary
A method includes determining a set of sizes for size bucket indexes of an indexing structure, and indexing a plurality of records into the size bucket indexes. The indexing comprises, for a given record, rounding a size of the given record to a nearest one of the determined set of sizes and placing the given record in a size bucket index associated with the nearest one of the determined set of sizes. The method also includes receiving one or more queries to the plurality of records, a given one of the queries specifying a record size. The method further includes processing the given query utilizing the indexing structure by mapping the specified record size to at least a given one of the size bucket indexes and returning one or more records from the given size bucket index.