Timeline Index Partitioning for Temporal Database Performance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current computing systems lack effective support for temporal operators, leading to increased complexity and scalability issues when handling large data sets, as developers often resort to custom approaches that are not maintainable.
Innovation Solution
Implementing a method that uses a database table timeline index represented as a plurality of partial timeline indexes associated with partitions of a temporal database table, allowing for parallel calculation and combination of partial results to generate a global result for temporal operators.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If developers create custom approaches to handle temporal operators on large data sets, then they can process temporal data, but the system complexity and development complexity increase
Solution Approach 1:
The patent segments the timeline index into multiple partial timeline indexes, each associated with a partition of the temporal database table. This allows the system to handle large datasets by processing partitions independently, reducing the complexity of any single index while maintaining comprehensive temporal operator support across the entire dataset.
2Adaptability or versatility
If developers create custom approaches for temporal operators, then temporal processing is enabled, but scalability and maintainability deteriorate
Solution Approach 1:
The patent implements a universal timeline index structure that can be applied to any temporal database table regardless of its specific schema or data characteristics. The standardized structure of partial timeline indexes with their associated partitions provides a maintainable, reusable pattern that improves ease of manufacture while supporting diverse temporal operator requirements.
3Adaptability or versatility
If a single timeline index is used for the entire temporal database table, then temporal operations can be performed, but processing performance on large data sets deteriorates
Solution Approach 1:
The patent divides the timeline index into multiple partial timeline indexes corresponding to different partitions of the temporal database table. This segmentation enables parallel processing of temporal operations across multiple partitions, significantly improving processing performance on large datasets while maintaining comprehensive temporal operator support.
Solution Approach 2:
Instead of processing the entire timeline index at once, the patent applies partial action by processing only the relevant partitions containing data for the requested time period. This selective processing of partial data subsets improves performance by reducing the amount of data that needs to be scanned and processed for each temporal operation.
Data Source
AI summary
Partitioning of temporal databases can implement distributed storage of temporal data via time-based or space-based techniques to improve performance of operators on the database. A variety of operators can be supported for the partitioned tables, including temporal aggregation, time travel, and temporal join. The use of checkpoints can greatly increase performance in a variety of scenarios. The described partitioning techniques can be applied in a parallel execution context to great benefit. The partitioning can also reduce local memory footprint, facilitating in-memory database processing.