Parallel Transaction Processing via Hash Index Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional processing methods for authorization requests in computer systems are slow and cumbersome due to serial processing of service requests, where a processing computer waits for response messages from each server computer before transmitting the next request, leading to inefficiencies in transaction processing.
Innovation Solution
A method using a processing computer with a hash index table and an array index table, where multiple service request messages are transmitted in parallel to server computers for processing, allowing simultaneous processing and response handling, with the processing computer accessing the hash index table to determine further processing steps based on transaction keys from the response messages.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If serial processing method is used to transmit service request messages to server computers, then the processing order is simple and easy to manage, but the overall processing time is long and efficiency is low
Solution Approach 1:
The patent segments the transaction processing into multiple independent service request messages, each handled by different server computers. These segmented requests are processed in parallel rather than sequentially, with each server computer independently handling its assigned task (detokenization, fraud analysis, format evaluation) simultaneously, thereby reducing total processing time while maintaining manageability through structured segmentation
Solution Approach 2:
The processing computer performs preliminary actions by creating and transmitting multiple service request messages to different server computers before receiving responses. This preliminary parallel transmission of requests (detokenization request, fraud analysis request, format evaluation request) eliminates the need to wait for sequential responses, as all requests are sent out in advance and processed simultaneously by the server computers
2Productivity
If parallel processing of service request messages is implemented, then the processing speed and efficiency are improved, but the complexity of managing multiple requests and responses increases
Solution Approach 1:
The patent introduces an intermediary mechanism in the form of a correlation table that acts as a mediator between the parallel processing activities and the final response assembly. This correlation table stores the relationships between service request messages and their corresponding responses, allowing the processing computer to automatically match and correlate responses from multiple servers without complex manual tracking, thus managing parallel processing complexity through structured intermediary data structures
Solution Approach 2:
The processing computer is designed with multi-functional capabilities to handle both the creation of diverse service request messages (detokenization, fraud analysis, format evaluation) and the consolidation of their responses. This universal processing computer performs multiple functions: generating parallel requests, receiving and correlating responses from different servers, and assembling the final authorization response, thereby managing complexity through a multi-functional centralized coordinator rather than requiring separate specialized systems for each function
3Adaptability or versatility
If multiple server computers are used for different processing tasks, then the functional capabilities and processing versatility are enhanced, but the coordination and communication overhead between servers increases
Solution Approach 1:
The patent merges the coordination function into a single centralized processing computer that handles all communication and coordination with multiple server computers. This processing computer consolidates the tasks of creating service request messages, transmitting them to specialized servers (detokenization server, fraud analysis server, format evaluation server), receiving responses, and assembling final results. By merging coordination into one central entity rather than distributing it across multiple servers, the system enhances processing versatility through specialized servers while reducing coordination complexity through centralized management
Data Source
AI summary
A method of using a processing computer comprising a memory comprising a hash index table and an array index table is disclosed. The method includes receiving an initial request message comprising a plurality of data fields with data elements for a transaction, and creating service request messages, where each service request message comprises a transaction key and data elements. The method includes transmitting the service request messages to server computers, which process them and generate service response messages, each service response message having the transaction key and response data. The method includes receiving the service response messages. The method includes for each of the service response messages: accessing the hash index table and determining a row address identifier for a row in the array index table based on the transaction key, and accessing data in the row of the array index table associated with the row address identifier.