Abstract: A method and apparatus for managing dependencies in a distributed environment to ensure the safety of remote procedure calls is disclosed. Each remote procedure call between a calling procedure and a target procedure includes an expected time stamp and expected signature associated with the target procedure. The expected time stamp contains the creation time of the target procedure at the time the calling procedure was last compiled. The expected signature contains data type information of the target procedure formal parameters at the time the calling procedure was last compiled. The target procedure compares the expected time stamp to an actual time stamp maintained by the target procedure. If the two time stamps do not match, the target procedure compares the expected signature and an actual signature maintained by the target procedure to determine whether the data types of the formal parameters sent by the calling procedure are compatible with the data types expected by the target procedure.

Abstract: A method and system for tracking storage for data items is provided. First, an index is built to access the data items. Then a first plurality of index entries for locating a first set of blocks are stored in the index, wherein blocks within the first set of blocks are blocks that store current first versions of the data items. Finally, a second plurality of index entries for locating a second set of blocks are stored in the index, wherein blocks within the second set of blocks are blocks that store non-current second versions of the data items.

Abstract: A method and apparatus are provided for performing deferred incremental refresh of summary tables that are derived from two or more base tables. Incremental refresh is performed by assigning a hypothetical load sequence to the base tables of the summary table. For each base table that contains new data that affects the summary table, a join is performed between (1) the new data in the base table, (2) the pre-update state of base tables that follow the base table in the hypothetical load sequence, and (3) the post-update state of base tables the precede the base table in the hypothetical load sequence. The results of the join are then merged with the existing summary table to refresh the summary table. According to one aspect of the invention, efficiency is improved by performing the joins for the various base tables in parallel.

Abstract: System and method for implementing selectively index enabled multi-column lists in a graphical user interface for a computer system. The graphical user interface contains a table of entries organized by columns. The columns are displayed vertically adjacent to one another. A user selectable vertical line (the divider line) can be moved from an extreme left column position to a position between adjacent columns. When a column is between the divider line and the extreme left column position, the column becomes index enabled. A single column (e.g., the left most column) or multiple columns can be index enabled simultaneously. A column can be positioned between the divider line and the extreme left column position by column reordering, e.g., leaving the divider line in a fixed position and dragging and dropping the column from a position right of the divider line.

Abstract: A method and apparatus for compressing data is provided. The invention compresses an input bit stream into a compressed output bit stream. The input bit streams are byte aligned and classified. Bytes with all bits set to value zero are classified as gap bytes. Bytes with only one bit set to value one are classified as offset bytes. All other bytes are classified as map bytes. Groups of adjacent bytes are organized into two types of groups. The first type is a gap bit group. A gap map group contains gap bytes and one offset byte. The second type is the gap map group. It contains gap bytes and map bytes. The number of gap bytes in a group is called a gap size. The groups are compressed into four types of atoms. Each type of atom has one control byte, zero or more gap size bytes, and zero or map bytes. A control byte describes the atom. The map bytes in an atom are copies of the map bytes in the control group.

Abstract: An approach for providing communication between sub-applications in a vertical application involves exchanging messages between sub-applications in a predetermined common message format referred to herein as a “common view.” Messages transmitted by sub-applications in message formats supported by the sub-applications are translated to produce messages in the common view. Messages to be received by sub-applications in the common view are translated to produce messages in the formats supported by the sub-applications. An adapter may be attached to each sub-application. The adapter provides for the translation of messages between a message format supported by the sub-application to which it is attached and the common view. An agent/broker architecture may be used in which agents are configured with metadata.

Abstract: A method and apparatus for processing reports is disclosed. After receiving a current report request, a duplicate job detection (DJD) key is generated based upon the current report request. The DJD key is then compared to DJD keys associated with previous report requests to determine whether the currently requested report has been previously requested. If the currently requested report has been previously requested, then a saved report generated in response to the previous report request is retrieved. Otherwise, a new report is generated based upon the current report request and then stored.

Abstract: A content processing system determines content of input discourse. The content processing system includes a theme vector processor that determines themes in the input discourse. The theme vector processor identifies themes, including identifying the relative importance of the themes in the input discourse by generating a theme strength. The theme strength indicates relative thematic importance for the theme in the input discourse. A knowledge catalog, which includes static ontologies arranged in a hierarchical structure, is also disclosed. The static ontologies are independent and parallel of each other, and contain knowledge concepts to represent a world view of knowledge. The theme vector processor utilizes the static ontologies to generate a theme concept for each theme by extracting a knowledge concept from a higher level node in the hierarchical structure of a static ontology.

Abstract: A method and apparatus are provided for passing a client from a first server to which the client was connected for accessing a resource, to a second server for accessing the resource. While executing, the first server ceases to respond to the client. After the client detects that the first server has ceased to respond to the client, the client is automatically connected with the second server that has access to the resource. After automatically connecting the client, the client accesses the resource through the second server. The client stores information about the state of the session with the first server so that processing can continue where it left off after the client connects with the second server. The client may be pre-connected to the second server prior to the failure of the first server to reduce the latency caused by switching in response to a failure.

Abstract: A method and apparatus for segmenting bitmaps in a bitmap index is provided. A segmented bitmap includes a plurality of bitmap segments that are used to indicate which records in a body of records that is associated with the segmented bitmap satisfy a particular criteria. Each bitmap segment contains a string of bits that correspond to a corresponding range of records in the body of records. There may be gaps between the ranges represented by the bitmap segments when, for example, the body of records does not contain records in a particular range. For the purposes of retrieval, compression, de-compression, locking and logging, the database system treats each bitmap segment as a distinct data item.

Abstract: A method and an apparatus for determining whether a transaction can use a version of a data item is provided. Transaction summary data is generated that is associated with one or more transactions that have updated a version of the data item. The transaction summary data specifies both a data buffer refresh time and a data buffer commit time. The data buffer refresh time is indicative of the latest time at which the version of data is guaranteed to be current. The data buffer commit time is indicative of the commit time of a most recently committed transaction from the one or more transactions that committed after updating the version of the data item. A determination is made, based upon the transaction summary data and a snapshot time used by the first transaction, whether the version of the data item is to be provided to the first transaction. The data buffer commit time is updated to reflect the commit time of other transactions that commit after updating the version of the data item.

Abstract: A method and apparatus for incremental undo is provided. A process, executing in a database system, establishes a rollback entry in an undo log file as a current rollback entry. The rollback entry, which was selected from a set of rollback entries contained in an undo record, contains data that indicates a change made by a transaction to a data block in the database system. The process first determines whether the rollback entry has been applied by testing a status flag. In one embodiment, the status flag is a bit in a bit vector in the undo block. If the rollback entry has been applied to the database, then the rollback entry is not re-applied; rather, a next rollback entry is established from the set of rollback entries and the process repeats. If the rollback entry has not been applied, then undo information from the rollback entry is retrieved from the undo block and change is generated.

Abstract: An object oriented software environment permits, through declarative programming techniques, customization of functionality of an object. The object oriented software environment includes a plurality of objects, wherein each object contains at least one method. A user of the object oriented software environment submits one or more declarative statements to augment the functionality of a method on an object. In response, the object oriented software environment associates the declarative statements to the method identified on the object such that when the method on the object is called, the declarative statements, associated with the object, are executed in addition to the methods on the object. The declarative programming technique permits augmenting the functionality of a method on an object with “rules.” In addition, two or more methods may be associated together to generate an event that propagates from one method to another method.

Abstract: A method and apparatus for storing a variable length operand offset in a computer instruction is provided. An operand base is stored in a computer instruction. Also stored in the computer instruction is a variable length operand offset that is associated with the operand base. In addition, an operand offset length is stored within the computer instruction that defines the length of the variable length operand offset. Storing an operand offset length with each variable length operand offset in a computer instruction provides for the reduction of unused space.

Abstract: An approach for recovering after premature termination of a plurality of transactions involves: A) selecting a previously unselected transaction from the plurality of transactions; B) processing the selected transaction by undoing the lesser of a predetermined number of changes made by the selected transaction and all changes made by the selected transaction; and C) repeating steps A) and B) until all of the plurality of transactions have been processed. Another aspect of the approach involves: A) selecting a previously unselected transaction from the plurality of transactions, wherein the selected transaction is the previously unselected transaction from the plurality of transactions that made the fewest number of changes in the database; B) processing the selected transaction by undoing one or more changes in the database made by the selected transaction; and C) repeating steps A) and B) until all transactions from the plurality of transactions have been processed.

Abstract: A method and apparatus copies only the data that was in a computer file when the copying process began, allowing other processes to alter the file while it is being copied without introducing inconsistent data into the copy. The file is arranged into sections, with each section containing one or more blocks of data, with each block stored in the file with a serial number higher than the block stored before. The number of blocks in each section is read and stored, and the highest serial number is read and stored. As blocks are copied from a section of the source file into a destination file, the number of blocks in the section are counted, and the count is compared with the number of blocks that were in the section before the blocks were copied. Blocks that would cause the number of blocks in the section to exceed the number of blocks in the section before any blocks were copied are not copied to the destination file, avoiding new blocks added to the end of a section after the copying began.

Abstract: A distributed object is hosted in a distributed system by invoking a global hash function on a generated name for the distributed object. The name for the distributed object is generated with knowledge of the global hash function so that the result of invoking the global hash function upon the name results in the selection of a predetermined node in the distributed system. The predetermined node may be selected based on the affinity of the node to the distributed object for reducing network messaging and communications overhead.

Abstract: A method and apparatus for configuring a software application on a cluster is provided. A configuration coordinator executing on a configuration manager communicates with one or more configuration slaves executing on a set of nodes that are operating as a cluster. The configuration coordinator sends messages to the one or more configuration slaves to initiate a configuration operation for a software application. Each configuration slave automatically performs a series of actions to configure the node on which it resides. When all the nodes complete the configuration operation for the software, the process is complete. While performing the series of actions, the configuration slaves generate logs that reflect their progress in performing the series of actions. If a problem occurs during performance of the series of actions, the configuration slave that encounters the problem indicates to the configuration coordinator that an error occurred.

Abstract: One embodiment of the present invention provides a method for authenticating an identity of a user in order to secure access to a host system. In this embodiment, the host system receives an identifier for the user from a client system. This identifier is used to retrieve a template containing biometric data associated with the user, and this template is returned to the client. The client then gathers a biometric sample from the user, and compares this biometric sample with the template to produce a comparison result. Next, the client computes a message digest using the template, the comparison result and an encryption key, and sends the message digest to the host system. This computation takes places within a secure hardware module within the client computing system that contains a secure encryption key in order to guard against malicious users on the client system.

Abstract: Software fault diagnosis is performed for a faulty base software application that is integrated with external routines by generating substitute routines using the same arguments and parameters of the external routines. The substitute routines are linked into the base software in place of the external routines. If base software application with the substitute routines runs without error, then the external software is suspected for the source of the fault. On the other hand, if the base software with the substitute routines still crashes, then the base software is suspected. The probable source of porting errors can be determined by running the base software with the substitute routines on two or more incompatible platforms and determining which platforms exhibit the fault.