Abstract: An IC card includes a communication unit, a storage unit that stores a file, and a controller that interprets and executes a command instruction. The controller judges, when a command that instructs to select a dedicated file is input from an external apparatus, whether a certain fixed value is inserted at a predetermined position of the command, starts, when judged that the certain fixed value is inserted in a non-transaction state, transaction processing after accepting the command as a transaction start instruction simultaneous with the selection of the dedicated file, accepts, when judged that the certain fixed value is inserted during the transaction processing.

Abstract: Some embodiments of the inventive subject matter are directed to performing sub-transactions from a long-lived transaction using an identifier, wherein the sub-transactions are required to be completed in a sequence for the long-lived transaction. In some embodiments, the method is further directed to determining that the sub-transactions require a write of a data value to a database, writing in a log, using the identifier, an entry that indicates the data value, detecting an interruption in performing of the write of the data value to the database, and initiating re-performance of the sub-transactions in order of the sequence. Some embodiments are further directed to, during re-performance of the sub-transactions, detecting the data value in the entry of the log using the identifier, and using the data value indicated in the entry of the log to write the data value to the database.

Abstract: A distributed database transaction coordination manager's outcome store may be unavailable to resolve in-doubt transactions locally, e.g., after an unclean detach, during an outcomes store restore, or during a logical database restore. To facilitate transactional consistency, AGEs and values based on them are used. Some code avoids reformatting any closed physical portion for reuse based on the segment's most recently received minimum of persisted AGEs. Some code commits any in-doubt transactions that appear on an aggregate list and aborts any not on the aggregate list. Some code writes each segment's transaction commit records to persistent storage until the segment's persisted-AGE is not less than a common-restore-AGE, and some code resolves any in-doubt transactions based on a harvested outcomes list. Outcomes may reside in a log or a persisted transactions table. A restore checkpoint may include harvested outcomes. Segments may reside on cloud nodes and/or in a shared nothing database system.

Abstract: A graph-based computation has a plurality of nodes representing graph components connected by one or more links representing data flows between the components. Preparing the computation includes: identifying at least a first set of components to process a plurality of transactions in the computation; and associating with a first transaction a first group of one or more data records and data operations corresponding to the data records, and associating with a second transaction a second group of one or more data records and data operations corresponding to the data records. Executing the computation to process at least the first and second transactions includes delaying execution by the first set of components of a data operation corresponding to an initial data record of the second group until after execution by the first set of components of a data operation corresponding to a final data record of the first group.

Abstract: A SEQUENCED request a) to apply a temporal Source table to a temporal Target table under a predicate is received. The Source table includes a plurality of rows that qualify to apply to a single Target table row under the predicate. The predicate specifies a Source table join column. Each of the plurality of Source table rows and the single Target table row include a ValidTime dimension. The plurality of Source table rows is b) ordered by the Source table join column and a period-to-be-modified. The next of the ordered plurality of Source table rows is c) applied by determining that the Target table row has a TransactionTime and, in response, closing out the TransactionTime of the Target table row. Applying the next of the ordered plurality of Source table rows includes identifying an RDIFF range as the period-to-be-modified of the Source table row being applied that is later than the ValidTime range of the single Target table row.

Abstract: Data is transmitted between a first user and a second user via an information technology communications network, in a method comprising the steps of: generating a first hash value for a selected one of the data items; digitally signing and encrypting the first hash value with a secret identifier associated with the first user; transmitting to a second user the encrypted first hash value; receiving and storing the transmitted encrypted first hash value for audit purposes and generating a second hash value for the received encrypted first hash value; encrypting the second hash value with a private identifier associated with a second user and a public identifier associated with the first user; and returning the encrypted second hash value to the first user.

Abstract: Embodiments of the invention are generally directed to a system and method for optimizing transaction termination. A database interface receives an indication to terminate a transaction. The database interface decides whether to send a command to the underlying database server to terminate the transaction. If the database interface does send a command to the database server, it determines which command is appropriate to send.

Abstract: Techniques are provided for extending a business transaction framework to support user-provided compensation logic for business transactions. The extensibility framework may be used to implement user-defined semantics for (a) validating concurrent updates to shared data and (b) performing compensating actions when an associated transaction is aborted. In one embodiment, the extensibility and the compensation are provided at the data-type level. User-provided logic also maintains summaries that include values that are externalized so that they may be referenced in user-provided operational constraints.

Abstract: An embodiment of the invention provides a method for recording, managing and tracking changes to objects in a computer system. A master record is created for the computer system; and, a transactional record is created for an object in the computer system. The master record includes the current status of the object and the current status for all objects associated to the object. The transactional record is updated in the electronic database; and, the master record is updated when the transactional record is updated. The master record is linked to all of the transactional records of the objects associated to the object with the processor. The master record is updated with the processor when a transactional record of the objects associated to the object is updated or added.

Abstract: A computerized system provides automatic generation and sending of advice to a first predetermined individual to help that person's relationship with a second predetermined individual. The advice content is composed and tailored from pre-written text based on the answers to survey questions from those individuals. Also, a gift suggestion system provides gift recommendations to the first predetermined individual to give to the second predetermined individual. One or more distinct invited groups of friends, relatives, provide the recommendations.

Abstract: An association rule accelerator may be used to access a transaction database storing a plurality of transactions, each transaction including one or more items. The association rule accelerator also may select a sampling rate based on an item frequency of frequent items within the transaction database, relative to a sampled item frequency of sampled items within a corresponding sampled transaction database. An an association rule selector may determine, using the selected sampling rate and corresponding sampled transaction database, frequent item sets within the sampled transactions, and may further determine an association rule relating at least two items of the sampled transactions, based on the frequent item sets.

Abstract: A system and article of manufacture maintain the original order of a sequence of transactions originating from a source database and being replicated to a target database. A lockable object is associated with each transaction of the sequence of transactions from the source database. Each transaction has one or more transactional events. The transactions of the sequence of transactions have an order. The order is a commit order of the transactions in the source database. The lockable object is based on the commit order. A lock is attempted to be obtained on one or more lockable objects associated with one or more transactions of the sequence of transactions which precede a particular transaction of the sequence of transactions. In response to being unable to obtain the lock, the one or more transactional events of the one or more transactions which precede the particular transaction are serially processed.

Abstract: Extensions to an application programming framework, such as for example a database system, can allow individual parts of an application to be set to “read-only” during a lifecycle management event affecting the application programming framework. The application data for a newly deployed software version can thereby be adjusted without risk of inconsistencies due to parallel use by end-users. However, end-users can continue to work with the remaining application programming framework and even use certain parts of the application programming framework and underlying data in a “read-only” while these parts are currently under reconstruction as part of the lifecycle management event.

Abstract: Data processing systems and methods are disclosed for providing a payment using a Web service. In one implementation, a first computer is used for entry of data values into respective data entry fields of an electronic data entry form. Further, an identifier of the Web service, such as the uniform resource locator (URL) of the Web service, is entered into the first computer. Next, the first computer initiates data processing for providing the payment that is to be performed by a second computer on the basis of the data values entered into the electronic data entry form. The initiation and/or performance or completion of the data processing is signaled to the Web service by sending corresponding signaling data, which includes payment advice data of the payment. The Web service is coupled to a third computer that receives a result of the data processing from the second computer.

Abstract: A method and apparatus are described for sharing a session to access a database. A database server receives, in a session, a session context identifier and a command. The session context identifier identifies a session context to use for the session. The session context is a set of information or commands that plug into a session state and specify how commands in the session are to be performed for a particular user or privilege level. In response to receiving the identifier, the database server associates the session context with the database session for the connection. The database server uses the session context to process the command. The session context may then be detached from the session, allowing another user to attach to the session via another session context.

Abstract: A database record controls a license to use a computational component. An input receives an order identifier associated with an order related to a computational component and an interface retrieves order information associated with the identifier. The order information comprises at least one material code. A material code mapping agent compares the material code with at least one material code mapping table to identify corresponding computational component information associated with the material code.

Abstract: Method for attaching one or more tables online to a range partitioned table, includes: starting a child transaction; obtaining an exclusive lock on a source table; obtaining an intent exclusive lock on a target table; soft invalidating queries on the target table where compiled form of queries are cached for reuse; attaching the source table(s) to the target table as a new partition(s) of the target table; modifying indices and table structure of the target table to reflect the attaching of the new partition; committing the child transaction; and releasing the exclusive lock and the intent exclusive lock, where concurrently running queries over the target table continue to run without considering the partition until the intent exclusive lock and the exclusive lock are released. Queries on the target table only consider existing partitions when the attaching is in progress. The new partition is available once the attach operation is complete.

Abstract: A TRANSACTION BEGIN instruction and a TRANSACTION END instruction are provided. The TRANSACTION BEGIN instruction causes either a constrained or nonconstrained transaction to be initiated, depending on a field of the instruction. A constrained transaction has one or more restrictions associated therewith, while a nonconstrained transaction is not limited in the manner of a constrained transaction. The TRANSACTION END instruction ends the transaction started by the TRANSACTION BEGIN instruction.

Abstract: Constrained transactional processing is provided. A constrained transaction is initiated by execution of a Transaction Begin constrained instruction. The constrained transaction has a number of restrictions associated therewith. Absent violation of a restriction, the constrained transaction is to complete. If an abort condition is encountered, the transaction is re-executed starting at the Transaction Begin instruction. Violation of a restriction may cause an interrupt.

Abstract: Processing of transactions within a computing environment is facilitated by taking actions to increase the chances of successfully executing a transaction. A counter is maintained that provides a count of how often a transaction has aborted. The counter increments the count each time the transaction is aborted, and it is reset to zero upon successful completion of the transaction or an interruption leading to no more re-executions of the transaction. If the count reaches a threshold value, then an interrupt is presented and transaction execution is unsuccessful. However, before the count reaches the threshold, a number of actions may be taken to increase the chances of successfully executing the transaction. These actions include actions to be performed within the processor executing the transaction, and/or actions to be performed against conflicting processors.

Abstract: Execution of instructions in a transactional environment is selectively controlled. A TRANSACTION BEGIN instruction initiates a transaction and includes controls that selectively indicate whether certain types of instructions are permitted to execute within the transaction. The controls include one or more of an allow access register modification control and an allow floating point operation control.

Abstract: A transaction is initiated via a transaction begin instruction. During execution of the transaction, the transaction may abort. If the transaction aborts, a determination is made as to the type of transaction. Based on the transaction being a first type of transaction, resuming execution at the transaction begin instruction, and based on the transaction being a second type, resuming execution at an instruction following the transaction begin instruction. Regardless of transaction type, resuming execution includes restoring one or more registers specified in the transaction begin instruction and discarding transactional stores. For one type of transaction, the nonconstrained transaction, the resuming includes storing information in a transaction diagnostic block.

Abstract: Processing of transactions within a computing environment is facilitated by taking actions to increase the chances of successfully executing a transaction. A counter is maintained that provides a count of how often a transaction has aborted. The counter increments the count each time the transaction is aborted, and it is reset to zero upon successful completion of the transaction or an interruption leading to no more re-executions of the transaction. If the count reaches a threshold value, then an interrupt is presented and transaction execution is unsuccessful. However, before the count reaches the threshold, a number of actions may be taken to increase the chances of successfully executing the transaction. These actions include actions to be performed within the processor executing the transaction, and/or actions to be performed against conflicting processors.

Abstract: Embodiments are directed to, for a database comprising a set of transactions, with each transaction including an itemset comprising one or more individual items, obtaining a set of all closed frequent itemsets by checking frequencies of transaction sets, wherein a given itemset, I, is frequent where at least some threshold number (?) of transactions contain I, and wherein the given itemset I is closed wherein it is impossible to add any item to I without changing the frequency thereof.

Abstract: Embodiments are directed to, for a database comprising a set of transactions, with each transaction including an itemset comprising one or more individual items, obtaining a set of all closed frequent itemsets by checking frequencies of transaction sets, wherein a given itemset, I, is frequent where at least some threshold number (?) of transactions contain I, and wherein the given itemset I is closed wherein it is impossible to add any item to I without changing the frequency thereof.

Abstract: Parallel certification of transactions on shared data stored in database partitions included in an approximate database partitioning arrangement may be initiated, based on initiating a plurality of certification algorithm executions in parallel, and providing a sequential certifier effect. Logging operations associated with a plurality of log partitions configured to store transaction objects associated with each respective transaction may be initiated, each respective database partition included in the approximate database partitioning being associated with one or more of the log partitions. A scheduler may assign each of the transactions to a selected one of the certification algorithm executions.

Abstract: A system is described for providing a configurable adaptor for mediating systems. The system may include a memory, an interface, and a processor. The memory may store an interaction item, a data mapping, data schemas and binary representations of the data schemas. The interface may communicate with a first system, a second system, and a device. The processor may identify the interaction item describing an interaction between the systems. The processor may generate and process a first and second data schema to generate binary representations of the schemas. The processor may generate a data mapping referencing the binary representations to describe a data transformation between the data formats of the first and second systems. The processor may deploy the binary representations, the data mapping, and the interaction item to a device to enable the device to maintain interaction state, and communicate properly formatted messages between the first and second systems.

Abstract: A method for identifying matching transactions between two log files where each transaction includes one or more statements. Each log file record records the execution of a statement and includes a transaction identifier. Each record in turn in one log file is compared to an advancing window of records in the other log file. A first table contains associations of statements to transactions and transactions to statements for records in the window. If a match is found between a record in the one file and a record in the window, information associating partial transactions in the one file to potential transactions of the records in the window is added to a second table. If an end-of-transaction record is read from the one file, a best match is found between the ended transaction and the potential transactions based on information in the first and second tables.

Abstract: A transactional file system wherein multiple file system operations may be performed as a transaction. An application specifies that file system-related operations are to be handled as a transaction, and the application is given a file handle associated with a transaction context. For file system requests associated with a transaction context, a file system component manages operations consistent with transactional behavior. Logging and recovery are also facilitated by logging page data separate from the main log with a unique signature that enables the log to determine whether a page was fully flushed to disk prior to a system crash.

Abstract: A transaction originator node identifies multiple data elements distributed at multiple enlisted nodes to lock for a transaction managed by the transaction originator node. The transaction originator node determines which of the enlisted nodes is a first enlisted node in a lock order for the transaction and sends an update request to the first enlisted node in the lock order to lock a data element residing at the first enlisted node. The transaction originator node sends update requests to remaining enlisted nodes in the lock order to cache the update requests until the remaining enlisted nodes receive a message to perform a lock.

Abstract: The present invention provides a method and system for using an operating system level I/O filter driver for providing transparent database transaction log file redundancy. In accordance with the method, the I/O filter driver intercepts a database management system request to write data to the database transaction log file. The I/O filter driver writes the data to at least two transaction log files.

Abstract: A method for identifying matching transactions between two log files where each transaction includes one or more statements. Each log file record records the execution of a statement and includes a transaction identifier. Each record in turn in one log file is compared to an advancing window of records in the other log file. A first table contains associations of statements to transactions and transactions to statements for records in the window. If a match is found between a record in the one file and a record in the window, information associating partial transactions in the one file to potential transactions of the records in the window is added to a second table. If an end-of-transaction record is read from the one file, a best match is found between the ended transaction and the potential transactions based on information in the first and second tables.

Abstract: Processing proposed changes to data includes notifying a server of a proposed change to master data, receiving, from the server, an indication as to whether there is a concurrent change to the master data, where the concurrent change corresponds to a change to the master data in addition to the proposed change, and deciding whether to make the proposed change or to abort the change.

Abstract: A transaction processing device including: a representative key decision portion for deciding a representative key to be any one of the keys of every record of a record group as an object for maintaining consistency in a transaction process; a log compilation portion for updating a subordinate log by adding consistence object information indicating the object for maintaining the consistency to the subordinate log other than a representative log corresponding to the representative key among the logs corresponding to every record of the record group; a log update portion for updating the representative log by writing update information for every record of the record group into the representative log; and a record update portion for updating every record by reflecting the update information written into the representative log in the every record of the record group.

Abstract: Embodiments of the invention provide systems and methods for providing summarizations of data and transactions based on the status of the summarization and the data and transactions being summarized. According to one embodiment, a method for providing summarizations of data and transactions related to one or more applications can comprise initiating a first summarization of the data and transactions related to the one or more applications. The first summarization can be paused in response to a request to evaluate the data and transactions being summarized. Data and transactions available for summarization can be evaluated in response to and based on the request. The first summarization can be resumed upon a completion or a timeout of the evaluating of the data and transactions being summarized.

Abstract: Establishment of an exclusive lock on each of an outer database ownership table and an inner database ownership table is attempted. In response to establishing the exclusive lock on each of the outer database ownership table and the inner database ownership table, a switch is made to a pair of overlapping shared locks on each of the outer database ownership table and the inner database ownership table. Release and re-acquisition of each of the pair of overlapping shared locks on the outer database ownership table and the inner database ownership table is alternated.

Abstract: Method, system, and computer program product for transferring data from transactional data sources to partitioned databases are provided. One or more messages from a transactional data source are read. Each message includes one or more records to be inserted into a database comprising a plurality of partitions. One of the partitions of the database in which the one or more records of each message are to be inserted is then identified. A transaction is initiated to insert the one or more records of each message into the one partition and to delete the one or more messages from the transactional data source. The transaction is committed only when insertion of the one or more records of each message into the one partition and deletion of the one or more messages from the transactional data source succeed.

Abstract: An information processing system includes a plurality of edge nodes to provide services relating to files, and a core node communicatively coupled to each of the edge nodes and configured to send or receive data of the files to or from the edge nodes and to manage the data of the files. Any one of the edge nodes is granted a first access right permitting update of the files, whereas any two or more of the edge nodes are granted a second access right to prohibit update of the files. The core node stores the access right granted to each of the edge nodes. When detecting that a failure has occurred in the edge node granted the first access right, the core node sends one of the edge nodes granted the second access right a first instruction to take over the first access right granted to the failed edge node.

Abstract: A technique for making versions of rows of a user-defined tracked table temporally queryable. The database management system of the technique permits temporal queries of user-defined tables. The queries return versions of rows in the user-defined table that are currently in an undo log maintained by the database system. Associated with the tracked table are a system history table which contains versions of the rows and temporal metadata indicating when the versions were in the tracked table and a system form history table which contains versions of the form of the tracked table and metadata indicating when the tracked table had the form. These tables are created and maintained by a background process in the database management system. A temporal query on the tracked table combines results from the undo log with results from the system history table. The results' form is determined by the system form history table.

Abstract: An improved data access layer (DAL) architecture enables database connection pooling or multiplexing across machine boundaries. Drivers installed at web servers communicate with servers in a DAL. The DAL servers present a virtual database to the web servers, and the DAL servers in turn open connections to a set of physical databases. DAL servers are able to recycle connections that are no longer needed, or to move available connections from one DAL server to another, so as to provide improved efficiency in connection management, burst management, and peak load management. Scalability is thereby improved, and more efficient use of system resources is facilitated.

Abstract: A computer-implemented method, a computer-readable medium and a system are provided. A transaction master for each of a plurality of transactions of a database is provided. Each transaction master is configured to communicate with at least one transaction slave to manage execution of a transaction in the plurality of transactions. Each transaction master configured to perform generating a transaction token to specify data to be visible for a transaction on the database, the transaction token including a transaction identifier for identifying whether the transaction is a committed transaction or an uncommitted transaction, receiving a request to commit the transaction, initiating, based on the request, a two-phase commit operation to commit the transaction.

Abstract: Systems and methods are provided for providing an automated validity check of transaction data postings. In one implementation, a method is provided that includes entering at least one code for specifying at least one posting to be performed for a transactional data processing operation. The method may also include starting the transactional data processing operation, sending a request to a service component for performing a validity check of the at least one code, buffering one or more posting requests resulting from execution of the transactional data processing operation. Further, the method may include sending, in response to receipt of a first signal indicative of code validity from the service component, the one or more buffered posting requests with the at least one code to a posting component.

Abstract: A system and method for centrally processing content, independent of an end user application. The method includes receiving a request for information from one or more end user applications and retrieving all pieces of content, associated with the request, from one or more repositories. The method further includes centrally processing the pieces of content independent of the one or more applications to determine which content is relevant to request and exposing the relevant content to the one or more applications based results of the processing.

Abstract: A node a data grid receives a prepare request identifying data to lock for a first transaction. The prepare request indicates a locking order that is different from a locking order indicated by a prior prepare request of a second transaction using the same data. The node identifies keys that correspond to the data. The keys are co-located on the node. The node ranks the keys to define an order for acquiring locks for the data based on key identifiers that correspond to the keys. The defined order matches a locking order used by the second transaction. The node acquires locks for the data using the defined order.

Abstract: Embodiments of a method are described. In one embodiment, the method is a method for executing and supporting transactions. The method includes receiving a transaction comprising a command and data. The method includes writing the data to a transaction manager on a persistent memory device. The transaction manager also maintains a status of the transaction and reference to entries within memory that are manipulated by the transaction. The method also includes creating an in-memory log of the transaction in a first hash directory. The method includes committing a copy of the first hash directory to a second hash directory maintained on a persistent memory device.

Abstract: A system for processing a transaction is disclosed. The system comprises a processor and a memory. The processor is configured to check a condition using data in a first database, wherein the data is associated with a transaction, wherein the data in the first database is latched before checking the condition and is unlatched after checking the condition. The processor is further configured to indicate to a second database to check the condition using data in the second database, wherein the data is associated with the transaction. The data in the second database is latched before checking the condition and is unlatched after checking the condition. The memory is coupled to the processor and configured to provide the processor with instructions.

Abstract: A method and a distributed locking system for the management of lock resources in a distributed files system having several lock managers, each managing lock resources in its respective domain. Each lock manager maintains a registry lock file that comprises of a list of all locked files and a list of lock requests. The registry lock files of all lock managers in the distributed locking system are saved in a central database. Furthermore, the system enables concurrent locking operations of different file sharing protocols on the same file system resources.

Abstract: A system and method for efficiently accessing large data storage subsystems with a different file format than a format used by running applications. A backup server is coupled to a data storage medium, and is configured to store data on the data storage medium according to a first file format. A client is coupled to the backup server and is configured to convey memory access requests for data stored in the data storage medium. The client is unable to decipher the first file format. A filter driver in the backup server is coupled to intercept the requests from the client. The filter driver is configured to decipher the first file format; spoof the existence of one or more spoofed files that do not exist on the data storage medium, wherein each of the one or more spoofed files corresponds to data stored on the data storage medium; and present the spoofed files to the client.

Abstract: Techniques are provided for extending a business transaction framework to support user-provided compensation logic for business transactions. The extensibility framework may be used to implement user-defined semantics for (a) validating concurrent updates to shared data and (b) performing compensating actions when an associated transaction is aborted. In one embodiment, the extensibility and the compensation are provided at the data-type level. User-provided logic also maintains summaries that include values that are externalized so that they may be referenced in user-provided operational constraints.

Abstract: The present invention relates to a method and a system for replaying full scale Production Database workload using Network or Kernel Capture. In one embodiment, the capture of the Server workload is done using Network Capture or using Kernel drivers. The captured workload is then pre-processed and Replayed to a test system along with full transactional integrity.