Cascade Data Structure for Multidimensional Indexing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Multidimensional databases face challenges in indexing composite keys efficiently and evenly distributing data across nodes in distributed systems, leading to performance issues during ad-hoc query workloads.
Innovation Solution
The implementation of a cascade data structure that indexes composite keys using affixation, allowing for efficient organization and distribution of multidimensional data by clustering points from the same fundamental domain and using space-filling curves to transform queries into pattern search problems.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If multidimensional data is indexed using traditional multidimensional indices or space-filling curves, then query performance is improved, but data distribution across nodes becomes uneven
Solution Approach 1:
The patent segments the multidimensional space into fundamental domains using space-filling curves, where each domain corresponds to a unique affixation prefix. This segmentation allows data to be partitioned and distributed across multiple nodes in a distributed system while maintaining efficient query performance through prefix-based indexing.
Solution Approach 2:
The patent transforms the multidimensional data indexing problem into a one-dimensional problem by applying space-filling curves that map multidimensional points to scalar values with unique affixation prefixes. This dimensionality transformation enables efficient prefix-based indexing and balanced data distribution across distributed nodes.
2Speed
If data is organized in query-specific way, then query performance is improved, but ad-hoc query flexibility is reduced
Solution Approach 1:
The patent creates a universal indexing structure based on affixation prefixes that works efficiently for all types of queries including ad-hoc queries. The prefix-based organization allows the same index structure to serve multiple query patterns without requiring query-specific reorganization, thereby maintaining both performance and flexibility.
Solution Approach 2:
The patent performs preliminary organization of data using space-filling curves and affixation prefixes during the indexing phase, creating a structure that automatically adapts to various query types. This preliminary organization eliminates the need for query-specific data reorganization while maintaining efficient query performance across different workload types.
3Ease of manufacture
If composite keys are indexed using existing methods, then indexing capability is provided, but indexing complexity and time increase
Solution Approach 1:
The patent extracts the affixation prefix from the composite key generated by space-filling curves and uses it as the indexing structure. By taking out and utilizing only the prefix portion, the system achieves efficient indexing without the complexity of organizing complete composite keys, reducing both indexing time and structural complexity.
Solution Approach 2:
The patent creates a simplified copy of the composite key structure by using only the affixation prefix for indexing purposes. This copied prefix structure provides sufficient indexing capability while dramatically reducing the complexity compared to indexing complete composite keys, enabling scalable distributed implementation.
Data Source
AI summary
The present invention extends to methods, systems, devices, and computer program products that advantageously provide for indexing composite keys (i.e., keys for space-filling curve) of multidimensional data storages into the form of an affixation tree or trie. More specifically, example embodiments provide for the organization or indexing of records of multidimensional data into instances (or partitions) of a “cascade” data structure augmented by a key affixation—i.e., a predetermined series or string of bits or bytes that appear before, after, and/or within a designated bit stream or composite key.