US 6,442,533 B1Grant
Multi-processing financial transaction processing system
Issue Date:2002-08-27
•8 Claims
•29 Drawing Sheets
Abstract
A financial transaction processing system is disclosed, wherein substantial processing efficiencies are provided with, additionally, a substantial decrease in the size of the executable code. Each transaction processed by the transaction processing system is described by a transaction data descriptor that includes a series of subtransaction data descriptions of actions that can be performed independently of one another. Thus, complex transaction processing logic is substantially removed from the executable code, and instead such transaction data descriptors are processed interpretatively. Moreover, the independence of the subtransactions allows the subtransactions of a transaction to be processed in parallel when performed on a multiprocessor computer. Additionally, the transaction processing system provides account balancing enhancements in that there are control columns in various data tables that are automatically updated during transaction processing so that by comparing control column totals, an indication of the integrity of current financial records is provided. Additionally, the transaction processing system provides full auditability in that any changes to financial data can be traced for any effective period of time into the past so that auditors can periodically perform a full audit of the financial transaction data retained by the transaction processing system.
Metadata
Inventor
- William H. Hinkle
Application Information
Application Number:US 09/181,698
Filing Date:1998-10-28
Priority Date:1997-10-29
Art Unit:7
Classifications
IPC:
G06F 1760
Field of Search:
705 37705 38705 36705 35705 30705 32
Patent Drawings (29 sheets)
Description
[0002] This application claims benefit of U.S. Provisional application Ser. No. 60/063,714 filed Oct. 29, 1997.
FIELD OF THE INVENTION
[0003] The present invention relates to a financial transaction processing system, and in particular, to such a system that is capable of decomposing transactions into subtransactions and multi-processing subtransactions simultaneously.
BACKGROUND OF THE INVENTION
[0004] Computerized data processing systems for processing financial transactions have become increasingly more complex as further strides toward automation have occurred. Such complexity has generated a number of related difficulties for the financial data processing industry. In particular, complex financial transaction processing systems may have subtle programming defects or errors that may go unnoticed for long periods of time before the extent of the problems thereby generated are fully recognized. For example, the number of positions allotted for the dating of transactions has recently been problematic, wherein the dates for the millennium starting at the year 2000 can be problematic for many financial transaction processing systems.
[0005] In addition, such complex financial transaction processing systems also are typically incapable of being fully audited. That is, it is common practice in the financial data processing industry to provide only partial auditability in that it is generally believed that the amount of data required to be stored for full auditability is so large as to not be cost effective.
[0006] Further, in many circumstances, the rate of transaction increase is becoming problematic in that progressively larger computers are required for processing financial transactions at an acceptable rate. This problem is exacerbated by the fact that such transaction processing system are not architected for use on multi-processing machines having a plurality of processors. Thus, the advantages of parallel-processing computers cannot be fully utilized by such systems.
[0007] Accordingly, it would be advantageous to have a financial transaction processing system that alleviates the above difficulties, and that additionally, provides flexibility to adapt to the changing business needs of business enterprises so that the transactions processed and the respective reports generated may be modified easily according to business constraints and demands.
SUMMARY OF THE INVENTION
[0008] The present invention is a financial transaction processing system that achieves substantial increases in auditability and processing efficiency. In particular, the present invention provides auditable trails or history in a number of different ways. For example, financial data within transactions is used in the present invention to update various control fields in different tables or files so that cross-checks of system financial integrity can be performed for assuring that, for example, cash fields, total units fields, and cost fields balance appropriately across system data tables provided by the present invention. Additionally, the present invention provides a full range of auditable history files for each system data table having information that is required during auditing.
[0009] The present invention also performs financial transaction processing using a novel computational paradigm. That is, the financial transaction processing system of the present invention has an architecture wherein financial transactions can be decomposed into corresponding collections of independent subtransactions, such that for each input transaction, the corresponding collection of subtransactions are performed by operations that are independent of one another. Thus, the subtransactions can be performed in any order, including in an overlapping fashion, such as may occur during multiprocessing of these subtransactions on a computer having multiple processors.
[0010] Further, note that each of the subtransaction is described by a relatively short (e.g., less than 8 characters) text string that can be straightforwardly interpreted as an operation (e.g., either plus or minus) together with a series of operands, in particular, a first operand having a value to be used in modifying a data table field (column) specified by a second operand. Such high level descriptions of subtransactions provide both compact conceptualization and a reduction in the total size of the executable code for the present invention. Accordingly, when one of the subtransactions is performed, not only is its corresponding operation performed on the operands but additionally, control fields such as those mentioned above are updated appropriately in various data tables for the present invention to enhance auditability of the financial data resulting from the transaction processing. Further, note that since the subtransactions are independent of one another and their executable code is relatively small, there is no need for lengthy and complex flow of control transaction processing modules. That is, the size of the code for the present invention may be up to 100 times smaller than many prior art transaction processing systems. Accordingly, this has a substantial positive impact on the efficiency of the present invention in that the swapping of program elements in and out of primary computer memory is substantially reduced.
[0011] In another aspect of the present invention, the financial transactions of a plurality of business enterprises can be processed in an interleaved manner. In particular, since the present invention is substantially data driven, including the descriptions of the transactions and their related subtransactions, the present invention can be easily modified to incorporate both different or updated versions of transact ions and associated data tables for an existing business enterprise (e.g., also denoted “licensee” hereinafter). Additionally, the transactions and related data tables for an entirely new or different business enterprise (licensee) may be straightforwardly incorporated into the present invention so that its transactions can be interleaved with the transactions of other business enterprises. Thus, transaction processing may be performed by the present invention for business enterprises having different transactions, different account record structures and differently organized general ledgers substantially without modifying the program elements of the transaction processing system.
[0012] For example, the present invention can be used to simultaneously process transactions for:
[0013] (1) a single software application such as an investment management or telecommunications billing system,
[0014] (2) multiple disparate software applications such as investment management, and telecommunications billing, paying agencies, etc., all with disparate definitions.
[0015] Accordingly, the present invention may be viewed as a software engine, or a user-definable transaction processing tool that can be adapted to a variety of industry specific software application needs without changing the actual program code. That is, by surrounding the present invention with application specific software for inputting transaction data to the multi-processing financial transaction processor of the present invention and retrieving data from the multi-processing financial transaction processor of the present invention, a particular business enterprise can have substantially all of its financial records in condition for auditing on a daily or weekly basis.
[0016] The present invention may be further characterized along the following dimensions: flexibility, auditability, multiprocessing, efficiency and size, these dimensions being discussed, in turn, hereinbelow.
[0017] Flexibility is achieved by permitting a business enterprise to define:
[0018] (1) a series of “reference” tables (also denoted “master tables”) that describe the appropriate management decision-making, accounting structure, and regulatory information for the specific application;
[0019] (2) a series of audit controls and system procedures that provide for complete control of all processing and prevent the overwriting of any original data;
[0020] (3) a series of institutional and customer reporting files, known as the “driven” tables; and
[0021] (4) the specific processing content of each individual transaction to be processed via a series of table definitions, known as the “driving” tables.
[0022] Thus, transactions may be customized according to the business needs of a business enterprise.
[0023] Auditability is achieved by;
[0024] (1) providing separate control columns for cash, units and cost basis (if any) in detail records generated and stored for each financial transaction;
[0025] (2) repeating these three control columns, or variations thereof, in at least three different tables so that subsequent summations of each of the four tables will result in similar balances and thus prove that no critical data has been lost in the course of processing, as one familiar with auditing and financial transactions systems will understand;
[0026] (3) adding appropriate data columns:
[0027] (a) to each reference table or master row for maintaining a history of the effects of add, change and delete commands in a current database as well as an archive database;
[0028] (b) to each original file record (i.e. table row) that represents an add to a current database as well as the periodic archive and purge to a permanent database;
[0029] (c) to tables for retaining transaction processing data representing error identification, error negation and error correction.
[0030] Thus, auditabilty of transaction records is achieved by four sets of files for a specific period. These are: (a) a snapshot of all the reference files at the end of the period;
[0031] (b) snapshots of a history file for each master table, wherein the corresponding history file (table) contains all changes to the master table during the specific period; (c) a snapshot of all financial transactions for the specific period, and (d) a snapshot of all of the “driven” tables at the end of the period.
[0032] Multiprocessing is achieved by:
[0033] (1) decomposing the processing of the present invention into a series of separate and independent subprocesses that may be simultaneously performed on any number of simultaneous processors, and
[0034] (2) decomposing input transactions into a series of subtransactions that are processed by independent processes, which may be executed in any particular order, with complete auditability.
[0035] For example, multiprocessing can be achieved by allocating the next prescribed subtransaction process to the next available processor.
[0036] Efficiency is achieved by:
[0037] (1) Defining and utilizing only four standard processing models that perform all prescribed functionality and auditability of the present invention. The models are:
[0038] (a) Processing Model 1 provides an architecture for maintaining historical transaction data so that financial changes can be traced through time;
[0039] (b) Processing Model 2 provides an architecture for automatically maintaining data columns such as Units, Debits and Credits for cross checking table sums to assure that the financial records for a business enterprise balance;
[0040] (c) Processing Model 3 provides an architecture for automatically maintaining financial records relating to financial instruments such as stocks, bonds, real estate, etc.; and
[0041] (d) Processing Model 4 provides an architecture for producing a common processing format for maintaining customer and institutional data tables.
[0042] (2) Defining only four primary program modules for controlling functionality of the present invention, these modules being:
[0043] (a) a transaction processing controller module for receiving transactions to be processed, and controlling the processing thereof;
[0044] (b) a preprocessor and decomposer module for determining the validity of a received transaction, assuring that all data tables and rows thereof are available for processing the transaction, and retrieving the appropriate subtransactions data descriptions to be processed;
[0045] (c) a subtransaction scheduling module for scheduling instantiations of the subtransaction processing module on each of one or more processors; and
[0046] (d) a subtransaction processing module for performing each subtransaction retrieved by the preprocess or and decomposer module.
[0047] (3) Utilizing a number of software switches to control which tables within collection of “driven”tables are to be updated when a specific type of transaction is to be processed.
[0048] Thus, by providing a small number of processing models, decomposing input transactions, and supplying only the necessary subtransaction descriptions, the reliability of the transaction processing system of the present invention is substantially increased.
[0049] The software for the present invention is small in size (both source code and object code) due to the following:
[0050] (1) defining business enterprise financial data processing methods, accounting structures, and regulatory definitions as data rather than program code;
[0051] (2) reducing the processing content to a series of individual transactions; and
[0052] (3) reducing all financial transactions to a collection of subtransactions wherein each subtransaction includes an operator and two or more operands in an 8-character string.
[0053] Thus, the financial processing by the present invention may be performed on several transactions at a time, one transaction at a time, or different processors within a multiprocessor context. Or, the subtransactions for a specific transaction may be spread over several simultaneous processors This means that the business enterprise is afforded a large number of options in tailoring the present invention.
[0054] Hence, by defining the accounting structure and processing functionality as data rather than actual program code, the size of the total code required to process a specific industry application may be substantially reduced compared to prior art transaction processing systems. For example, the executable code for the present invention may be less than one megabyte (1 MB). Thus, since the secondary cache attached to each processor in multiprocessing personal computer servers can be one megabyte, substantially the entire executable for the present invention can be provided to each processor. Thus, the positive impact on total system efficiency is believed to be substantial in that secondary cache is typically about four times faster than normal cache, so productivity gains of about three-hundred percent would not be unreasonable. In other words, the executable code for the present invention can reside in the secondary cache of each processor, thereby allowing the off-loading of any processing function to any processor with relative ease. Additionally, given that a typical RAM memory for a personal computing devices is 16 megabytes, it is believed that such a device will have the capability to process the back office financial transactions of a major money center financial institution or communications billing system.
[0055] Additional features and benefits of the invention will become evident from the detailed description and the accompanying drawings contained herein.
BRIEF DESCRIPTION OF THE DRAWINGS
[0057] FIG. 1 is a high level block diagram illustrating the present invention conceptually.
[0058] FIGS. 2A and 2B is another block diagram of the present invention illustrates: (a) the high level transaction processing modules, and (b) the data tables (represented by the symbols with arcuate vertical sides) provided and maintained by the present invention. Furthermore, the present figure shows the data flows as solid arrows and control flows as dashed arrows. Moreover, this figure also indicates the data tables effected by process models No. 2 and No. 3 of the present invention.
[0059] FIG. 3 is another high level block diagram of the present invention during activation of the preprocessor and decomposer 54 wherein the solid arrows are illustrative of the data flows that occur during the activation of the preprocessor and decomposer 54. Moreover, the tables within boxes represent tables having a process model No. 1 representation, and the tables having account balancing control fields include the identifier, “CNTLS.”
[0060] FIGS. 4-A through 4-D illustrate the steps of a flowchart for initializing the database tables of the present invention for a new business enterprise licensee that is to have its financial transactions subsequently processed by the present invention.
[0061] FIG. 5 is a block diagram illustrating process model No. 1 of the present invention.
[0062] FIGS. 6A-6C is a flowchart of the steps of an embodiment of the transaction processing controller 52 of FIG. 2A.
[0063] FIGS. 7-A through 7-D show the high level steps performed by an embodiment of the preprocessor and decomposer 54 of FIG. 2A.
[0064] FIGS. 8-A and 8-B show the steps of a flowchart for obtaining indexes or pointers to particular rows of a general ledger table wherein the rows are used in processing a transaction.
[0065] FIGS. 9-A and 9-B and 9-C show the steps for a flowchart of an embodiment of the subtransaction processing module 64 (FIG. 2A).
[0066] FIGS. 10A-10B show a flowchart of the steps performed for processing income cash transactions by the present invention.
[0067] FIG. 11 is an embodiment of a flowchart of the steps performed for processing principal cash transactions by the present invention.
[0068] FIG. 12 is an embodiment of a flowchart of the steps performed for processing invested income transactions by the present invention.
[0069] FIG. 13 is an embodiment of a flowchart of the steps performed for processing invested principal transactions by the present invention.
[0070] FIG. 14 is an embodiment of a flowchart of the steps for performing custom accounting such as income expenses, and cash flow for a business enterprise.
[0071] FIG. 15 is an embodiment of a flowchart of the steps for maintaining a business enterprise's balance sheet related to buys and sells of financial entities or instruments.
DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT OF THE INVENTION
[0072] FIG. 1 shows a high level conceptual block diagram of a transaction processing system 50 according to the present invention. In particular, the present invention is conceptualized in the present figure as including five functional components, these being:
[0073] (a) transaction processing controller 52 for: (i) receiving transactions 58 from business enterprises, (ii) controlling the processing of such transactions, including the scheduling of subtransactions to be performed, and (iii) writing of transaction details to, for example, a transaction journal file or table;
[0074] (b) a transaction preprocessor and decomposer 54 for initially receiving a transaction 58 from any one of a plurality of business enterprises as shown, wherein the preprocessor and decomposer 54 decomposes transactions into subtransactions;
[0075] (c) a subtransaction processing module 64 for performing the instructions for each subtransaction determined by the transaction preprocessor and decomposer 54. In particular, the subtransaction processing module 64 utilizes a collection of subtransaction programmatic data descriptions 66 that can be independently scheduled and performed for processing each transaction 58 provided to the transaction processing system 50;
[0076] (d) a subtransaction scheduler 62 for scheduling the execution of each subtransaction output by the preprocessor and decomposer 54;
[0077] (e) a collection of databases 70 containing financial information for each of the one or more business enterprises. Note that the term “database” in the present context includes both the data therein as well as database management functional elements and data structure definitions.
[0078] Another illustration of the present invention is provided in FIG. 2. This figure is a block diagram providing both the processing components of FIG. 1, and additionally, greater detail is provided of the tables or files within the databases 70. However, to simplify the discussion hereinafter, the database terminology used will be that of a relational database. Accordingly, files may also be equivalently referred to as tables, records may also equivalently be referred to as rows, and record fields may also be equivalently referred to as columns. Thus, all the data storage symbols having the collective label of 70 are provided within the like numbered databases of FIG. 1. It is worth noting, however, that in one embodiment of the present invention, the data tables for distinct business enterprises may be provided in the same collection of tables such as those represented in FIG. 2. That is, it is an aspect of the present invention that the accounting and transaction processing of the present invention can use the same plurality of financial data tables for business enterprises having substantially different financial transactions and accounting categories. Thus, although FIG. 1 illustrates the databases 70 as being distinct for each business enterprise, many of these databases (if not most) may be combined into a single database having a plurality of data tables such as those labeled collectively “70” in FIG. 2, these tables being discussed in detail hereinafter.
[0079] Referring still to FIG. 2, a high level view of the processing performed when processing a transaction 58 is provided. In particular, the transaction processing controller 54 receives an input transaction 58 and invokes the preprocessor and decomposer 54. The preprocessor and decomposer 54 subsequently performs, for each transaction 58, the following functions:
[0080] (a) determines, using input from the business enterprise databases 70, whether all necessary data for performing the transaction is available and otherwise rejects the transaction without performing any portion thereof. In particular, the transaction preprocessor and decomposer 54 determines that all data tables to be accessed are available;
[0081] (b) retrieves the data needed to perform the transaction;
[0082] (c) checks to determine that the transaction operation(s) requested is available, and that the transaction is legitimate to be performed on the data for the input transaction 58;
[0083] (d) retrieves the subtransaction data descriptors for decomposing the input transaction 58 into subtransactions.
[0084] Accordingly, the preprocessor and decomposer 54 retrieves into the working storage 72 (shown in FIG. 3) of a host computer (not shown), upon which the transaction processing system 50 is operating, substantially all data and table rows that are necessary to process the transaction 58. Additionally, note that as one skilled in the art will understand, if some portion of the required data to process the transaction is unavailable, then the preprocessor and decomposer 54 terminates processing and subsequently writes appropriate error messages and/or details of the transaction into the reject table 74 (FIG. 2).
[0085] Assuming that the preprocessor and decomposer 54 successfully performs the gathering of information for the decomposing of the transaction into subtransactions appropriately, then control is returned to the transaction processing controller 52, wherein this controller then writes the details of the transaction to the transaction journal 78 along with identification data uniquely identifying the transaction (e.g., a transaction sequence number and/or time and date stamp). Following this, the transaction processing controller 52 invokes the subtransaction scheduler 62 for scheduling the performance of each subtransaction by an invocation of the subtransaction processing module 64. Note that it is an important aspect of the present invention that since the subtransactions can be processed independently of one another for a given transaction, instantiations of the subtransaction processing module 64 can be executed in substantially any desired order. In particular, such instantiations of the subtransaction processing module 64 can be performed concurrently, thus providing a substantial increase in transaction processing efficiency when such concurrency is provided on a computer having a plurality of processors.
[0086] Given that a subtransaction is performed successfully by the subtransaction processing module 64, various accounting tables within the transaction processing system 50 are updated. In general, each subtransaction conceptually indicates a single operation of either plus or minus that is to be performed with two operands also indicated in the subtransaction. That is, the first operand indicates the data to be added or subtracted from a particular field or column of a table row identified by the second operand. Additionally, each subtransaction updates other tables within the transaction processing system 50 automatically in order to provide consistency among the data tables so that: (a) substantially on-line account balancing capabilities can be performed, and (b) full auditability of the records of the business enterprise providing the transaction can be facilitated by retaining history records of table updates, as will be discussed with reference to “master table transaction cluster processing” described hereinbelow. Accordingly, each subtransaction processed by an instantiation of the subtransaction processing module 64 may update a plurality of the data tables contained in the collectively labeled database 70. Note that for one skilled in the art of transaction data processing and accounting, the names provided to the tables are indicative of their information content and structure. However, for clarity, substantially all of the tables for the present invention will be discussed in detail and/or illustrated hereinbelow.
[0087] The subtransaction processing module 64 processes subtransactions derived from three general categories of transactions that may be input to the present invention. That is, there may be input transactions for each of the following types of financial transactions (1.1) through (1.3) hereinbelow.
[0088] (1.1) Transactions related to exchanges of funds such as cash debits and credits for accounts of a particular business enterprise are provided. At a high level, the tables related to this functionality include the account master table 84 (FIG. 2), the general ledger table 88, and the entity attribute master table 92.
[0089] (1.2) Transactions related to additional or customized accounting for clients having accounts in the account master table 84 are provided. For example, in addition to providing the functionality of the transactions described in (1.1) immediately above, a customer income statement (income/expense) table 96 may be provided with client account and transaction information related to income and expenses for tax purposes. Additionally, a customer cash flow (receipts/disbursements) table 100 is also provided for recording any account transaction information related to receipts and disbursements in client accounts. Further, a customer performance measurement table 104 is also provided for retaining client account performance information related to the performance of client portfolios in comparison to investment indexes such as the Dow Jones Industrial Average, the S&P 500, etc. Note that these tables will be discussed and/or illustrated hereinbelow.
[0090] (1.3) When transactions are additionally related to financial instruments other than cash, debits and credits, such as portfolio management wherein there is buying and selling of equities, income derived from equities, and trade settlements related thereto. Further, note that these additional capabilities also provide the same degree of flexibility, adaptability and simplicity as provided in relation to the transaction processing capabilities discussed in (1.1) and (1.2) immediately above. That is, financial equity transactions of various types and for various business enterprises may be easily modified and/or added or removed from the transaction processing system 50 of the present invention, since these transactions are also described by transaction data descriptors consisting of a collection of subtransactions that are capable of being performed in substantially any order that is determined by the subtransaction scheduler 62.
[0091] Accordingly, in providing the functionality for the transactions related to portfolio management, the preprocessor and decomposer 54, upon being invoked by the transaction processing controller 52, also retrieves into working storage (as shown in FIG. 2) the necessary data for processing such portfolio maintenance transactions, this data including a subtransaction decomposition for the transaction. Subsequently, as discussed hereinabove, the subtransaction scheduler 62 invokes an instance of the subtransaction processing module 64. However, in addition to updating any appropriate rows of the tables 84, 88, 92, 96, 100 and 104, the subtransaction processing module 64 invokes a portfolio adjuster module 110 for capturing and/or updating detailed data of portfolio transactions that are not otherwise effectively captured for proper accounting and auditing. In particular, for a given subtransaction, the portfolio adjuster 110 invokes one of the following modules (2.1) through (2.4) hereinbelow.
[0092] (2.1) Original add module 114 for processing a subtransaction related to the addition of further financial instruments to a portfolio such as occurs when securities are bought and must be added to a given account.
[0093] (2.2) A reverse of add module 118 for reversing an addition of financial enterprises to a particular account portfolio. Note that this module is typically activated when financial enterprises are inadvertently added to an incorrect portfolio account.
[0094] (2.3) An original sell module 122 for processing subtransactions related to selling financial enterprises within a given account portfolio.
[0095] (2.4) A reversal of original sell module 126 for reversing the affects of an inadvertent sell of financial enterprises within an account portfolio.
[0096] These four modules 114- 26 update the tables labeled collectively as 70B. In particular, the processing performed herein and the tables updated herein are described below.
Manor Programs and Functionality
[0097] Major Programs
[0098] The N_gine transaction processing system contains four major programs. These are:
[0099] (1) Transaction Processing controller 52
[0100] (2) Transaction Preprocessor and Decomposer 54
[0101] (3) Subtransaction Processing module 64
[0102] (4) Subtransaction Scheduler 62
[0103] Program Functionality
[0104] The purpose of the Transaction Processing controller 52
[0105] (a) test for incoming transactions and once detected
[0106] (b) execute the Transaction Preprocessor and Decomposer 54 and then
[0107] (c) execute the Subtransaction Processing module 64 for each transaction.
[0108] The purpose of the Transaction Preprocessor and Decomposer 54 is to verify
[0109] (a) that all information in the transaction is accurate
[0110] (b) that all files and controls are available to properly process the transaction
[0111] (c) that the specific subtransaction processing instructions are loaded into working storage.
[0112] The purpose of the Subtransaction Processing module 64 is to
[0113] (a) execute all of the subtransactions that have been previously defined for a transaction
[0114] (b) create auditability for every transaction.
[0115] The purpose of the Subtransaction Scheduler 62 is to
[0116] (a) allocate a specific task to a specific processor
[0117] (b) return processing to the Transaction Processing controller 52.
[0118] The present invention may be described as “Table-Driven Transaction Processing”. That is, the present invention permits the processing of virtually any type of user-definable transaction by defining the processing for such transactions as data descriptors that are interpreted in real time and dynamically as needed for processing corresponding transactions. Accordingly, the transaction data descriptors are denoted as “driving data” and are defined by the transaction processing master table and the transaction master table. That is, the transaction master table provides a first initial collection of data for identifying each transaction and the transaction processing table provides the remainder of the data including the subtransaction decompositions. Accordingly, each transaction processed updates an appropriate set of user-definable tables (known as the “driven” data) for completing the processing of the transaction. Since both the “driving” and the “driven” information is expressed as data rather that actual code, the entire functionality of the system can be changed in a straightforward manner.
[0119] In the description hereinbelow, the functional components of the present invention are also identified by other naming conventions from the description above. Accordingly, the following table shows the pairing of the functional component identifications above with those also used below:
| ABOVE | BELOW |
|---|---|
| TRANSACTION PROCESSING CONTROLLER 52 | N_GINE COMMAND PROCESSOR |
| TRANSACTION PREPROCESSOR AND | N_GINE EDIT PROCESSOR |
| DECOMPOSER 54 | |
| SUBTRANSACTION PROCESSING MODULE 64 | N_GINE POSTING TO AM, EA AND GL |
| SUBTRANSACTION SCHEDULER 62 | N_GINE SCHEDULER |
| PORTFOLIO ADJUSTER 110 | AORS |
| ORIGINAL ADD MODULE 114 | ORIGINATE ADD PROCESSING |
| REVERSER OF ADD MODULE 118 | REVERSE ADD PROCESSING |
| ORIGINAL SELL MODULE 122 | ORIGINATE SELL ROUTINE |
| REVERSE OF ORIGINAL SELL MODULE 126 | REVERSER SUBTRACT PROCESS |
N_gine System Design Rules
[0120] A. The Magic Number in Software Design is 1. That is,
[0121] store data once,
[0122] program data once,
[0123] process data once.
[0124] B. Design a total system with the fewest number of processing models. For example,
[0125] One model for processing all adds (inserts),
[0126] changes (updates), and deletes (deletes) for all
[0127] Master (or Reference) Files (or tables).
[0128] One model for processing all of simple transactions (such as debits and credits), including original and reversing entries.
[0129] One model for processing all complex transactions (such as buys and sells), including original and reversing entries.
[0130] One model for processing all adds (inserts), changes (updates), and deletes (deletes) for all Detail Record (or “driven”) Files (or tables).
[0131] C. Use the first and last models to process all files (or tables) in the entire system.
[0132] D. Include audit controls for every table in the system from the very outset of design.
[0133] E. For reasons of productivity assessment, include Production Statistics for every job.
[0134] Namely,
[0135] Begin Time
[0136] Number of Transactions
[0137] Number of Acceptances
[0138] Number of Rejects
[0139] End Time.
[0140] These variables represent the only true means of measuring actual productivity.
[0141] F. For reasons of auditability, never overwrite any original information. Move all original information from data entry (cradle) to data warehouse (grave) without any changes.
[0142] G. For reasons of reliability and profitability, system designs should focus on a “large number of small programs” rather than a “small number of large programs”. The result is not only ease of maintenance but also the ability to spread the small programs across a number of simultaneous processors.
[0143] H. For reasons of manageability, all system designs should embrace one integrated enterprise-wide standard naming convention for all files (tables), records (rows), and fields (columns).
[0144] I. For reasons of portability, use the fewest number of language commands to code the system. Avoid vendor and/or language extensions.
[0145] J. For reasons of flexibility, never hard code what can be table-driven.
[0146] N_gine Design Concepts
[0147] A. Only 4 Processing Models for Financial Services and Telecommunications Applications
[0148] 1. Schema
[0149] 2. Units, Debit/Credit
[0150] 3. Assets/Liabilities
[0151] 4. File Maintenance Routine
[0152] B. Table-Driven Transaction Processing for maximum flexibility
[0153] 1. Number of Transactions
[0154] 2. Name of Each Transaction and Unique Details
[0155] 3. Processing Algorithms (at least 1, up to 20 depending upon complexity)
[0156] 4. Each algorithm has 3 components
[0157] a. Plus (P) or Minus (M)
[0158] b. Operand 1
[0159] c. Operand 2
[0160] C. 100% Auditability For Every Transaction by creating
[0161] 1. a Detail Record containing all relevant data and
[0162] 2. hash totals of three relevant fields in at least 3 other tables.
[0163] D. The 3 relevant fields for calculating all hash totals are:
[0164] 1. Cash
[0165] 2. Units
[0166] 3. Cost Basis
[0167] E. Basic Relational Database Management System Processing Concepts
[0168] 1. Commit/Rollback
[0169] 2. Row Level Locking
[0170] 3. Indexing, ROWID
[0171] 4. Stored Procedures
[0172] 5. Shared Memory
[0173] F. Some Financial Services Accounting Systems are not permitted to commingle funds. That is, separate accounting for both income and principal must be provided. Therefore, each account master must have a designated “income posting code” to define the proper processing. Such a code might be: (I) Income Only, (P) Principal Only, (B) Both Income and Principal.
N_gine's Basic Tables
[0174] Licensee Profile (The Licensee “Reference” or “Master” Tables)
[0175] LM The License Master table contains the necessary information to process any type of licensee using either single or multiprocessing computers.
[0176] LU The Licensee User Master identifies different users for the disparate systems that may be processed simultaneously.
[0177] LT The Licensee Account Type table contains the necessary information to process any type of account be it for a pension trust account, a communications account, or a corporate subsidiary.
[0178] LD The Licensee Default Definition table the default definitions for cash, units, and cost basis controls for total system control.
[0179] LL The Licensee General Ledger Definition is a list of all of the acceptable entries for the General Ledger. That is, it provides a framework for processing any type of accounting controls for any set of account types.
[0180] LS The Licensee Diversification Scheme contains a three level classification scheme for reporting an decision-making purposes for any set of assets and liabilities.
[0181] LP The Performance Measurement Group Master contains a three level classification scheme for measuring the performance of different investment groups.
[0182] LN The Licensee Summary Name Master contains a list of the entries on any type of Income Statement and Cash Flow Statement.
[0183] LW The Licensee Wholesaler Master contains name, address, sales volumes, etc. wholesalers of communications services.
[0184] LR The Licensee Reseller Master contains name, address, sales volumes, etc. for resellers of communications services.
[0185] Account Profile (The Customer “Reference” Tables)
[0186] AO The Account Objectives Table contains the different types of account objectives, such as income, growth, capital preservation, etc.
[0187] AL The Account Jurisdiction contains the different types of legal relationships, such as broker, agent, trustee, advisor, etc.
[0188] AJ The Account Jurisdiction contains the different types of legal jurisdiction, such as federal law, state law, foreign law, etc.
[0189] AR The Account Representatives Table houses the different representatives, their names and communication addresses.
[0190] AN The Account Registration Names is a list of legal names used in security settlement.
[0191] AM The Account Master table provides all of the necessary information to process any type of account by linking the Account Objective, Account Jurisdiction, Legal Capacity, Profit Center, Account Representative, and Registration tables plus other relevant data for reporting content and reporting cycles.
[0192] AC The Account Communications Links links the Account Number for Financial Services to the account numbers for communications services so that all information can be contained in one reporting scheme.
[0193] Transaction Profile (The “Driving” Tables)
[0194] TM The Transaction Master table provides all of the information to process any type of transaction, excepting the specific processing algorithms.
[0195] TP The Transaction Processing table provides all of the specific processing algorithms for any type of transaction master. The Transaction Master and Transaction Processing tables provide all of the necessary information to process any type of transaction.
[0196] TR The Transactions—Recurring Table (TR) contains the necessary information for automatically processing any type of transaction on a recurring basis.
[0197] Entity Profile (The Entity “Reference” Tables)
[0198] EM The Entity Master table provides all of the necessary information to process any type of financial entity.
[0199] EA The Entity Attribute table joins all relevant diversification (known as type, group, and class), general ledger (known as accounting control numbers), and performance group (known as type, group, and class) data into one table for only one access seek.
[0200] ET The Entity Transaction table links specific transactions to specific entities, such as BG (Buy Government) for a U.S. Treasury Note, BF (Buy Tax-Free) for a tax-free bond, BE (Buy Equity) for common stocks, etc. Note: It is the correct assignment of such transactions to such entities that permits the proper accumulation of data for income tax purposes.
[0201] Licensee Status
[0202] SG The System General Ledger contains all of the information to process any type of institutional accounting control.
[0203] SJ The System Transaction Journal Table contains all of the transactions and all of the details for each transaction for a specific accounting period.
[0204] ST The System Trade Settlement Table contains all of the automatically generated offset transactions for Buys and Sells.
[0205] SS The System Summary Table contains a record for each execution of the system with the Begin Time, End Time, Number of Total Records Read, Number of Accepts, Number of Rejects, etc.
[0206] SR The System Reject Table contains a list of all transactions rejected for whatever reason.
[0207] SC The System Transaction Count Table contains the number of each type of transaction processed on any given transaction.
[0208] Customer Status (The “Driven” Tables)
[0209] CS The Customer Income Statement contains all revenues, expenses, and profits or losses for all customer accounts.
[0210] CF The Customer Cash Flow Statement contains all receipts and disbursements for all customer accounts.
[0211] CB The Customer Balance Sheet table contains all assets and liabilities for all customer accounts.
[0212] CG The Customer Capital Gains table contains all of the realized capital gain details for all customer accounts.
[0213] CI The Pending Income table contains all of the pending income, such as interest or dividends, for all accounts.
[0214] CA The Pending Capital Adjustments table contains all of the pending capital adjustments, such as stock splits, stock dividends, mergers, acquisitions, etc., for all accounts.
[0215] CP The Performance Measurement contains all of the periodic performance records for all customer accounts.
[0216] The Control Tables (The “System Balance” Tables)
[0217] Since every transaction is recorded in a detail record plus hashed to three other control tables, the control values of cash, units, and cost basis are added to like values in the following control tables:
[0218] Account Master, System General Ledger, and Entity
[0219] Attribute tables.
[0220] For other reports such as the Income Statement and the Cash Flow Statements, the Performance Measurement table is used as a control table instead of the General Ledger.
[0221] The present invention includes four computational processing models (process models 1 through 4) for processing financial transactions and assuring full auditability and traceability.
[0222] The purpose of Process Model 1 (FIG. 5) is to create a single methodology for capturing, maintaining, and archiving the non-financial transaction data including a master table (reference table, or schema ) data for 100% auditability within a single software system. This model provides:
[0223] A current database 300 (FIG. 5) (for additions, negations and corrections) and an archive database 304 (Read Only)
[0224] Eight tables (i.e. tables 312, 316, 320, 324, 328, 332, 336 and 340, of FIG. 5)
[0225] Number of Modifications
[0226] 12 Control Fields per master table
[0227] A sequence number generator
[0228] A process flow methodology for add, change, and delete of data table rows.
[0229] The operation of Process Model 1 is as follows:
[0230] 1) Normal Updating to current database 300
| Write to | Write to | Move Master | Add to | Change | Delete | |
|---|---|---|---|---|---|---|
| Reject | Accept | to History | Master | Master | Master | |
[0231] 2) Periodic updating to the archive database 304 at the end of a pre-determined time period. That is,
[0232] (a) archive snapshots of the archive master 312 in the current database 300 to the master in archive database 304;
[0233] (b) archive the archive history 332 in the current database 300 to the master history 340 in the archive database 304;
[0234] (c) purge the history table 332 in the current database 304.
[0235] The purpose of Process Model 2 (FIGS. 2A, 2B) is to create a single methodology for: capturing, maintaining, and archiving the financial transaction data including: units, and debit/credits for one or more disparate financial applications with 100% auditability, wherein the processing is performed by: (a) computing configurations containing any number of simultaneous processors( (b) decomposing each input financial transaction into separate and independent subcomponents, (c) allocating the subcomponents across any number of multiple processors.
[0236] The methodology of process model 2 utilizes a data-driven transaction processing strategy, wherein the manner in which a transaction is processed is determined by retrieving appropriate control data for processing a given input transaction. Thus, the present model provides the ability: (a) to process like systems (such as financial services systems) with different transaction definitions and accounting requirements (such as commercial banking, broker/dealers, mutual funds, insurance systems) and different debits and credits and/or (b) unlike systems (such as telecommunications systems) with disparate definitions (such as landline, wireless, satellite, cable systems) within the present invention at the same time.
[0237] The purpose of Process Model 3 (FIGS. 2A, 2B) is to create a single methodology for: capturing, maintaining, and archiving the financial transaction data including: units, debits/credits, financial instruments for one or more disparate financial applications with 100% auditability within a single software system on computing configurations containing any number of simultaneous processors, decomposing each disparate financial transaction into separate and independent subcomponents, allocating the subcomponents across any number of simultaneous processors, and processing the data with 100% auditability. The methodology of Model 3 provides;
[0238] “Detail Record Maintenance”, that is, the ability to process transactions for similar business enterprises (such as portfolio management systems) relating to various financial instruments (such as disparate assets and liabilities) and/or transactions for dissimilar business enterprises (such as portfolio management systems, paying agencies, stock transfer systems) with disparate languages (such as English, Spanish, French, or German) and disparate definitions (such as management philosophy, accounting, and operating nomenclature) and unlike financial instruments (such as assets and liabilities) within the same software at the same time.
[0239] The ability to decompose, allocate, process, and audit each financial instrument transactions with 100% auditability.
[0240] The current databases 300 (for additions, negations and corrections) and the archive databases 304 (read only);
[0241] Sixteen data tables (some of which are shown in FIGS. 2A-2B) plus a sequence generator;
[0242] 12 control fields appended to the master tables for tracing master table changes;
[0243] One transaction three hash totals (mostly using AM, EA, and PM tables);
[0244] 4 currency fields;
[0245] Sequence number generation;
[0246] Reversing/reversed by detail;
[0247] Processing flow for additions, negations, and corrections.
[0248] The purpose of Process Model 4 is to create a single methodology for performing file maintenance including: creating a record (row) containing the initial data in a file (table) or modifying the initial data within an existing record (row) within a file (table) or deleting a current record (row) from a file (table)in any software application on computing configurations using simultaneous processors. Where the term, “Details”, hereinbelow represents the identity of the specific financial transaction, the methodology of the process model 4 is provided by programs such as the following:
| BEGIN |
[0249] Accordingly, the methodology of process model 4 defines:
[0250] (a) A current database (for additions, negations and corrections) and archive database (Read Only)
[0251] (b) ADD or SUBTRACT;
[0252] (c) Initial tests for values;
[0253] (d) Special deletion criteria;
[0254] (e) Tests for action;
[0255] INSERT or UPDATE;
[0256] DELETE or UPDATE;
[0257] INSERT INTO Reject Tables;
[0258] Processing Model 1
[0259] Processing model 1 is a method for processing changes to files (or tables) denoted as master or reference tables (files) wherein these tables retain fundamental information that is not derivable from other tables. In particular, processing model 1 processes changes to master tables in an automated manner without losing historical financial information. Accordingly, 100% auditability of all data changes is able to be achieved.
[0260] The method of achieving this goal uses an architecture denoted as “Master Transaction Cluster Processing” (MTCP). MTCP is based on the premise of creating a logical flow of all original information from data capture (data entry) to permanent data repository (data warehouse) by replacing single master files (or tables) with a cluster of files (or tables). Therefore, MTCP addresses the complete life cycle of all information relevant to organizational decision-making. MTCP is targeted for use in the automatic generation of program code for multiple large-scale real-time transaction processing applications (such as securities trading, telecommunications billing, and work management) on multi-processing computers (using 4, 8, 16, 32 processors), where control is not only an increasing complex issue but an absolute necessity for future competition.
[0261] The circumstances leading to the invention of Master Transaction Cluster Processing are:
[0262] a) Prior art financial transaction software architecture lacks the ability to identify transactions by table, transaction date, transaction number, and the person authorizing the transaction.
[0263] b) Prior art financial transaction systems typically use only one table to contain all Master Information (i.e., non-derivable information) and the data in this table is overwritten, thereby losing historical information. Cases in point would be a record of all of the past mailing addresses or processing instructions for a specific customer.
[0264] c) Without 100% retention of an organization's vital information, management has no idea of the accuracy of the information being used for decision-making purposes.
[0265] d) The Year 2000 problem, know as Y2K, is proving that past software applications designs have reached technological limits and current maintenance costs are inordinately expensive.
[0266] e) Competitive pressures are mounting for higher quality software with lower software development and maintenance costs. Totally new architectures for applications software is in great demand.
[0267] f) The ComputerWorld article, “Information: America's Favorite Investment,” by Paul Strassman, ComputerWorld Magazine, Aug. 5, 1996, states that over 1100 companies are spending more on automation annually than the net worths of their respective companies.
[0268] a) The Standish Report as described in Development Patterns, InfoWorld Magazine, Feb. 3, 1997, p. 56, states that the success rate of Business Process Reengineering has increased from 16% in 1994 to only 27% in 1996.
[0269] Note, in the book “Oracle Design”, Ensor & Stevenson, O'Reilly Press, it is a recommended practice to compromise data retention rather than achieve 100% auditability. Today's hardware costs suggest otherwise.
[0270] The advantages of the present invention over the approaches discussed above are:
[0271] to provide 100% auditability which offers business management the capability to exercise its fiduciary responsibility to its stockholders and Board of Directors,
[0272] to capture, maintain, and ensure the integrity of all vital information for business enterprise decision-making purposes, and
[0273] to preserve such information consistent with business enterprise-defined data retention cycles. Additionally, the present invention allows accountants to certify in business enterprise annual reports that all vital corporate data is being properly preserved.
[0274] A detailed description of Master Transaction Cluster Processing corresponding to model 1 (the first computational model of the present invention) is as follows.
[0275] MTCP Overview
[0276] Master Transaction Clustering, or MTCP, performs the following tasks:
[0277] a) assigns a unique identifier based on (i) master table identification, (ii) transaction date, (iii) transaction number, and (iv) authorized user, to each transaction that causes a change in the state of a particular record of a master table. That is, if one or more data elements in the record change, then the previous record is written to history, and a new status is assigned to an identifier field used for tracking such changes;
[0278] b) creates a logical flow of data as it is originally entered from its inception (data entry) to its repository (data warehouse). The unique architecture of MTCP replaces the Master File (or Table) within prior art systems with a cluster of Master Files (or Tables), known as a “Master Transaction Cluster”. This cluster is suitable for multiprocessing (or the use of simultaneous processors within a single computer to complete a common job). Hence, MTCP addresses 100% auditability via maintaining the total life cycle of information. Aged information may be deleted from the appropriate tables consistent with user-defined data retention policies;
[0279] c) offers a standard for processing all Master Tables within a total application;
[0280] d) provides a test bed for separately testing each Master Table Cluster under development and all Master Table Clusters in concert;
[0281] e) permits management to report that it is successfully capturing, maintaining, and preserving all critical information for decision-making purposes.
[0282] MTCP Scope
[0283] Master Transaction Cluster Processing utilizes the following (FIG. 5):
[0284] a) two databases (i.e., the current data base 300 and the archive data base 304),
[0285] b) sequencing generator 308 having: (i) two external sequence generators; (ii) two internal counters,
[0286] c) eight tables (denoted master table 312, input table 316, summary table 320, reject table 324, accept table 328, history table 332, master archive table 336 and master history table 340), and
[0287] d) twelve additional fields for every row in the master table 312.
[0288] MTCP Independence
[0289] Master Transaction Cluster Processing of Model 1 is independent of any:
[0290] a) application—such as accounts receivable, customer billing, etc.
[0291] b) industry—such as financial services, telecommunication, or work management,
[0292] c) hardware manufacturer—such as Compaq, Digital, HP, IBM, NCR, Unisys,
[0293] d) operating system—such as MS-DOS, UNIX, OpenVMS, MVS, etc.
[0294] e) network—such as Novell, Ethernet, etc.
[0295] f) relational database management system—such as Oracle, Sybase, Microsoft SQL Server, Informix, etc., and
[0296] g) computer language—such as SQL, COBOL, FORTRAN, PL/1, Java, etc.
[0297] MTCP Architecture
[0298] The Master Transaction Cluster Processing (MTCP) architecture can be used for any application in any industry using any computer language. Within the typical structured processing scheme of input and process, the Master Transaction Cluster Processing focuses solely on the process function. Thus, the method permits users to define input screens and defined output reports.
[0299] MTCP Databases
[0300] Unlike prior art software system which contain only one table for each set of primary records, Master Transaction Cluster Processing uses eight related tables, or a cluster of tables, to track all information on a cradle to grave basis. The cradle being its point in inception (or data entry), and the grave being its permanent repository (or data warehouse). Consequently, the “Master Transaction Cluster” spans two different databases: one denoted the Current database 300 containing all relevant data for the current processing period and a second denoted the Archive database 304 containing all relevant data for all previous processing periods. The Current database 300 represents the area of high inquiry, and the Archive database 304 represents the area of low inquiry. Consequently, the Current database 300 is normally placed on high-speed internal disk drive and the Archive database 304 is normally placed on less expensive lower-speed CD-ROMs. Note that trailing information in the Archive database 304 may be destroyed consistent with defined data retention policies, statute of limitations, etc.
[0301] MTCP Tables
[0302] The six tables in the Current database 300 are the
[0303] a.) Master Table 312 (M) that will contain all records to be maintained.
[0304] b.) Input Table 316 (I) that will contain all records prior to updating.
[0305] c.) Reject Table 324 (R) that will contain all records rejected during processing.
[0306] d.) Accept Table 328 (A) that will contain all records accepted during processing.
[0307] e.) History Table 332 (H) that contain a complete snapshot of all records prior to updating.
[0308] f.) Summary Table 320 (S) that contains the results of a specific processing operation.
[0309] and the two tables in the Archive database 304 are the:
[0310] g.) Master Archive Table 336 that contains snapshots of the master table 312 at the end of each processing period.
[0311] h.) Master History Table 340 that contains a history of the master table 312 changes during a current processing period.
[0312] Note that the Master Table (M), Input Table (I), Reject Table (R), the Accept Table (A), the History Table (H) in the same “Master Transaction Cluster” share the same number and order of data elements consisting of alphabetic, numeric, and date items. Alternatively, the Summary Table (S) contains the start time, end time, number of accepts, and number of rejects for each time a series of master table 312 modifications are provided.
[0313] MTCP Generator and Counters
[0314] The Generators 308 include two different external counters and two internal counters used in effecting 100% auditability. The two external counters are the Accept Sequence Number Generator and the Reject Sequence Number Generator. The two internal counters are the Total Records Read Counter and the Number of Modifications Counter. All are used only in the Current database 300, as the Archive database 304 is read-only in nature.
[0315] Regarding the external counters, the Accept Sequence Number Generator included in the Current database 300 automatically generates sequential numbers for the processing period (daily, weekly, monthly, etc.) starting with the number 1, and increments by 1, so that every transaction processed against the preceding (old) master table 312 will receive a specific transaction number, and accordingly, each transaction processed will be uniquely identifiable based on master table identity, transaction date, transaction number, and authorized user. Note that the transaction date is read off the internal system clock. The Reject Sequence Number Generator counts the number of rejects for the specific processing period. Its function is similar to the Accept Sequence Number Generator. Both the Accept Sequence Number Counter and the Reject Sequence Number Counter are “processing period” specific. That is, both are cleared to zero at, e.g., midnight on the end of the processing period so that each processing period may be separately identified and audited.
[0316] Regarding the internal counters, the Total Records Read Counter counts the number of transactions read during a specific processing performance. Since the Total Records Read Counter is “job execution” dependent, this counter is cleared to zero at the outset of every processing program execution. The Number of Modifications Counter counts the number of times a specific record has been changed. As this counter is “record” dependent, this counter is never cleared to zero. This specific counter should identify the number of individual records that may be retrieved, viewed, and verified from all of the tables in the specific Master Transaction Cluster to prove its auditability.
[0317] MTCP Archive Database 304
[0318] The Archive database 304 is read only. Within the Archive database 304, information contained in the Master Archive Table 336 represents a snapshot of information in the Master Table in the Current database 300 at a particular point in time such as the end of a month, quarter, or year. And, information in the History Archive Table 336 contains all of the transactions that have occurred from the beginning of the most recent processing period until the particular point in time, be it month, quarter, or year. For example, the Master Archive Table 336 contains the status of the Master Table 312 at the end of the first quarter, and the History Archive 340 contains all of the transaction modifications occurring since the end of the last quarter. In this fashion, any status of any Master Table 312 can be recreated for any point in time (say, month ends) by simply processing all transactions in the History Archive 340 for the desired period against the previous Master Archive Table 336, or the beginning of the period.
[0319] MTCP SOL Script Library Implications
[0320] To achieve 100% auditability of a complete system, every master file (or table in relational database management systems has a Master Transaction Cluster. Therefore, a total system containing 15 tables would require 15×8 or 120 tables to achieve full 100% auditability. Since each table will require at least 4 SQL scripts to (1) Create Table, (2) Select data from the table, (3) Delete data from the table, and (4) Drop the Table in the event of redefinition, the number of SQL scripts is 15×8×4, or 960 SQL Scripts. Then, each Master Transaction Cluster will require at least a Processing Program plus a Review, Reset, and Retest, or at least four more programs for each cluster, or 4×15, or 60, more SQL Scripts. All of the SQL scripts would be stored in one SQL Script Library on the computer for future reference and ease of maintenance.
[0321] MTCP Multi-processing
[0322] The multi-processing of the Master Transaction Cluster occurs in the following manner:
[0323] For additions (or Insertions in SQL) of data
[0324] The Insertions to the Master Table 312 and Insertions to the Accept Table 328 may be processed simultaneously.
[0325] For changes (or Updates in SQL) of data
[0326] The Update of the Master Table 312 and the Insert to the Accept Table 328 may be processed simultaneously after the original record from the Master Table 312 has been copied to the History Table 332.
[0327] For deletes (or Deletes in SQL) of data
[0328] The Deletion from the Master Table 312 and the Insertion to the Accept Table 328 may be processed simultaneously after the current record in the Master Table 312 has been updated for the transaction identifier and then copied to the History Table 332.
[0329] MTCP Creation
[0330] Before processing any Master Transaction Cluster, the necessary databases and files (or tables) must be created. For each business enterprise utilizing the present invention, these databases and files are created only once in the following manner:
[0331] (Begin Program)
[0332] Create “Current” database
[0333] Create “Archive” database
[0334] in the “Current” database
[0335] Create Master Table
[0336] Create Input Table
[0337] Create Reject Table
[0338] Create Accept Table
[0339] Create Second Accept Table (on separate
[0340] disk unit, if desired)
[0341] Create History Table
[0342] Create Summary Table
[0343] Create Sequence Number for Accepts
[0344] Create Sequence Number for Rejects
[0345] in the “Archive” database
[0346] Create Master Archive
[0347] Create History Archive
[0348] (End of Program)
[0349] MTCP Processing
[0350] Processing of the “Master Transaction Cluster” then occurs in the following manner.
[0351] Step 1: All required information for processing a transaction is first captured on an Input Form.
[0352] Step 2: Once this information is edited by, e.g., an operator, an Enter Key can be pressed by an operator to write this information to the Input Table 316 for particular master transaction clusters.
[0353] Step 3: For each input table 316, a polling program notes that the Input Table is not empty and has a transaction action to be processed whereupon the action is processed by a process (denoted “process 1” in FIG. M1).
[0354] Step 4: The transaction processing program determines the type of file maintenance to perform; basically,
[0355] (1) add a record (entitled Insert a Row in SQL),
[0356] (2) change a record (entitled Update a Row in SQL), and
[0357] (3) delete a record (entitled Delete a Row in SQL),
[0358] which in turn determines the multi-processing potential as described above in the MTCP Multi-processing.
[0359] The normal daily processing flow to achieve 100% auditability in either real-time or batch mode is as follows:
| (Begin Program) | |
| Read System Clock to Store Begin Time | |
| (Read Next Transaction) | |
| If Last Transaction |
[0360] Note: The specific multiprocessing of “Write Multiprocessed Accept Table” may be relocated to the specific routine (Add, Change, or Delete) depending upon the computer language being used.
[0361] Step 5: At the end of the “proofing period” , such as daily or weekly, when proof tallies are matched to computer tallies, the Accept Table can be deleted as follows:
[0362] (Begin Program)
[0363] Delete All Records from the Accept Table
[0364] (End Program)
[0365] Step 6: Backup all databases and tables before any information is purged as follows:
[0366] (Begin Program)
[0367] Write All Tables in the “Current” database to backup
[0368] Write All Tables in the “Archive” database to backup
[0369] (End of Program)
[0370] Step 7: At the end of a user-defined period, an archive and purge process occurs that
[0371] (Begin Program)
| ************************************************* |
[0372] Move All Records in the Master Table to Master Archive.
[0373] Move All Records in the History Table to the History Archive.
[0374] (End Program)
[0375] Step 8: In the event that current records are wrongfully moved to the History Archive,
[0376] they may be retrieved by
[0377] (Begin Program)
[0378] Move Specific Records from the Master Archive to the Master Table
[0379] Move Specific Records from the History Archive to the History Table
[0380] (End Program)
[0381] This program should be executed only after Records have been moved from the Current database 300 to the Archive database 304. It should never be run after new transactions have been processed to the Current database 300.
[0382] MTCP Backup/Recovery
[0383] If necessary, a recovery program can be utilized at any time in the event of hardware failure. Upon complete recovery, Step 7 and Step 8 will have to be re-executed to insure the correct status before the next day's processing is begun. The Accept Table can then be used to as a substitute Input Table to return the system to its previous processing point. Once this table is exhausted, data from the Input Table would supply the remaining data for the processing job.
[0384] MTCP Management
[0385] Once test data are defined and processed, a business enterprise may
[0386] (a) Review lists of the contents of all Master Tables 312 for determining correctness.
[0387] (b) Reset the contents of all Master Tables for performing the next test.
[0388] (c) Retest.
[0389] MTCP Auditability
[0390] Once auditabilty is achieved, the business enterprise may query:
[0391] (a) When a Master Table Cluster was created.
[0392] (b) When each record was added (or inserted) to the Master Table 312,
[0393] (c) How many authorized changes (or updates) have been made to a record of the Master Table 312.
[0394] (d) Prove the integrity of the master transaction cluster by producing a sequential list of all record changes, and if the record was deleted, where the record is stored.
[0395] Accordingly, 100% auditability of every change, every day, for every application is possible.
[0396] Multiprocessing Defined
[0397] Unlike serial processing which processes all jobs in sequential fashion, multiprocessing processes some of the same jobs simultaneously, or in parallel. While multiprocessing is not new, major computer manufacturers such as Compaq, Digital, Hewlett-Packard, IBM, NCR, Unisys, etc. have announced offerings of low-cost multiprocessing machines based on 2, 4, 8, and sixteen processors. These machines will rapidly increase the demand for multiprocessing software, which is known as “multithreaded” software. Multithreaded software permits the simultaneous execution of more than one jobs or job sequences.
[0398] Multiprocessing takes two forms, Symmetrical Multiprocessing (SMP) and Massively Parallel Processing (MPP), the difference being that symmetrical multiprocessing machines collectively have only one bus between the processors and the peripheral storage. For example, a symmetrical multiprocessing machine may have eight processors, one bus, and sixteen disk drives. In contrast, massive parallel processing machines has one bus for each processor. For example, a massively parallel machine may have eight processor, eight busses, and sixteen disk drives. Therefore, symmetrical multiprocessing machines are best suited for applications with a high processing content and a low input/out content. In contrast, massively parallel processing machines are best suited for applications that can be parallelized and have a high input/output requirement, as is the case with many commercial systems.
[0399] In either event, multiprocessing machines are best utilized when carefully tuned to avoid bottlenecks. This is likely to mean that all of the layers constituting a computing environment are multiprocessing-enabled. That is, the hardware, operating system, relational database management system, and the specific application are capable of multiprocessing. Some multiprocessing mainframes have been available for several years as well as some versions of the UNIX operating system. Only a few multiprocessing relational databases exist and even fewer multiprocessing applications. It is believed by some that the success of multiprocessing is solely dependent upon the “knowledge of the application” rather than “knowledge of the underlying tools,” the tools being the hardware, operating system, and relational database system.
[0400] Accordingly, it is believed that the limiting factors for the success of multiprocessing for financial systems depends on:
[0401] (1) the lack of financial transaction application knowledge,
[0402] (2) a lack of understanding of how multiprocessing can be used to effect 100% auditability, and
[0403] (3) the lack of understanding as to how to decompose a financial transaction system into a series of small independent processes that may be performed simultaneously.
[0404] MTPC Uniqueness
[0405] Approaching multiprocessing from the business enterprise perspective, there are several levels by which processing could be sub-divided. These are by:
[0406] (1) application, wherein certain applications are capable of being performed in parallel, such as e.g., Accounts Receivable, Accounts Payable, etc.
[0407] (2) function, wherein certain functions within an application are capable of being performed in parallel, such as, e.g., updating customer profiles, customer status, or performance.
[0408] (3) process, wherein certain large tasks are capable of being decomposed into smaller tasks that can be performed in parallel, such as, e.g., by splitting a large Accounts Receivable process, such as billing, into subcomponents.
[0409] (4) transaction, wherein transactions are decomposed into subtransactions that are capable of being performed in parallel.
[0410] The value of MTCP is that it addresses the last form of multiprocessing which is believed to be the most critical to delivering rapid response times for real-time financial transaction processing systems. That is, by dividing a transaction into subtransactions that can be spread across several multiprocessors) processing throughput may be faster. Plus, the large number of small programs make maintenance much easier and less expensive.
[0411] A first embodiment of the transaction processing controller 52 is provided in the flowchart of FIG. 6. Note that for simplicity, error handling and related validity checking steps have been omitted. However, the performance of such steps is within the scope of the present invention, as one skilled in the art will appreciate. A second pseudo-code embodiment of the transaction processing controller 52 follows.
Pseudo-Code for the Command Processor
Transaction Processing Controller
| BEGIN |
[0412] A first embodiment of the transaction preprocessor and decomposer 54 is provided in the flowcharts of FIGS. 7-A through 7-D and FIGS. 8-A and 8-B. Note that for simplicity, error handling and related validity check steps have been omitted. However, the performance of such steps is within the scope of the present invention, as one skilled in the art will appreciate.
[0413] A second pseudo-code embodiment of the transaction preprocessor and decomposer 54 follows.
Pseudo-Code for the Edit Processor for all Incoming Transactions
Transaction Preprocessor and Decomposer
| BEGIN |
Pseudo-Code for the Schedular
Subtransaction Scheduler
| BEGIN |
Process the Controls Process Routine in the Temporary Table (TT)
| BEGIN |
[0414] Process the Detail Records Maintenance Routine (AORS)
[0415] Note: Leave all switches=1 until the last routine is completed. This forces the processing to loop through each succeeding routine until completed. Then turn set all switches=0 so that the Scheduler will revert back to the Command Program to read another transaction.
| <<Originate ADD>> |
| IF OORR = ‘O’ and |
[0416] A first embodiment of the processing for the subtransaction processing module 64 is provided in the flowcharts of FIGS. 9-A through 9-B, FIGS. 10, 11, 12, 13 and 14. Note that for simplicity, error handling and related validity checking steps have been omitted. However, the performance of such steps is within the scope of the present invention, as one skilled in the art will appreciate.
[0417] A second pseudo-code embodiment of the transaction processing controller 52 follows.
Pseudo-Code for Processing for the Subtransaction Processing Module
| BEGIN |
Pseudo-Code for Performance Measurement (PM)
Processing related to the Licensee
Performance Measurement Table
| BEGIN |
Pseudo-Code for Income/Expense Processing (IE)
Processing related to the Customer Income Statement
Income/Expense Table
| BEGIN |
Pseudo-Code for AORS Processing
Portfolio Adjuster
| BEGIN |
[0418] A first embodiment of the processing for the balance sheet table 130 is provided in the flowchart of FIG. BAL-SHT. Note that for simplicity, error handling and related validity checking steps have been omitted. However, the performance of such steps is within the scope of the present invention, as one skilled in the art will appreciate.
[0419] A second pseudo-code embodiment of the processing for the balance sheet table 130 follows.
[0420] Balance Sheet Processing (BS)
| BEGIN |
Pseudo-Code for Processing the Capital Gains Table
| BEGIN |
Pseudo-Code for Original Add Module
[0421] Note: Do not turn switch OFF or back to 0 as these switches indicate which processes remain.
| BEGIN |
Pseudo-Code for Reverse of Add Module
[0422] Note: Do not turn switch OFF or back to 0 as these switches indicate which processes remain.
| BEGIN |
Pseudo-Code for Original Sell Module
| BEGIN |
Originate Sell Routine
| BEGIN |
Pseudo-Code for Reverse of Original Sell Module
| BEGIN |
Pseudo-Code for Processing Model #4
[0423] For All INSERTS, UPDATES, and DELETES to all Tables
| BEGIN |
Pseudo-Code for Processing the Trade Settlement Table
| BEGIN |
Pseudo-Code for Processing the Customer Cash Flow
Receipts/Disbursements Table
| BEGLN |
Pseudo-Code for Processing the Pending Adjustment Table
| BEGIN |
Pseudo-Cod for Processing the Pending Income Table
| BEGIN |
N_gine File (or Table) Structure and Likely Order of Creation
Corresponding with FIGS.
| Data Source | |
|---|---|
TABLE DATA DESCRIPTIONS WITH EXAMPLES
| (LM) | Licensee Master |
| Primary Data consisting of |
Sample Data for License General Ledger Definition Table (L)
| Licensee | Asset | Accounting | Accounting |
|---|---|---|---|
| Identifier | or Liab | Control Number | Name |
| LICN1 | A | A05 | Municipal Bonds |
| LICN1 | A | A07 | Corporate Bonds |
| LICN1 | A | A10 | Common Stocks |
| LICN1 | A | A12 | Mutual Funds |
| LICN1 | A | A13 | International Currencies |
| LICN1 | A | A15 | Oil Partnerships |
| LICN1 | A | A20 | Real Estate Partnerships |
| LICN1 | A | A30 | Foreign Equities |
| LICN1 | A | A35 | Objects of Art |
| LICN1 | A | A40 | Jewelry |
| LICN1 | A | A45 | Homes |
| LICN | A | A50 | Automobiles |
| LICN | A | A90 | Derivatives |
| LICN2 | A | W10 | MSA/RSA -North |
| LICN2 | A | W20 | MSA/RSA -East |
| LICN2 | A | W30 | MSA/RSA -South |
| LICN2 | A | W40 | MSA/RSA -West |
| LICN2 | A | L10 | Alabama |
| LICN2 | A | L20 | Alaska |
| . | . | . | |
| . | . | . | |
| . | . | . | |
| LICN2 | A | L500 | Wyoming |
| LICN2 | A | S10 | Major Market 1 |
| LICN2 | A | S20 | Major Market 2 |
| LICN2 | A | S30 | Major Market 3 |
| . | . | . | |
| . | . | . | |
| . | . | . | |
| LICN2 | A | S1000 | Major Market N |
| LICN3 | A | C10 | Cash |
| LICN3 | A | C20 | Other Current Assets |
| LICN3 | A | C30 | Fixed Assets |
| LICN3 | A | C40 | Depreciation |
| LICN3 | A | C50 | Intangible Assets |
| LICN1 | L | L05 | Uninvested Income |
| LICN1 | L | L10 | Invested Income |
| LICN1 | L | L15 | Uninvested Principal |
| LICN1 | L | L20 | Invested Principal |
| LICN1 | L | L30 | Personal Notes |
| LICN1 | L | L40 | Mortgages |
| LICN1 | L | L90 | Income |
| LICN1 | L | L60 | Short-Term Liabilities |
| LICN1 | L | L65 | Deferred Taxes |
| LICN1 | L | L70 | Long-Term Liabilities |
| LICN1 | L | L75 | Net Worth |
Sample Data for System General Ledger Table
| Asset | Accounting | |||
|---|---|---|---|---|
| Licensee | or | Account | Control | Accounting |
| Master | Liab | Type | Number | Name |
A Standardized Method for Naming the Programs (or SQL Scripts) and Data Elements of Real-time
Multiprocessed Automated Applications
[0424] The specific invention is a standardized file naming convention to be used in the automatic generation of program code for multiple large-scale transaction processing applications (such as securities trading, telecommunications billing, and work management) on multi-processing computers (using 4, 8, 16, 32 processors) with 100% auditability of user-defined controls. The standardized file naming convention is totally independent of any specific
[0425] a.) application such as accounts receivable, customer billing, etc.,
[0426] b.) industry such as financial services, telecommunications, or work management,
[0427] c.) hardware manufacturer such as Compaq, Digital, HP, IBM, NCR, Unisys,
[0428] d.) operating system such as MS-DOS, UNIX, OpenVMS, MVS, etc.,
[0429] e.) relational database management system such as Oracle, Sybase, MS-SQL Server,
[0430] f.) computer language such as SQL, COBOL, Fortran, PL/1, etc.
[0431] The standard naming convention contains the fewest number of characters in any naming conventions; namely, eleven characters used by MS-DOS. The naming convention of MS-DOS uses eight characters as a file name and three characters as a file extension wherein the user may define a file name using the alphabet and selected other characters. While this flexibility is suitable for home use are a small number of files and users, it is not acceptable for large-scale enterprise-wide applications with large number of files and large number of supporting technicians. Hence, the need for enterprise-wide standards.
[0432] The standard file naming convention contains six elements that permit the technician to readily identify the functionality of the specific script (or program) without looking at its contents. Using ANSI Standard structured Query Language as an example language, the six elements are:
[0433] a.) a 2-character mnemonic for the SQL commands such as:
| Mnemonic | ANSI Standard SQL Commands | |
|---|---|---|
| CT | Create Table | |
| SF | Select From Table | |
| DF | Delete From | |
| DT | Drop Table | |
| II | Insert Into | |
| SI | Select Into | |
| CS | Create Sequence | |
| DS | Drop Sequence | |
| CI | Create Index | |
| DI | Drop Index | |
| RV | Review | |
| RT | Retest | |
| RS | Reset, etc. | |
[0434] b.) a 2-character mnemonic for the application name such as
| Mnemonic | User Defined Application Name Examples | |
|---|---|---|
| ST | Securities Trading | |
| TC | Telecommunications Billing | |
| WM | Work Management, etc. | |
[0435] c.) a 2-character mnemonic for the table (or file name) such as
| Mnemonic | User-Defined Table Name Examples | |
|---|---|---|
| AM | Account Master Name/Address/Etc. | |
| SM | Securities Master | |
| DC | Detail Calls | |
| XB | External Billing, etc. | |
[0436] d.) a 1-character mnemonic for the table cluster role such as
| Mnemonic | Standard Table Roles | |
|---|---|---|
| M | Master | |
| I | Input | |
| A | Accepts | |
| R | Rejects | |
| H | History | |
| S | Summary | |
| 1 | Master History | |
| 2 | Accepts History | |
| O | Output | |
[0437] e.) a 1-character mnemonic for the table cluster type such as
| Mnemonic | Standard Table Types | |
|---|---|---|
| M | Master | |
| J | Journal | |
| T | Temporary | |
| 1-9 | Index Numbers | |
[0438] f.) a 3-character extension is then added to the file name depending upon
[0439] the type of operating system being used such as MS-DOS, UNIX, OpenVMS, etc. and
[0440] whether or not the file is a source file for programmer use or a compiled file (or stored procedure) for machine use.
[0441] Hence, script name examples are:
[0442] CTXBMDMM.SQL—Create Table for the External Billing System, Master Definition Table Cluster, Master Table, and Master Role for SQL use.
[0443] DTXBDCOJ.SQL—Drop Table for the External Billing System, Detail Call Cluster, Output Table, and Journal Role for SQL use.
[0444] Circumstances Leading to the Invention
[0445] The circumstances leading to the invention of a standard SQL script naming convention are:
[0446] a.) one programmer will rarely adhere to the same naming conventions over time and unless an acceptable standard is defined each succeeding programmer added to the job will only complicate the issue by bringing their own standards. Hence, software maintenance becomes a matter of knowing which programmer wrote which program at what time.
[0447] b.) without a naming standard any programmer has no idea of what functions the programming is performing without opening the program and examining the program code. This process produces create inefficient maintenance by existing programmers and inefficient training for new programmers.
[0448] c.) Competitive pressures are mounting for the efficient of software maintenance.
[0449] Advantage of the Invention
[0450] Because no duplicate script names are permitted the name of each SQL Script should
[0451] a.) convey to the user the precise use of each SQL Script and
[0452] b.) permit the storage of all SQL scripts in a one SQL Script Library, or directory.
[0453] A standard naming convention also permits the user to determine what scripts may be automatically executed in sequence by use of a SQL command script, which is a single SQL script containing a list of SQL scripts to be executed in sequence. Hence, any single SQL scripts contained in the SQL Library can be reused in many different SQL command scripts.
[0454] Although any standard naming convention represents a unique entity separate and apart from the other technologies described immediately above, this particular naming convention is unique in that it embraces all of the logical information necessary to readily identify the role of the script in the total system.
[0455] Detailed Description of Invention
[0456] std_name is a standard naming convention that constructs names for programs (or SQL Scripts), system tables, table clusters, and data elements. The seven basic elements are:
| 1.) org_name | Organization | 2 | |
| 2.) com_name | SQL Command | 2 | |
| 3.) app_name | Application | 2 | |
| 4.) tab_name | Table | 2 | |
| 5.) rol_name | Table Role | 1 | |
| 6.) typ_name | Table Type | 1 | |
| 7.) col_name | Column (or Field) | 4 | |
[0457] std_name defines both “external” names used by the operating system and “internal” names used by the specific program.
[0458] The “external” resulting names are:
| 1.) clu_name | Cluster Name | 4 | |
| 2.) sys_name | System Table Name | 6 | |
| 3.) ext_name | Extension Name | 3 | |
| 4.) sql_name | SQL Script Name | 11 (8 name plus 3 | |
| extension) | |||
[0459] where the SQL Script Names are used by the operating systems.
[0460] The “internal” resulting names are:
| 1.) tab_iden | Table Iden Name | 4 | |
| 2.) col_name | Column (or Field) Name | 4 | |
| 3.) dat_name | Data Element Name | 8 or more, in | |
| increments of 4 | |||
[0461] where the Data Element Names are used by the programs (or SQL Scripts).
[0462] External Names used by the operating system in identifying programs (or SQL Scripts) are created by employing the following naming components:
| com_name | SQL Command Mnemonic | |
| app_name | Application Name Mnemonic | |
| tab_name | Table Name Mnemonic | |
| rol_name | Table Role Name Mnemonic | |
| tab_name | Table Type Name Mnemonic | |
| ext_name | Extension Mnemonic | |
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | . | 9 | 10 | 11 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| clu_name |
[0463] Internal Names used by the program (or SQL Script) in processing the data elements are created by employing the following naming components:
| 5 | 6 | 7 | 8 |
|---|---|---|---|
| Examples: | M | D | M | M | LNAM . . . for last name |
| M | D | M | M | FNAM . . . for first name | |
| M | D | M | M | MNAM . . . for middle name | |
| M | D | M | M | ADR1 . . . address - 1st line | |
| M | D | M | M | ADR2 . . . address - 2cd line | |
| M | D | M | M | CITY . . . city | |
| M | D | M | M | STAT . . . state | |
| M | D | M | M | ZIPC . . . zip code |
[0464] Data Tracing
[0465] By addressing both the external names for the operating system and the internal names for a specific program, the naming convention is global in nature. In the event that one data element derives its source of input from another table rather than its own specific input screen, then the data name is extended by placing the table identifier of the table supplying the data between the first four and second four characters of the intended data name. Should the data be derived from another table that also derived its data from another table, then eight characters are placed between the first four characters and the last four characters of the intended data name. In the fashion, the data name points backwards through all of the preceding tables to the original source of data and its input form. This process is called “data tracing”, and it provides benefits to programmers in the testing and debugging stages of software development by identifying the original source of data. Thus, “data tracing” provides the programmer with thorough documentation of the data flow throughout an entire system.
[0466] Standard naming conventions do not apply to certain language extensions such as the script footings that, for example, specify the size of the table to be created in a “Create Table” script.
[0467] The foregoing discussion of the invention has been presented for purposes of illustration and description. Further, comments and description is not intended to limit the invention to the form disclosed herein. Consequently, variation and modification commensurate with the above teachings, and within the skill and knowledge of the relevant art, are within the scope of the present invention. The embodiment described herein above is further intended to explain the best mode presently known of practicing the invention and to enable others skilled in the art to utilize the invention as such, or in other embodiments, and with the various modifications required by their particular application or uses of the invention. It is intended that the appended claims be construed to include alternative embodiments to the extent permitted by the prior art.
Claims
What is claimed is:
1. A method for processing financial transactions for disparate applications, comprising:
providing a system that facilitates (1) flexibility to satisfy customized needs of an enterprise or individual, (2) auditability to track all financial transactions from data inception to permanent archives, without substantial error, and (3) multi-processing of each individual transaction to expedite response times, said user definability consists essentially of steps a-e:
(a) defining a set of driven tables comprising a set of data records or a set of financial reports selected from the group consisting of balance sheets, income statements, cash flow statements, performance measurements, capital gains, pending income/expense, pending capital adjustments, general ledger, and transaction ledger;
(b) defining a set of data records that provides verification of incoming data for the processing of accounts, financial entities, account structures, management philosophies, management information, and any of said financial reports;
(c) defining a first driving table comprising a set of disparate financial transactions used to update any one or more of said reports set forth in step (a), each said transaction having one entry in a transaction master table which identifies a transaction name;
(d) defining a second driving table comprising a set of disparate processing algorithms in a transaction processing table for each transaction in step (c), each of said algorithms containing one operator and first and second operands, said first operand identifying a specific input variable in said data records and said second operand identifying a specific output value to be updated in one more of the financial tables set forth in step (a);
(e) aggregating a set of incoming random disparate financial transactions into a single machine readable input table;
wherein said step of multi-processing consists essentially of:
(f) reading an input record from said input table, said input table containing at least three or more variables, two of said variables which comprise at least a licensee identifier and a transaction identifier, with all remaining of said variables representing input values;
(g) matching said licensee identifier and said transaction identifier with a like licensee identifier and transaction identifier in said transaction master table, said transaction master table containing a list of all financial transactions as set forth in step (c);
(h) matching said licensee identifier and said transaction identifier on said data record with a set of algorithms in said transaction processing table as set forth in step (d);
(i) assigning the next available algorithm matched in step (h) from said transaction processing table to be processed to the next available processor in a multi-processing machine to update one or more values in said driven table with a specific value identified in said data record;
(j) returning to said next algorithm identified in step (d) and continuing processing until all of said algorithms for said specific transaction are processed;
(k) repeating step (f) to read a next input record until all of said input records are processed;
(l) adding subsequent data records to said driven tables as set forth in step (a);
(m) adding subsequent data records to said transaction master as set forth in step (c); and
(n) adding subsequent data records to said transaction processing table sot forth in step (d).
2. The method as set forth in claim 1, further comprising:
(a) creating at least three control fields for every one of said data records in at least three control tables;
(b) updating said three control fields for a specific one of said data records in each of said three control tables with thee values from each transaction process; and
(c) aggregating said at least three control fields in all of said data records in at least said three control tables.
3. The method as set forth in claim 1, wherein at least some of said data records are transferred from a first set of tables to a second set of tables, wherein data records in said second set of tables cannot be changed.
4. The method as set forth in claim 1, wherein sad data records comprise a data field selected from the group consisting of:
(1) Insert Date;
(2) Insert Sequence Number;
(3) Insert User Identifier;
(4) Insert Update Date;
(5) Update Sequence Number;
(6) Update User Identifier;
(7) Delete Date;
(8) Delete Sequence Numbers;
(9) Delete User Identifier; and
(10) Number of Times Updated.
5. The method as set forth in claim 1, further comprising reversing at least one of said individual transaction.
6. The method as set forth in claim 1, wherein said algorithms are processed on separate processors.
7. The method as set forth in claim 1, wherein said step of multi-processing comprises overlapping of at least one of said algorithms.
8. The method as set forth in claim 1 wherein said step of processing is performed on a multi-processing machine.
Patent Citations (59)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3697693(A) | 1972-10-01 | Deschenes et al. | Applicant |
| US4001568(A) | 1977-01-01 | Iizuka et al. | Applicant |
| US4025905(A) | 1977-05-01 | Gorgens | Applicant |
| US4321672(A) | 1982-03-01 | Braun et al. | Applicant |
| US4412287(A) | 1983-10-01 | Braddock, III | Examiner |
| US4621326(A) | 1986-11-01 | Rawlins | Applicant |
| US4625276(A) | 1986-11-01 | Benton et al. | Applicant |
| US4713761(A) | 1987-12-01 | Sharpe et al. | Applicant |
| US4727243(A) | 1988-02-01 | Savar | Applicant |
| US4774664(A) | 1988-09-01 | Campbell et al. | Examiner |
| US4948174(A) | 1990-08-01 | Thomson et al. | Applicant |
| US4994964(A) | 1991-02-01 | Wolfberg et al. | Applicant |
| US5025373(A) | 1991-06-01 | Keyser, Jr. et al. | Applicant |
| US5057677(A) | 1991-10-01 | Bertagna et al. | Applicant |
| US5093787(A) | 1992-03-01 | Simmons | Applicant |
| US5117356(A) | 1992-05-01 | Marks | Applicant |
| US5121945(A) | 1992-06-01 | Thomson et al. | Applicant |
| US5170480(A) | 1992-12-01 | Mohan et al. | Applicant |
| US5222018(A) | 1993-06-01 | Sharpe et al. | Applicant |
| US5237498(A) | 1993-08-01 | Tenma et al. | Examiner |
| US5262942(A) | 1993-11-01 | Earle | Applicant |
| US5317504(A) | 1994-05-01 | Nakayama | Examiner |
| US5390113(A) | 1995-02-01 | Sampson | Applicant |
| US5418713(A) | 1995-05-01 | Allen | Applicant |
| US5420405(A) | 1995-05-01 | Chasek | Applicant |
| US5438509(A) | 1995-08-01 | Heffron | Applicant |
| US5438517(A) | 1995-08-01 | Sennott et al. | Applicant |
| US5444616(A) | 1995-08-01 | Nair et al. | Applicant |
| US5448471(A) | 1995-09-01 | Deaton et al. | Applicant |
| US5448729(A) | 1995-09-01 | Murdock | Applicant |
| US5452445(A) | 1995-09-01 | Hallmark et al. | Applicant |
| US5455407(A) | 1995-10-01 | Rosen | Applicant |
| US5457305(A) | 1995-10-01 | Akel et al. | Applicant |
| US5465328(A) | 1995-11-01 | Dievendorff et al. | Applicant |
| US5496991(A) | 1996-03-01 | Delfer, III et al. | Applicant |
| US5500513(A) | 1996-03-01 | Langhans et al. | Applicant |
| US5517406(A) | 1996-05-01 | Harris et al. | Applicant |
| US5517644(A) | 1996-05-01 | Murdock | Applicant |
| US5555503(A) | 1996-09-01 | Kyrtsos et al. | Applicant |
| US5557742(A) | 1996-09-01 | Smaha et al. | Applicant |
| US5576945(A) | 1996-11-01 | McCline et al. | Applicant |
| US5581749(A) | 1996-12-01 | Hossain et al. | Applicant |
| US5612883(A) | 1997-03-01 | Shaffer et al. | Applicant |
| US5621812(A) | 1997-04-01 | Deaton et al. | Applicant |
| US5629855(A) | 1997-05-01 | Kyrtsos et al. | Applicant |
| US5630072(A) | 1997-05-01 | Dobbins | Applicant |
| US5630073(A) | 1997-05-01 | Nolan | Applicant |
| US5634012(A) | 1997-05-01 | Stefik et al. | Applicant |
| US5636277(A) | 1997-06-01 | Nagahama | Applicant |
| US5640323(A) | 1997-06-01 | Kleimenhagen et al. | Applicant |
| US5652570(A) | 1997-07-01 | Lepkofker | Applicant |
| US5657226(A) | 1997-08-01 | Shin et al. | Applicant |
| US5657487(A) | 1997-08-01 | Doner | Applicant |
| US5774879(A) | 1998-06-01 | Custy et al. | Examiner |
| US5862325(A) | 1999-01-01 | Reed et al. | Examiner |
| US5864685(A) | 1999-01-01 | Hagan | Examiner |
| US5937395(A) | 1999-08-01 | Iwamura | Examiner |
| WO96/23258 | 1996-08-01 | Examiner | |
| WO99/22329 | 1999-05-01 | Examiner |
Non-Patent Literature (8)
- “IBM Stakes Big Claim in Data Mining Market”, Apr. 10, 1996, The Gale Group, Report on IBM, v13, pN/A.Applicant
- “Customer Analysis Helps Direct Product Initiatives”, Mar. 10, 1997, Phillips Business Information, vol. 14, issue 6.Applicant
- Bers, Joanna Smith, “MPP vs. SMP”, Oct. 1995, Bank Systems & Technology, v 32, n10, p 30-35.Applicant
- Sampson, Wesley C., “Transaction Index: A Tool for Auditors”, Spring 1996, Internal Auditing, pp. 16-24.Applicant
- Letter to Examiner Robinson-Boyce from inventor dated Aug. 14, 2001.Applicant
- Letter to Examiner Robinson-Boyce from inventor dated Jul. 16, 2001.Applicant
- Ferguson, eWeek, “Ellison's “War” Perplexes Some”, Aug. 6, 2000.Applicant
- Edwards, Electronic Engineering Times, “Architects Wrestle with Multiprocessor Options”, Aug. 6, 2001, pp. 48.Applicant