| Record relationship processing -> Monitor Keywords |
|
|
 
Record relationship processingRelated Patent Categories: Data Processing: Database And File Management Or Data Structures, Database Schema Or Data Structure, Generating Database Or Data Structure (e.g., Via User Interface)Record relationship processing description/claimsThe Patent Description & Claims data below is from USPTO Patent Application 20080071824, Record relationship processing. Brief Patent Description - Full Patent Description - Patent Application Claims
FIELD OF THE INVENTION [0001] The present invention relates generally to information processing systems and more particularly to a methodology and implementation for designating related records. BACKGROUND OF THE INVENTION [0002] In networked computer systems, electronic messages are regularly generated and sent among various computers connected within the network. As the messages are transmitted from one node or computer station to another, there is a need to keep track of various parameters relative to the messages being transmitted so that such messages may be tracked to determine the paths taken, the nodes involved in transmission of the message, times of transmission, etc. In one particular application, a service node is enabled to provide various services to electronic messages received from clients and to generate other messages in accordance with the services performed. For example, a client may send a single parts ordering message, which may in fact be a package of individual messages, to a service node and the service node or server site will generate a plurality of messages to different suppliers from the single communication from the client. Other processing services may also be provided (such as inventory updates, order processing steps, return credit calculations, translations to various formats, etc.) before the order is transmitted from the service node to the suppliers. In all of these situations there is a need to track the original message from the client through the various service stages of the service node to the supplier or other ultimate recipient of the communication from the service node. [0003] The tracking function is performed at the service provider server or service node, as well as intermediate nodes along the way, by maintaining one or a series of related databases in which messages received from clients are logged. As services are performed relative to the message, the identification of those services is also input to the database such that at any given time, a client message can be accessed and tracked through the database to determine what services have been performed pursuant to the client message and what the current status of the client request is. Unfortunately, however, in the past whenever a new message is generated in response to a performed service for example, the new message takes on a new identity. Accordingly, when many services are performed in response to an original message, it is difficult to track any given resulting message back to the communication from which the resulting messages were derived. [0004] Thus, there is a need for an improved processing system in which generated or synthesized messages are identified and tracked in a manner to enable easy identification and access to the derivation of subsequently produced messages. SUMMARY OF THE INVENTION [0005] A method and implementing computer system are provided in which a unique primary key is generated to identify an original message which is received for processing. The record for the original message is stored at the primary key. As the message is propagated to the services that are to be performed on the original message, the primary key is also passed to the service. Derivative messages which are produced as a result of the services applied to the original message are identified with the primary key code along with additional derivative key codes related to services applied to the original message. The resulting hierarchical derivative message storing and tracking process provides a means by which derivative messages are readily identified and associated with an original message as well as the services performed upon the original message in generating the derivative message. [0006] Both the foregoing general description and the following detailed description are exemplary only and do not limit or restrict the present invention in any manner. BRIEF DESCRIPTION OF THE DRAWINGS [0007] A better understanding of the present invention can be obtained when the following detailed description of a preferred embodiment is considered in conjunction with the following drawings, in which: [0008] FIG. 1 is a system diagram illustrating an exemplary system in which the present invention may be implemented; [0009] FIG. 2 is a block diagram illustrating several of the components of an exemplary computer system; [0010] FIG. 3 is a flow chart illustrating an exemplary processing methodology in one implementation of the present invention; [0011] FIG. 4 is a flow chart illustrating one of the steps in FIG. 3 in greater detail; [0012] FIG. 5 is an illustration of a database arrangement in which entries are not related by record designators; and [0013] FIG. 6 is an illustration of an exemplary database in which derivative messages are related to an original message through the use of a primary key and derivative key record designators in accordance with the present invention. DETAILED DESCRIPTION [0014] It is noted that circuits and devices which are shown in block form in the drawings are generally known to those skilled in the art, and are not specified to any greater extent than that considered necessary as illustrated, for the understanding and appreciation of the underlying concepts of the present invention and in order not to obfuscate or distract from the teachings of the present invention. [0015] The various methods discussed herein may be implemented within a computer network including a computer terminal, which may comprise either a workstation or a PC for example connected within a network. In general, an implementing computer system may include computers configured with a plurality of processors in a multi-bus system in a network of similar systems. As shown in FIG. 1, in an exemplary application, a client computer system 101 is arranged to send original messages to a service provider computer system or server 103. The service provider 103, in turn, is enabled to perform requested services upon the original message and send out one or more resulting or derivative messages to one or more recipients 105, 107 and 109. [0016] Several of the major components of an exemplary computer system 103 implementing the present invention are shown in FIG. 2. A processor circuit 201 is connected to a system bus 203 which may be any host system bus. It is noted that the processing methodology disclosed herein will apply to many different bus and/or network configurations. A cache memory device 205, and a system memory unit 207 are also connected to the bus 203. A modem 209 is arranged for connection 210 to a communication line, such as a telephone line, through a connector 111 (FIG. 1). The modem 209, in the present example, selectively enables the computer system 103 to establish a communication link with other computer systems. The system bus 203 is also connected through an input interface circuit 211 to a keyboard 213 and a mouse or pointing device 215. The bus 203 may also be coupled through a hard-wired network interface subsystem 217. A diskette drive unit 219 and CD drive 222 are also shown as being coupled to the bus 203. A video subsystem 225, which may include a graphics subsystem, is connected to a display device 226. A storage device 218, which may comprise a hard disk drive or CD unit, is also coupled to the bus 203. [0017] The invention in general provides the ability to relate entries in a database through derivative primary key values. [0018] The invention may be implemented in connection with a messaging hub in which original messages are received and processed and derivative messages are then sent out to other terminals. In that case a message is received into the hub, dispatched through a sequence of processing steps and delivered to an endpoint. It is required to log the original message content, and all derivative content generated by the various services that process the message. The scheme which is employed in the present example is to first generate a unique primary key for the initial message, and store the record for the original message at the primary key. As the message is propagated to the services, the primary key is passed to the service. This permits the services to access the message to the primary key and generate a derivative primary key for any derivative message which the services produce. In the exemplary embodiment described herein, the service provider offers a splitter service that can break an incoming message (that is actually a package of messages) into the various independent messages, and a translation service that can translate messages from one document format to another. When a bundled message is received, it is logged in a database as a record with an initially generated unique identifier (UUID) as the primary key. In the example, a policy for the generation of derivative primary keys is implemented by appending a string of "."+"service name"+"n" designators where "." is a character chosen to use to separate the primary key fields into its derivative parts, "service name" is the name of the service which produced the new derivative message, and "n" is a count to uniquely identify each of possibly several derivatives produced by the call on the service. [0019] In one example, an incoming message contains 3 sub-messages and each of the sub-messages needs to be translated before delivery. The exemplary methodology will produce the following message log entries: Continue reading about Record relationship processing... Full patent description for Record relationship processing Brief Patent Description - Full Patent Description - Patent Application Claims Click on the above for other options relating to this Record relationship processing patent application. ###  How KEYWORD MONITOR works... a FREE service from FreshPatents1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored. 3. Each week you receive an email with patent applications related to your keywords. Start now! - Receive info on patent apps like Record relationship processing or other areas of interest. ### Previous Patent Application: Method for sending an electronic message utilizing connection information and recipient Next Patent Application: System with user interface for efficiently checking availability statuses of, and selecting, muliple items such as domain names Industry Class: Data processing: database and file management or data structures ### FreshPatents.com Support Thank you for viewing the Record relationship processing patent info. IP-related news and info Results in 0.10919 seconds Other interesting Feshpatents.com categories: Canon USA , Celera Genomics , Cephalon, Inc. , Cingular Wireless , Clorox , Colgate-Palmolive , Corning , Cymer , 174 |
 * Protect your Inventions * US Patent Office filing 
PATENT INFO |
|
