Database Function Defined Switches for Distributed Data Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional network switches in distributed databases are inefficient in routing data messages, leading to duplication and redundancy, which wastes network bandwidth and computation capacity, as they do not perform database functions on data messages and thus forward all data transparently, resulting in sub-optimal performance.
Innovation Solution
The introduction of Database Function Defined (DFD) network switches that perform pre-defined database functions on query data, either to full completion if resources allow or to partial completion if resources are insufficient, and route the processed data to destination nodes, optimizing data transmission by reducing redundant data forwarding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If conventional network switches forward all data messages transparently without processing, then all data is routed to destination nodes, but network bandwidth and computation capacity are wasted due to duplicated and redundant data
Solution Approach 1:
The network switch performs preliminary database function processing (aggregation, filtering, sorting) on data messages before forwarding them to destination nodes. This preliminary action eliminates duplicated and redundant data in advance, preventing waste of network bandwidth and computation capacity at destination nodes while improving overall data transmission efficiency
2Loss of energy
If network switches perform database functions on all data messages, then redundant data forwarding is reduced, but network switch resource consumption increases
Solution Approach 1:
The network switch performs database functions (aggregation, filtering, sorting) on data messages selectively based on resource availability. When resources are sufficient, the switch processes data to reduce redundancy; when resources are constrained, the switch adjusts processing levels. This partial action approach optimizes the balance between reducing network bandwidth waste and managing network switch resource consumption
3Speed
If network switches forward all data messages without processing, then data transmission is simple and fast, but destination nodes receive duplicated data requiring additional computation to filter
Solution Approach 1:
The network switch performs preliminary processing (aggregation, filtering, sorting) on data messages before forwarding, which reduces the volume of data and computation required at destination nodes. This preliminary action maintains efficient data forwarding while optimizing computation capacity utilization across the distributed database system
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A computer-implemented method and system at a network switch provides using one or more processors to perform a pre-defined database function on query data contained in data messages received at the network switch, with the performing producing result data, and wherein the pre-defined database function is performed on the query data in a first mode of operation to a state of full completion, generating complete result data and no skipped query data, and in a second mode of operation to a state of partial completion, generating partially complete result data and skipped query data. Further, the method and system performing one or more network switch functions to route the complete result data, and/or route the partially complete result data and skipped query data, to one or more destination nodes. In addition, an application programming interface (API) is used to define the database function.