Indexing Numerical Ranges for Efficient Data Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database systems require decompressing and loading entire data files to search for records within a specific time range, even if the range is small, leading to inefficiencies in storage and query processing.
Innovation Solution
The system generates numerical ranges for time-based attributes and stores entries in an index that include a first index key corresponding to a value and a second index key corresponding to the range, allowing for efficient searching and reducing the need to decompress and load unnecessary records.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the entire data file is decompressed and loaded into memory for searching, then all records become accessible for querying, but the storage efficiency decreases and the query processing time increases
Solution Approach 1:
The patent divides the data storage into two distinct segments: a compressed storage area where records are kept in compressed format, and an index structure that contains pre-computed numerical range information. This segmentation allows the system to avoid decompressing the entire data file by using the index to directly locate relevant records, thus improving query processing speed while reducing computational resource consumption.
Solution Approach 2:
The patent performs preliminary actions by pre-computing and storing numerical ranges for time-based attributes during the indexing phase. These pre-computed ranges are stored in the index structure, enabling the system to quickly determine which records fall within a queried time range without having to decompress and examine each record individually during query processing.
2Quantity of substance
If records are stored in compressed format, then storage space is reduced, but the time required to access and process records increases
Solution Approach 1:
The patent introduces an index structure as an intermediary between the compressed storage and the query processing system. This index contains numerical range information that mediates the access process by identifying which compressed records need to be decompressed and processed, thereby reducing the overall access time while maintaining compressed storage format.
Solution Approach 2:
The system performs preliminary actions by pre-computing numerical ranges for time-based attributes and storing them in the index structure. This preliminary processing enables rapid identification of relevant records during query operations, offsetting the time cost of maintaining compressed storage format.
3Productivity
If numerical ranges are pre-computed and stored in the index, then query efficiency improves, but the index size and complexity increase
Solution Approach 1:
The patent transforms time-based attributes into numerical ranges by applying parameter changes (converting time values into range identifiers). This transformation simplifies the query process by allowing direct numerical comparison rather than time-based filtering, improving query efficiency while managing index complexity through systematic parameter transformation.
Data Source
Figure 1
Figure 2A
Figure 2B
AI summary
In general, a value of a numerical attribute of a record stored in a data structure is received. A numerical range is generated that includes the value of the numerical attribute. An entry is stored, in an index (204)associated with the data structure, that specifies a location of the record within the data structure and that includes a first index key (1006) and a second index key (1008). The first index key (1006) corresponds to a value of an attribute of the record different from the numerical attribute, and the second index key (1008) corresponds to the generated numerical range.