Database Table Joining via Range Group Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Joining database tables keyed by value ranges is computationally expensive due to the inefficiency of comparing every record from one table to every record in another, especially when keys do not match.

Innovation Solution

Assigning records to corresponding range groups based on their network address ranges, segmenting overlapping records, and executing full and partial overlap segmentation processes to identify parent and child records, thereby reducing the need for extensive comparisons and conserving computing resources.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If every record from one table is compared to every record in another table, then complete join results are obtained, but computing resources and time are excessively consumed

Engineering Contradiction:
Improvejoin completenessVSAvoidjoin processing efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent segments the join operation by dividing records into range groups based on their key values. Records are assigned to specific range groups (e.g., IP address ranges, date ranges) and only compared within their respective groups, eliminating the need to compare every record against every other record while maintaining join completeness.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces range groups as intermediary structures that mediate between the two tables. These range groups act as filtering mechanisms that determine which records should be compared, reducing the comparison space from all possible record pairs to only relevant pairs within the same range group.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Productivity

If records are assigned to range groups and segmented, then computing resources are reduced, but the complexity of the joining process increases

Engineering Contradiction:
Improvecomputing resource efficiencyVSAvoidjoin process complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent performs preliminary actions by pre-defining range groups and pre-assigning records to their appropriate groups before the actual join operation. This preparation step, while adding initial complexity, significantly simplifies the main join process by eliminating the need for complex pairwise comparisons and reduces computing resources required during execution.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10706050B2Distributed joining of database tables that are keyed by value ranges
Publication Date: 2020.07.07 PAYPAL INC
  • US10706050B2 patent drawing
  • US10706050B2 patent drawing
  • US10706050B2 patent drawing

AI summary

A method is provided that includes assigning one or more first records of a first table and one or more second records of a second table to corresponding range groups of a plurality of range groups. The method further includes comparing at least one record of the first table with at least one record of the second table, where the at least one record of the first table and the at least one record of the second table are assigned to a first range group of the plurality of range groups. The method also includes, based on the comparing, identifying a parent record and a child record and segmenting the parent record based on the child record. Further, the method includes subsequent to the segmenting the parent record, performing a join operation on the first table and the second table.