Teradata has been granted a patent for an improved hash table structure that enhances cache efficiency during hash join processing in a relational database system. The structure, residing in processor memory, includes a first partition with a join condition column for joining a small table with a large table, additional partitions with more join condition columns, and an array of hash values for indexing into the partitions. GlobalData’s report on Teradata gives a 360-degree view of the company including its patenting strategy. Buy the report here.
According to GlobalData’s company profile on Teradata, Zero Knowledge Proof was a key innovation area identified from patents. Teradata's grant share as of September 2023 was 76%. Grant share is based on the ratio of number of grants to total number of patents.
Improved hash table structure for efficient hash join processing

A recently granted patent (Publication Number: US11775523B2) describes a computer processor memory that includes a hash table for use in joining a small table and large table in a relational database system. The hash table consists of multiple partitions, including a first partition containing a join condition column from the small table and at least one additional partition containing additional join condition columns. The hash table also includes an array of hash values that provide an index into the partitions.
According to the patent, the first join condition column in the hash table has a fixed length and provides the best selectivity for joining the small table with the large table. This means that it is the most effective column for performing the join operation. Additionally, the hash table includes at least one additional partition, which includes a second partition with fixed length join condition columns and a third partition with variable length join condition columns.
The partitions in the hash table are arranged in an array and organized into bucket rows, with each bucket row corresponding to one of the hash values. This organization allows for efficient storage and retrieval of data during the join operation. The hash table also includes a probe bitmap that is indexed to the hash values and indicates the presence of data associated with those hash values in the hash table.
In a distributed relational database system, the computer processor memory with the hash table includes an array of hash values and a cache segment array that contains data from the small table. The partitions in the cache segment array are organized into bucket rows and include the join condition columns, additional fixed length join condition columns, and columns from projection and remaining columns in the join condition. This allows for efficient joining of the small table and large table in the distributed database.
Overall, this granted patent describes a computer processor memory with a hash table that improves the efficiency of joining a small table and large table in a relational database system. The use of partitions, hash values, and a probe bitmap allows for optimized storage and retrieval of data during the join operation. Additionally, the patent extends the concept to a distributed relational database system, further enhancing the efficiency of the join process.
To know more about GlobalData’s detailed insights on Teradata, buy the report here.
Data Insights
From
The gold standard of business intelligence.
Blending expert knowledge with cutting-edge technology, GlobalData’s unrivalled proprietary data will enable you to decode what’s happening in your market. You can make better informed decisions and gain a future-proof advantage over your competitors.