Abstract: A method of providing decision support for personnel hiring, the method comprises receiving a list of one or more mandatory hiring criteria and one or more desirable hiring criteria for a position, retrieving a profile of a job candidate from a candidate case base, computing a suitability of the job candidate for the position by determining if the job candidate profile includes all mandatory hiring criteria, and responsive to the job candidate profile including all mandatory hiring criteria, computing a suitability ranking of the job candidate based on a degree of similarity of the one or more mandatory hiring criteria and one or more desirable hiring criteria to qualifications in the job candidate profile, and ranking the job candidate against other job candidates based on the suitability ranking of the job candidate and suitability rankings of the other job candidates.

Abstract: A method for indexing a plurality of nodes using a computer system is provided. The computer system includes data storage and a processor coupled to the data storage. The method includes acts of storing the plurality of nodes in the data storage, each of the plurality of nodes having a hit count, a link count and an outcome, creating a qualitative index ordering a plurality of nodes according to the hit count, the link count and the outcome of each node and storing the qualitative index in the data storage. The hit count of each node indicates a number of times a case attribute associated with the node is presented to a user. The link count of each node indicates a number of times the case attribute associated with the node is affirmed as useful. The outcome of each node indicates a desirability of the outcome.

Abstract: A method for indexing a plurality of nodes using a computer system is provided. The computer system includes data storage and a processor coupled to the data storage. The method includes acts of storing the plurality of nodes in the data storage, each of the plurality of nodes having a hit count, a link count and an outcome, creating a qualitative index ordering a plurality of nodes according to the hit count, the link count and the outcome of each node and storing the qualitative index in the data storage. The hit count of each node indicates a number of times a case attribute associated with the node is presented to a user. The link count of each node indicates a number of times the case attribute associated with the node is affirmed as useful. The outcome of each node indicates a desirability of the outcome.

Abstract: A method for indexing a plurality of nodes using a computer system is provided. The computer system includes data storage and a processor coupled to the data storage. The method includes acts of storing the plurality of nodes in the data storage, each of the plurality of nodes having a hit count, a link count and an outcome, creating a qualitative index ordering a plurality of nodes according to the hit count, the link count and the outcome of each node and storing the qualitative index in the data storage. The hit count of each node indicates a number of times a case attribute associated with the node is presented to a user. The link count of each node indicates a number of times the case attribute associated with the node is affirmed as useful. The outcome of each node indicates a desirability of the outcome.

Abstract: A method for indexing a plurality of nodes using a computer system is provided. The computer system includes data storage and a processor coupled to the data storage. The method includes acts of storing the plurality of nodes in the data storage, each of the plurality of nodes having a hit count, a link count and an outcome, creating a qualitative index ordering a plurality of nodes according to the hit count, the link count and the outcome of each node and storing the qualitative index in the data storage. The hit count of each node indicates a number of times a case attribute associated with the node is presented to a user. The link count of each node indicates a number of times the case attribute associated with the node is affirmed as useful. The outcome of each node indicates a desirability of the outcome.

Abstract: A computer database method wherein the data is organized into atomic data ts and transactions are separated into projections which operate on only one atomic data set. Multiple transactions can thereby access the same atomic data set using a locking protocol wherein locks are held by each projection. On access to a data item, the system detects existing locks. If locks are not found, the system locks the data and performs the access. When existing locks are found the system delays execution of the command and determines if a deadlock is present. To recover from a deadlock, related projections are merged together and reexecuted. The system merges related projections from other transactions and reexecutes if the deadlock continues. When the deadlock continues after execution of the above steps, a victim projection is chosen and aborted. The victim projection is restarted after commit of the conflicting projection.

Abstract: A computer database method wherein the data is organized into atomic data sets and transactions are separated into projections which operate on only one atomic data set. Multiple transactions can thereby access the same atomic data set using an optimistic protocol. An atomic data set counter is incremented on initial access to an atomic data set by a projection, and a local copy of the accessed data item is created. The issued command is executed while adding the timestamp and data item to the appropriate read or write set of the projection. Upon final access to the atomic data set by the projection, the local copy of the accessed data items is validated by comparing the read and write set of the projection with the read and write sets of all other projections that have accessed the atomic data set. If other projections conflict with the validating projection, the validating projection is aborted and restarted. Upon valid completion of the projection the local copy is written to the atomic data set.

Abstract: A method for providing critical time reactive management of database transactions includes the steps of providing a database distributed over a plurality of sites, each site being partitioned into a plurality of objects; providing a number of transactions to be performed on the database; assigning a dynamic weight to each transaction of the number of transactions; distributing the number of transactions to at least one of the plurality of sites of the database; and executing the transactions according to the dynamic weight.

Abstract: A computer database method wherein the data is organized into atomic data sets and transactions are separated into projections which operate on only one atomic data set. Multiple transactions can thereby access the same atomic data set using a plurality of projections. A projection timestamp is generated by the system initial access to the atomic data set by the projection. Read and write timestamps are maintained separately by the atomic data set. Upon each read and write command, the issuing projection timestamp is compared against the appropriate atomic data set read or write timestamp. The operation succeeds if the compared timestamps do not indicate a conflict. Upon failure the projection is restarted with a new timestamp.

Abstract: A computer database method using data organized data into atomic data sets and transactions separated into a plurality of statements called projections which operate on only one said atomic data set. Statements such as read commands, write commands, assignment commands, transaction delimiting commands, and projection delimiting commands are executed, and a depends on graph is created during execution of the statements. Projection recovery data is stored during operation. When a projection requests commit the depends on graph is analyzed to determine if the projection is depends on another projection in the transaction. The projection is committed if it is independent or delayed until commit of the projection on which it depends. Likewise, the system determines projections dependent on the aborting projection and aborts the projections together if a transaction error occurs. A replay method is presented for restarting aborted projections.

Abstract: A computer database method using data organized data into atomic data sets and transactions separated into a plurality of statements called projections which operate on only one said atomic data set. Statements such as read commands, write commands, assignment commands, transaction delimiting commands, and projection delimiting commands are executed, and a depends on graph is created during execution of the statements. Projection recovery data is stored during operation. When a statement requests commit the depends on graph is analyzed to determine if the projection is related to another projection in the transaction. The projection is committed if it is not related to another projection and delayed if related to another projection. Likewise, the system determines related projections and aborts them together if a transaction error occurs. The method can recover to a consistent database state after projection abortion.