Abstract: Techniques for handling a breach in security are disclosed. According to one technique, prior to the breach, a first party sends to a second party data that identifies a plurality of public keys, including a current public key that corresponds to a current private key. The second party uses the current public key and the first party uses the current private key to exchange electronic messages securely. Other keys, including a session key, may also be used to ensure the security of the exchange. According to one technique, digital signatures are attached to every outgoing message during the secure exchange, and verified on every incoming message. In response to a breach involving the current private key, (1) the first party invalidates the current private key, (2) the first party sends a message to the second party to instruct the second party to invalidate the current public key, and to establish another public key in the plurality of public keys as a new current public key.

Abstract: Mechanism are provided for a trusted intermediary partner to mange the encryption/decryption keys of trading partners in a trading community. As the trusted intermediary manages the public signature decryption keys for each potential sender, the recipient does not have to manage these keys. In one embodiment, a recipient receives a message from a sender via the trusted intermediary, knowing that the message originates from an authentic sender, but not from an imposter. The sender sends the message together with a digital signature of the sender, which is created from the private signature creation key of the sender, to the trusted intermediary. The trusted intermediary, having the public signature decryption key associated with the private signature creation key of the sender, uses this public signature decryption key to authenticate the sender, i.e., verifying that the message originates from a real sender, and not an imposter.

Abstract: Techniques are provided for accessing data stored in XML documents using objects defined in object-oriented languages, such as Java. In one embodiment, a translation tool identifies the data nodes in an XML DTD associated with an XML document. The translation tool converts each of the identified nodes to a corresponding Java class in which a top-level data node in the XML DTD corresponds to a top-level Java class. From the Java classes and data in the XML document, a Java object is instantiated. The Java object thus can be used to advantageously access the data in the XML document in the Java language domain.

Abstract: Techniques are provided for checking product availability from various suppliers so that purchase orders may be automatically generated upon a determination that all desired products are available. In accordance with one embodiment, a “customer” program converts the business objects that create the product demand for the desired products into various supply assurance requests. The customer program then sends each of the supply assurance requests to a respective supplier to query the product availability. After sending the supply assurance requests, the customer program waits until it receives all of the supply assurance replies corresponding to the supply assurance requests. If the supply assurance replies indicate that all the desired products can be provided by the supplier, then the customer program generates one purchase order to each of the suppliers that received a supply assurance request, to place orders for the desired products.

Abstract: A toolkit for developing user-interfaces for a system administration program. The toolkit has a server-side application-programming interface (API). The server-side has task-registry files that each describe a task group. The toolkit also has a client-side API. A developer can customize product-specific properties files for a specific product and write code that calls the server-side and client-side APIs to create a graphical user interface for the specific product.

Abstract: An advanced message queuing system is integrated into a database system. A queue is an ordered list of messages. Messages are requests for processing by an application. Messages are database objects and can represent events or data. Messages comprise user data and control information such as a queue name. Each queue is part of a table in a relational database. A queue table holds a set of queues. Dictionary tables store configuration information describing queues and queue tables. Messages are entered into a queue by instructing the database system using an enqueuing command attached to a message and control information. The control information describes how to order, schedule, and execute the message, and can include a result queue name into which a result message is written after execution. The system responds to a dequeuing command by delivering a copy of a message from the queue. A user can define message order within a queue, message delay factors, and exception processing.

Abstract: An in-line trigger is a modular, compiled, template trigger, which defines a series of actions to be performed when an operation is applied to a body of data. The series of actions to be performed when an in-line trigger fires are compiled into machine language instructions that receive three kinds of parameters: trigger-type specific parameters, operational metadata, and operational data. Trigger-type specific parameters are loaded into a section of run-time memory once for multiple firings of the same trigger. Operational metadata and operational data are loaded each time the trigger fires.

Abstract: A method and system are provided for duplicating at a destination site changes made to data at a source site. According to the method a plurality of streams are established between the source site and the destination site. The plurality of streams are used in parallel to propagate changes made at the source site to the destination site. A record of transactions that made changes that need to be propagated from the source site to the destination site is maintained at the source site. Before propagating changes made by a transaction to the destination site on a stream of the plurality of streams, the record of transactions is inspected to identify a set of transactions whose changes are not known to have been made permanent at the destination site. It is then determined whether the transaction could possibly depend on any transaction in the set of transactions.

Abstract: A method and system are provided for processing records from a set of records, where records are repeatedly being added to the set of records, and where each record in the set of records has to be processed once for each of a plurality of entities. According to the method, each record that is added to the set of records is marked with a default batch value. For each entity of the plurality of entities, a batch of the records is processed by performing the steps of: reading a last batch value associated with the entity, processing the records in the set of records that are marked with batch values that are more recent than the last batch value associated with the entity, and updating the last batch value associated with the entity to a most recent batch value of the records processed for the entity.

Abstract: The present invention provides the ability to replicate modifications made at a local site to multiple remote sites in a peer-to-peer environment. Information regarding these replicated modifications (e.g., insert, delete, or update) are contained in a set of replication tables. Thus, modifications can be duplicated at other sites immediately after the original modification, or deferred until the remote site is available. The replication tables of the present invention include a transactions table, transaction nodes table, calls table, call nodes table, and an exceptions table. The present invention further provides a logic-oriented procedure-level replication. Procedure-level replication modifies a remote site based on the logical operations used to modify the data at the originating site. Procedure-level replication provides the ability to identify conflicting updates as well. Information concerning conflicts identified by the present invention can be retained in the replication tables.

Abstract: A method and system are provided for recovering after a failure in a data replication environment. According to the method, a transaction is executed at a source site that makes changes that must be replicated at a destination site. The changes are made permanent at the source site. The changes are made permanent at the source site without the source site being informed as to whether the changes were successfully applied at the destination site. The changes are sent to the destination site. The changes are applied at the destination site. If the changes are successfully applied before the failure, then the changes are made permanent at the destination site and a record is added to a set of records at the destination site. The record indicates that the changes where made permanent at the destination site. After a failure, the set of records at the destination site are used to determine which changes must be sent from the source site to the destination site after the failure.

Abstract: The present invention provides the ability to replicate modifications made at a local site to multiple remote sites in a peer-to-peer environment. Information regarding these replicated modifications (e.g., insert, delete, or update) are contained in a set of replication tables. Thus, modifications can be duplicated at other sites immediately after the original modification, or deferred until the remote site is available. The replication tables of the present invention include a transactions table, transaction nodes table, calls table, call nodes table, and an exceptions table. The present invention further provides a logic-oriented procedure-level replication. Procedure-level replication modifies a remote site based on the logical operations used to modify the data at the originating site. Procedure-level replication provides the ability to identify conflicting updates as well. Information concerning conflicts identified by the present invention can be retained in the replication tables.

Abstract: Aluminum-molybdenum composite sheet is produced by assembling aluminum and molybdenum sheets to form a billet, rolling the assembled billet in a protective atmosphere at a temperature of about 100.degree. to 400.degree. C. to affect a reduction in thickness of at least about 40% to provide a bonded billet. The billet can be further reduced by hot and/or cold rolling.