Entries |
Document | Title | Date |
20100070480 | SYNCHRONIZING FIELD VALUES IN AN ON-DEMAND DATABASE PRIOR TO COMMITTING A CHANGE - Methods and systems are provided for synchronizing field values in transient data objects, such as JAVA® objects, before saving a transaction to a database. A dependency from one data object to another data object is detected, and changes which affect the second data object's fields through the dependency are flowed through to the second data object. This is performed between each step of a multistep save process, such between triggers, validation rules, workflows, and the final committing of data to the database. | 03-18-2010 |
20100121829 | PERSISTENCE LAYER - A system and method to separate business processing from data handling. A persistence layer resides between an application and a database. The persistence layer receives updates from the application and stores them in a memory delaying writeback to the database to a later time. | 05-13-2010 |
20100121830 | IDENTIFYING SCREEN FLOWS TO SUPPORT MULTIPLE ENTITIES AND THEIR DIVERSE RULES WITH A SINGLE APPLICATION INSTANCE - A method and a system for identifying screen flows. An instance of an application utilized by a first entity locates a first key in a first table to identify a first procedure. The same instance of the application utilized by a second entity locates a second key in the first table to identify a second procedure. Using the first procedure, a method and a parameter set based on rules of the first entity are located in a second table. Using the second procedure, the method and a parameter set based on rules of the second entity are located in the second table. The method is executed with each of the parameter sets to identify a first screen flow for the first entity and a second screen flow for the second entity. The first screen flow includes data elements that are different from data elements included in the second screen flow. | 05-13-2010 |
20100153351 | TECHNIQUES FOR REAL-TIME DATABASE PROCESSING - Techniques for real time data processing are provided. Unprocessed database transactions are represented in messages that are captured in files and stored in directories. The order of the files can be user-defined within the directory. The files are then processed to committed transactions that are committed to a database for updating. Checkpoints can occur at user-defined or data-driven points for failover recovery processing. | 06-17-2010 |
20100174694 | TRANSACTION-CONTROLLED GRAPH PROCESSING AND MANAGEMENT - A method, system, and computer program product for transaction-controlled graph processing and management are provided. The method includes notifying an external component of a database management system (DBMS) controlled transaction including multiple operations, and acquiring a DBMS transaction identifier associated with the transaction at the external component. The method further includes storing the DBMS transaction identifier as an external component transaction identifier, and receiving notification at the external component of events associated with the operations. The method additionally includes monitoring the events for an end-of-transaction operation, and passing notification of the end-of-transaction operation to an external routine. | 07-08-2010 |
20100211554 | TRANSACTIONAL RECORD MANAGER - Transactional record management methods and systems enabling multiple independent servers (such as database servers) using shared storage to initiate transactions in parallel without inter server communication and without locking the records used by the transaction. The in-flight transactions can be included in a shared transaction log without a final determination of whether the transaction committed. The log updates can be broadcast to each of the servers, which each parse the log, using the same rules of analysis, and therefore each compute server can independently and asynchronously come to the same conclusion as to which transactions aborted and which transactions committed. | 08-19-2010 |
20100211555 | EFFICIENT INTEGRATION BETWEEN AN EXTERNAL WORKLOAD MANAGER AND AN RDBMS - According to one embodiment of the present invention, a system, method and computer program product is provided for integrating an external workload manager with a database system. The method according to one embodiment includes a method comprises: receiving a request in a database component, the request including a cross component token; starting a new unit of work in workload management software in the database component, in response to the request; determining, from a cross component workload management unit, a transaction class and a synchronization code using the database component; finding an internal workload in the workload management software that matches the transaction class and the synchronization code of the cross component workload management unit; and using the matching internal workload for the new unit of work. | 08-19-2010 |
20100235335 | COLUMN-STORE DATABASE ARCHITECTURE UTILIZING POSITIONAL DELTA TREE UPDATE SYSTEM AND METHODS - A column-store database computer system responsive to database requests for the update and retrieval of data from within a stable data table providing for the storage of database tuples within a column-store organized database structure. A positional delta tree data structure is implemented in the memory space of the computer system and is operatively coupled in an update data transfer path between a database engine interface and the stable data table. The positional delta tree data structure includes a differential data storage layer operative to store differential update data values in positionally defined relative reference to database tuples stored by the stable data table. | 09-16-2010 |
20100250505 | SYSTEMS AND METHODS FOR PROCESSING DATA OBJECTS - A system and method for processing data objects is provided. The system and method may comprise: a data object database for storing data objects, a transaction document database for storing transaction documents, a fast data provider module configured to provide, upon request from a user interface module, data objects to the user interface module; a user transaction provider module configured to read changed data objects from the user interface module, read data objects from the fast data provider module, and store changed data objects in a user transaction document; and a business transaction provider module to read changed data objects from the user transaction document and perform updates of the changed data objects based on the user transaction document. | 09-30-2010 |
20100250506 | SYSTEMS AND METHODS FOR PROCESSING DATA OBJECTS - A system and method for processing data objects is provided. The system and method may comprise a user interface module, a fast data provider module, and a transaction provider module, which modules are configured to exchange data and which may be distributed over a plurality of interconnected servers. Data objects may be statelessly read from a database by the fast data provider module and, after an amendment of the data via the user interface module, statefully saved by the transaction provider module. | 09-30-2010 |
20100281006 | SYSTEM AND METHOD FOR SUSPENDING TRANSACTIONS BEING EXECUTED ON DATABASES - A database management system managing one or more databases to suspend access to at least one selected database by one or more processes or applications (e.g., message processing programs, batch messaging programs, etc.). In some instances, the one or more databases may include one or more IMS databases. Access to the at least one selected database may be suspended to enable one or more operations to be performed on the at least one selected database by the database management system and/or an outside entity (e.g., a user, an external application, etc.). For example, the one or more operations may include an imaging operation, a loading operation, an unloading operation, a start operation, a stop operation, and/or other operations. In some instances, access to the at least one selected database may be suspended without canceling transactions being executed by the one or more processes or applications on the selected at least one database. | 11-04-2010 |
20100318503 | SYSTEMS AND METHODS FOR REORGANIZING A DATABASE OBJECT - The invention is a reorganization system having a reorganization application, a database management system, and one or more database files. The reorganization application communicates with the database management system and the one or more database files to reorganize an object, such as, for example, a table or index, while providing one or more clients substantially continuous access to the object. The reorganization application employs one or more trigger locks to synchronize the data in an original table and a reorganized table. The one or more trigger locks block select data modification operations while allowing one or more read-only operations and structural modification operations. | 12-16-2010 |
20110029498 | System and Method for Subunit Operations in a Database - A method for processing a transaction request at a database load balancer is disclosed. The method comprises receiving the transaction request, where the transaction request is comprised of one or more operations to be performed upon a database; analyzing the transaction request to determine the one or more operations; analyzing the transaction to determine one or more database units associated with the operations; analyzing the transaction requests and the one or more database units to determine one or more database subunits associated with the database units that the transaction request will perform one or more operations upon; associating one or more database locks with each of the one or more operations; analyzing one or more of the database locks to determine one or more sequence numbers associated with each of the one or more operations; and transmitting one or more unique identifiers for each of the database subunits, the one or more operations with the associated database locks and the sequence numbers to one or more database servers accessible to the database load balancer. Systems, apparatus and computer programming associated with or implementing the method are also disclosed. | 02-03-2011 |
20110055181 | Database Quiesce Operations - A technique to quiesce a database without causing after-arriving access requests to abnormally terminate interrogates database management system control structures associated with the database. Specified modifications to these control structures can be made so that subsequent access requests to the database (i.e., during quiesce operations) are not abnormally terminated. Once quiesced, regular or special purpose maintenance or testing operations, the starting or stopping of log keeping operations or similar operations may be made to the database. Once these are complete, the database control structures may be updated again to permit pending/scheduled access requests to proceed. | 03-03-2011 |
20110113021 | FILE SYSTEM FILTERS AND TRANSACTIONS - Aspects of the subject matter described herein relate to file system filters and transactions. In aspects, a filter may enlist to receive notification of events associated with a transaction. Afterwards, the filter may receive notification of a transaction event for which it has enlisted. In response to receiving notification of the transaction the filter may perform an action as appropriate. Aspects of the subject matter described herein may be applied to stacked and managed filters. | 05-12-2011 |
20110145209 | ATOMIC DELETION OF DATABASE DATA CATEGORIES - A device may maintain, in a database, a plurality of data items, each data item of the plurality of data items being associated with a respective category and supplemental information relating to deletion of the data item. The device may associate a group of counters with at least one of the categories and receive a deletion request corresponding to one of the group of categories, the deletion request including the supplemental information. The device may identify a counter associated with the category corresponding to the deletion request based on the supplemental information. The device may then increment the identified counters and selectively delete the data items based on values of the counters. | 06-16-2011 |
20110179000 | DATABASE SYSTEM PROVIDING HIGH PERFORMANCE DATABASE VERSIONING - A database system providing high performance database versioning is described. In one embodiment, for example, in a database system employing a transaction log, an improved method of the present invention is described for restoring databases to a consistent version, the method comprises steps of: providing a shared cache storing database blocks for use by multiple databases; for a read-only transaction of a given database, creating a cache view of the shared cache using the given database's transaction log, the cache view comprising particular database blocks of the shared cache that record a view of a particular version of the database at a given point in time; creating a shadow cache for storing any database blocks that overflow the cache view; and in conjunction with the cache view and the shadow cache, preserving a logical undo operation for the read-only transaction of the given database, so as to allow the given database to be restored to a transactionally consistent version upon starting the read-only transaction. | 07-21-2011 |
20110225132 | Provisioning Method and Sytem - A method and system of provisioning one or more Network Elements, as well as a method and apparatus for resuming a failed Customer Service Order for provisioning one or more Network Elements, is disclosed. A provisioning logic framework receives a Customer Service Order CSO from a Business Support System, calls respective provisioning logic for performing said Customer Service Order and detects if the received Customer Service Order is a CSO to be resumed. During the performing time of said Customer Service Order, historical processing data is stored. If it is detected that the received Customer Service Order is a CSO to be resumed, the provisioning logic framework builds up a fake environment on the basis of historical processing data stored previously for the CSO to be resumed. Then the successful part of the CSO is directed to the fake environment and the uncompleted part of the CSO is directed to actual Network elements. | 09-15-2011 |
20110238641 | System with multiple conditional commit databases - 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. | 09-29-2011 |
20110246434 | METHODS AND SYSTEMS FOR BULK UPLOADING OF DATA IN AN ON-DEMAND SERVICE ENVIRONMENT - Methods and systems for bulk uploading of data in an on-demand service environment are described. In one embodiment, such a method includes retrieving a bulk transaction request from a transaction queue within a host organization, where the bulk transaction request specifies a plurality of database transactions to be processed against a multi-tenant database system of the host organization. Such a method further includes determining a current computational load of the multi-tenant database system, processing a subset of the plurality of database transactions specified by the bulk transaction request against the multi-tenant database system when the current computational load is below a threshold, and updating a bulk transaction results log based on the subset of the plurality of database transactions processed. Remaining database transactions specified by the bulk transaction request may then be re-queued for later processing. | 10-06-2011 |
20110270812 | Extended Transactions - Multiple atomic “component” database transactions are combined into a single extended transaction through message passing. The multiple component transactions that comprise a single extended transaction may, in combination, perform a single computation. The component transactions may pass messages to each other by writing and reading records to and from one or more databases. The resulting extended transaction may be distributed and/or long-lived. | 11-03-2011 |
20110302142 | STORAGE SYSTEM FORMAT FOR TRANSACTION SAFE FILE SYSTEM - A transaction safe file system uses two sets of file allocation tables and bitmap images to perform file modifications on one of the sets while the other set remains a last known good set. After a modification is complete, a pointer is changed to the newly modified set, and the newly modified set becomes the last known good set. The sets are then synchronized. The file allocation table is used to define cluster chains while the bitmap image is used to determine if a cluster is free or not. In some operations, only the bitmap image may need to be manipulated. The file system may be used in a transaction safe mode as well as a non-transaction safe mode. | 12-08-2011 |
20110313983 | OPTIMIZED STARTUP VERIFICATION OF FILE SYSTEM INTEGRITY - A computer system having a transaction based file system is disclosed. The computer system includes file system software that manages the file data and the file system structure of files stored on a persistent data storage device and maintains a transaction file that includes a plurality of transaction records. The file system software executes a startup process in which a reconstructed file system is generated in random access memory from the transaction records. The startup process may skip verification of some of the transactions. The file system software may error check at least one of the skipped transactions in response to a request to access a file identified by a file node record in the reconstructed filed system after the startup process is completed. | 12-22-2011 |
20110320419 | Management of temporal data by means of a canonical schema - Computer programs embodied in computer-readable media for managing temporal data in relational databases are provided. According to one embodiment, a computer program comprises logic for storing temporal data in tables stored in a database and using a single schema. The schema includes a first column designating an identifier of an object represented in a row of a table and columns designating an effective-time period. For a past effective-time period, the state of the object as it existed is described by atemporal data in the row. For a present effective-time period, the present state of the object is described. For a future effective-time period, the state of the object as it will exist is described by the atemporal data. Additional logic stores additional data in the tables, such as business data describing the state of the object. | 12-29-2011 |
20110320420 | Decentralized, distributed internet data management - In a light-weight transactional system architecture, each component providing a service performs its own scheduling and transaction management. An invocation of one of these services (through remote method invocation) results in the creation of a local transaction (child of the invoking transaction and parent of any transaction that might be triggered by invoking the services of other servers). The information that is required to build a global composite transaction is implicitly added by the system to each call. Each transaction is, however, independently handled at each server. That is, the servers neither communicate among themselves nor rely on a centralized component to make scheduling or recovery decisions. In this way, components can be dynamically added or removed from the system without compromising correctness. Regardless of the configuration, the system according to the invention guarantees that transactions executed over these servers are correct and recoverable at a global and local level. | 12-29-2011 |
20120005174 | METHOD AND A SYSTEM FOR REPLAYING DATABASE WORKLOAD WITH TRANSACTIONAL CONSISTENCY - 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. | 01-05-2012 |
20120005175 | METHOD AND A SYSTEM FOR REAL TIME REPLAYING OF DATABASE WORKLOAD AT A FIXED INITIAL TIME DELAY - A method to continuously replay Production Database Workload in near real time using workload capture based on Network or Kernel Capture is provided. The capture of the Server workload is done using Network Capture or using Kernel drivers in a continuous round robin method. The captured data is continuously pre-processed followed by a continuous replay of that data to a Test database system, with the replay lagging the original workload by a fixed initial time delay. | 01-05-2012 |
20120016853 | EFFICIENT AND CONSISTENT SOFTWARE TRANSACTIONAL MEMORY - A method and apparatus for efficient and consistent validation/conflict detection in a Software Transactional Memory (STM) system is herein described. A version check barrier is inserted after a load to compare versions of loaded values before and after the load. In addition, a global timestamp (GTS) is utilized to track a latest committed transaction. Each transaction is associated with a local timestamp (LTS) initialized to the GTS value at the start of a transaction. As a transaction commits it updates the GTS to a new value and sets versions of modified locations to the new value. Pending transactions compare versions determined in read barriers to their LTS. If the version is greater than their LTS indicating another transaction has committed after the pending transaction started and initialized the LTS, then the pending transaction validates its read set to maintain efficient and consistent transactional execution. | 01-19-2012 |
20120023078 | NON-DESTRUCTIVE DATA STORAGE - Non-destructive data storage is disclosed. An information change is stored that is associated with a business object such that tracking of the information change is enabled with respect to one a transaction time and/or an effective time. The stored information change is accessed with respect to a time. | 01-26-2012 |
20120023079 | METHOD OF XML DOCUMENT MANAGEMENT TO SELECTIVELY CANCEL SPECIFIC PAST OPERATION AND SYSTEM USING THE SAME - Disclosed are an XML document management method for cancelling a specific past operation, and a system using the same. The method comprises identifying an original operation to be cancelled, identifying an XML resource to be cancelled, identifying a previous value of the XML resource to be cancelled, identifying a next value of the XML resource to be cancelled, configuring a cancel operation, and applying the cancel operation to the XML resource to be cancelled. | 01-26-2012 |
20120030184 | DISTRIBUTED DATABASE SYSTEM UTILIZING AN EXTENDED TWO-PHASE-COMMIT PROCESS - A distributed database system is provided in which a commit coordinator ensures that transactions spanning multiple database instances are committed or rolled back consistently. The commit coordinator utilizes an extended two-phase-commit process. The extension of the two-phase-commit process enables, that if within the distributed database cohorts store redundant data for a productive operation, only one of the cohorts out of a redundancy group are required. By this, the distributed database is prepared to continue operation even during shutdown or failure of single cohorts. Related apparatus, systems, techniques and articles are also described. | 02-02-2012 |
20120066189 | CONTROLLING AND RECOVERING LONG-LIVED TRANSACTIONS - Some embodiments of the inventive subject matter are directed to performing sub-transactions of a long-lived transaction (LLT) in a sequence (e.g., according to an LLT flow) and writing a log entry at the performance of each of the sub-transactions that specifies results of the sub-transaction. Some embodiments do not require generating any compensating transactions during performance of the sub-transactions. Some embodiments are further directed to detecting that an interruption occurs to the LLT and repeating, or initiating re-performance of the LLT from the beginning of the sequence following the flow of the LLT from its beginning. During the re-performance of the LLT, some embodiments are further directed to checking the log entry at each sub-transaction to determine whether the sub-transaction was performed successfully before the interruption. If the log indicates that the long-lived transaction completed successfully, some embodiments are further directed to skipping performance of the sub-transaction until reaching a sub-transaction that does not have a valid log entry, then returning an error and recovering the LLT using instructions for compensating transactions that are already written into the LLT flow. | 03-15-2012 |
20120066190 | HANDLING FILE OPERATIONS WITH LOW PERSISTENT STORAGE SPACE - In some embodiments, a file management unit located in the operating system detects a write operation that writes the data blocks within the consistency snapshot (in main memory) to the persistent storage. The file management unit can then determine that all transactions have been completed before the write operation begins. In some instances, the file management unit then attempts to write the data blocks within the consistency snapshot to the persistent storage. The file management unit can then receive a notification that the write operation did not successfully write the data blocks from the consistency snapshot to the persistent storage. In some embodiments, the write operation is not successful because there are fewer free data blocks in the persistent storage than needed for writing the data blocks within the consistency snapshot to persistent storage. The file management can then wait a period of time. After the file management unit has waited for a period of time, it can make another attempt to write the data blocks within the consistency snapshot to the persistent storage. | 03-15-2012 |
20120078865 | DYNAMIC CONFIGURATION OF A PERSISTENCE PROVIDER - Provided are techniques for updating a physical data structure type. A persistence provider is updated with dynamic configuration data for the updated physical data structure type while an application is executing. The application that is executing is allowed to access the updated physical data structure type using the updated persistence provider to map an application level object type to the updated physical data structure type without restarting the application. | 03-29-2012 |
20120084273 | Accelerated Transactions With Precommit-Time Early Lock Release - A system, method and computer product for accelerating parallel database transactions. One or more data processors execute a first transaction on a database. The first transaction includes a transactional lock associated with each of one or more records to update the one or more records during the first transaction, and a pre-commit command to request acknowledgement of committing the updating of the one or more records during the first transaction. The one or more data processors execute a second transaction on the database in parallel with the first transaction. The second transaction includes a transactional lock associated with each of one or more records to update the one or more records during the second transaction, and a pre-commit command to request acknowledgement of committing the updating of the one or more records during the second transaction. The transactional locks of the first and second transactions are released before flushing log records associated with the first and second transactions. | 04-05-2012 |
20120084274 | Distributed Transaction Management With Tokens - A system, method and computer product for managing distributed transactions of a database. A transaction manager is provided for each of a plurality of transactions of the database. Each transaction manager is configured to perform functions that include generating a transaction token that specifies data to be visible for a transaction on the database. The database contains both row and column storage engines, and the transaction token includes a transaction identifier (TID) for identifying committed transactions and uncommitted transactions. A last computed transaction is designated with a computed identifier (CID), record-level locking of records of the database is performed using the TID and CID to execute the transaction, and the plurality of transactions of the database are executed with each transaction manager. | 04-05-2012 |
20120095974 | DATABASE SYNCHRONIZATION AND VALIDATION - Systems and methods for verifying data in a distributed database using different automated check operations at different times during the database read and update cycles. Various functions may be performed including executing a first check during update operations of the database. A second check may also be executed during the update operation of the database, and be implemented as an execution thread of an update daemon. A third check may be executed at a time interval between update functions of the update daemon. A fourth check may be executed during a time that the database is not being updated. Integrity of data in the database may be verified by a computer processor based on the first, second, third, and fourth checks. | 04-19-2012 |
20120102006 | DISTRIBUTED TRANSACTION MANAGEMENT FOR DATABASE SYSTEMS WITH MULTIVERSIONING - The subject disclosure relates to a distributed transaction management technique that ensures synchronization between participating nodes in a global or distributed database transaction. The technique leverages a commit protocol that uses local clocks at the respective participating nodes. Participants in a global transaction are configured to utilize the same commit timestamp and logical read time and can advance their respective local clocks to establish this synchronization. In one embodiment, distributed commit utilizes a modified version of two-phase commit that includes an extra phase to collect commit timestamp votes from participants. Additionally, a heartbeat mechanism can be used to establish loose synchronization between nodes. In another embodiment, a node can respond to a remote transaction request by returning a list of nodes involved in generating the result of the transaction and the types of access used by such nodes in addition to the transaction result itself. | 04-26-2012 |
20120109917 | SYSTEM AND METHOD FOR SYNCHRONOUSLY UPDATING A HIERARCHY BRIDGE TABLE - A method for maintaining a hierarchy bridge table consistent with a corresponding hierarchy table includes listening for a transaction, having a start boundary and an end boundary, on the hierarchy table; and upon detecting and identifying the transaction, directing execution of an update method on the bridge table, where the update method is completed within the boundaries of the transaction using the identity of the transaction and a state of the bridge table at the start boundary of the transaction. | 05-03-2012 |
20120109918 | MULTI TRANSACTION CONTROL SYSTEM WITH UPDATE ACCESS COUNTER OWNED BY THE TRANSACTION PROCESS AT THE START POINT TO KEEP TRANSACTION CONSISTENCY - To achieve a multi-transaction processing system which assumes real-time update having practical throughput being a requirement, in multi-transaction processing in which consistency should be maintained. An update access-counter technology is applied which assumes a time when a counter is returned to an initial value depending on the up-down counting of the counter identified by a process ID of a process that is a starting point of multi-transaction processing being the completion of one multi-transaction processing, thus solving the problem. | 05-03-2012 |
20120109919 | HIGH AVAILABILITY DATABASE MANAGEMENT SYSTEM AND DATABASE MANAGEMENT METHOD USING SAME - Provided is a method of managing a database (DB) using a high availability database management system (DBMS), which continuously provides a service when an error occurs in the DBMS. The DB management method in the high availability DBMS including a plurality of broker nodes and a plurality of server nodes may include an operation (a) to enable one of the plurality of broker nodes to access a main server node of the plurality of server nodes when a DB change request is received from an application server, and an operation (b) to enable the main server node to process the DB change request when the broker node succeeds in accessing the main server node, and to enable the broker node to access one of sub-server nodes so that the sub-server node processes the DB change request when the broker node fails to access the main server node due to an error in the main server node. | 05-03-2012 |
20120124021 | TRANSACTION LOG MANAGEMENT - Managing a log-full condition of a transaction log in a transaction processing system, where the transaction log has a plurality of log records each associated with a particular transaction. When a log-full condition is detected, the active transaction having the oldest log entry of all active transactions is identified and logging for all transactions except for the identified transaction is temporarily suspended. A dynamic transaction backout of the identified transaction is initiated, with the writing of a backout record for the identified transaction to the log being delayed. Confirmation that the backout has completed is awaited before trimming the log. Then the delayed backout record for the identified transaction is written to the log, and normal logging is resumed. | 05-17-2012 |
20120150829 | Asynchronous Deletion of a Range of Messages Processed by a Parallel Database Replication Apply Process - Mechanisms are provided for replicating transactions at a source database node on a target database node of the data processing system. A transaction message, for a transaction, is stored in a receive queue data structure of the target database node. An agent thread applies a change to data of the target database node based on a specification of the change in the transaction message. An identifier of the transaction message is stored in a done message data structure of the target database node and the identifier of the transaction message is also stored in a prune queue data structure of the target database node. A prune thread determines if a contiguous range of identifiers of transaction messages equal to or greater than a predetermined batch size is present in the prune queue data structure. If so, then a range of transaction messages is deleted from the done message data structure. | 06-14-2012 |
20120158680 | DATABASE SYSTEM PROVIDING HIGH PERFORMANCE DATABASE VERSIONING - A database system providing high performance database versioning is described. In a database system employing a transaction log, a method for restoring databases to a consistent version including creating a cache view of a shared cache and performing undo or redo operations on the cache view only when a log sequence number falls within a certain range. | 06-21-2012 |
20120166407 | Distributed Transaction Management Using Two-Phase Commit Optimization - 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. The two-phase commit operation includes preparing for committing the transaction, writing a committed transaction to a memory, optimizing the two-phase commit operation by omitting a phase of the two-phase commit operation, generating an acknowledgement of the committed transaction. The plurality of transactions of the database are executed with each transaction master. | 06-28-2012 |
20120179659 | INTELLIGENT CLIENT ARCHITECTURE COMPUTER SYSTEM AND METHOD - A collision detection and data synchronization mechanism operates to expand the speed and capability of distributed applications. The execution environment employs collision detection and data synchronization to distribute data objects to appropriate network nodes to support local processing. The collision detection and data synchronization mechanism defines the set of processes and algorithms used to track distributed data objects and to manage changes to the distributed objects throughout a network of intelligent computing devices. Data and code are distributed to local computing devices necessitating tracking and synchronizing updates. The system and method ensures that data updates received during the course of a local transaction do not unwillingly affect the results of other transactions by notifying the local computing devices of changes to the data that are subject of the transaction. These conflicts are then resolved in the applications, and notification of the resolution is sent to the remaining intelligent computing devices. | 07-12-2012 |
20120185451 | DATA PROCESSING METHOD AND SYSTEM FOR DATABASE MANAGEMENT SYSTEM - A data processing method and system for a database management system are provided. The database management system can reduce the number of log records to be processed and increase database processing speed by selectively assigning a “no log” attribute to a data table at the time of database creation and skipping log recording for data items having the “no log” attribute at the time of database processing. The data processing method includes identifying one or more attributes assigned to a column of a data table associated with a data item changed during processing of a transaction, writing, when the one or more attributes of the column include a “log” attribute, log records for the transaction to a disk, and skipping, when the one or more attributes of the column include a “no log” attribute, log recording for the transaction. | 07-19-2012 |
20120191679 | DATABASE SERVER APPARATUS, METHOD FOR UPDATING DATABASE, AND RECORDING MEDIUM FOR DATABASE UPDATE PROGRAM - A database server apparatus including: a data storage unit configured to store data; a committing procedure information storage unit configured to store committing procedure information for committing each of a plurality of transactions that updates data stored in the data storage unit; a data creating unit configured to create yet-to-be-committed update data from the stored data by executing a transaction for updating the data upon receipt of the transaction; a determining unit configured to determine whether there is a committed transaction that creates committed data as source update data before the transaction executed by the data creating unit is committed; and a committing unit configured to commit the transaction for re-updating the yet-to-be-committed update data in accordance with the committed data and the committing procedure information, when the determining unit determines that there is the committed transaction. | 07-26-2012 |
20120191680 | Asynchronous Deletion of a Range of Messages Processed by a Parallel Database Replication Apply Process - Mechanisms are provided for replicating transactions at a source database node on a target database node of the data processing system. A transaction message, for a transaction, is stored in a receive queue data structure of the target database node. An agent thread applies a change to data of the target database node based on a specification of the change in the transaction message. An identifier of the transaction message is stored in a done message data structure of the target database node and the identifier of the transaction message is also stored in a prune queue data structure of the target database node. A prune thread determines if a contiguous range of identifiers of transaction messages equal to or greater than a predetermined batch size is present in the prune queue data structure. If so, then a range of transaction messages is deleted from the done message data structure. | 07-26-2012 |
20120191681 | FAILURE TOLERANT TRANSACTION PROCESSING SYSTEM - The present invention proposes a system for resending a process to a backup server farm from a client without waiting for the failure-detection, if no reply is received for a certain time. The transaction processing mechanism of the present invention has a transaction start processing mechanism in which an exclusive control using a valid processing authority token and data consistency are combined, and a commit processing mechanism in which determination on whether a commit is available or not based on a distributed agreement and replication of updated data. With the mechanisms, a system for shortening a service halt time when a failure occurs to a time as such it appears to a client that the service does not stop is provided. | 07-26-2012 |
20120191682 | DATABASE SYSTEM THAT PROVIDES FOR HISTORY-ENABLED TABLES - Techniques for history enabling a table in a database system so that past versions of rows of the history-enabled table are available for temporal querying. The table is history enabled by adding a start time column to the table and creating a history table for the history-enabled table. The start time field's value in a row of the history-enabled table indicates when the contents of the row last changed. The rows of the history table are copies of rows of the history-enabled table that have been deleted or updated. The rows include end time fields whose values indicate when the row was updated or deleted. A history table's row thus indicates a period in which the history table's row was in the history-enabled table. Temporal queries are performed on a view which is the union of the history-enabled table and the history table. | 07-26-2012 |
20120209822 | SYSTEM AND METHODS FOR ENSURING INTEGRITY, AUTHENTICITY, INDEMNITY, AND ASSURED PROVENANCE FOR UNTRUSTED, OUTSOURCED, OR CLOUD DATABASES - A system and methods for providing guarantees about faithful execution of databases that run under the control of an untrusted entity—such as a cloud computing service provider—that is different than the owner of the data and applications being outsourced; or runs on a server that may be compromised by unauthorized users. Specifically, the system and methods establishes that an untrusted database is being faithfully hosted and provides indemnity for the service provider from false claims, enabling the server to prove its innocence against untrue claims of faulty operation. The invention also provides assured provenance for all changes made to the database. | 08-16-2012 |
20120215751 | TRANSACTION PREDICTION MODELING METHOD - The present invention provides database systems configured for creating and utilizing a transactions predictive model using a computer, the database system including: a database management system (DBMS) for handling transactions in the database system, the DBMS including a prediction component for generating the transactions predictive model; a database workload table for capturing commands associated with the transactions, the commands utilized for generating the transactions predictive model; database data for providing data in response to the transactions; and a prediction model database for storing the transactions predictive model, where the prediction component is configured for generating a generalized statement for each statement corresponding with the transactions, identifying a sequence of transactions of the transactions, creating a transaction class based on the sequence of transactions, identifying a current transaction, and then calculating probabilities between transactions, where each statement includes at least a database command. | 08-23-2012 |
20120221537 | SOLUTION METHOD OF IN-DOUBT STATE IN TWO-PHASE COMMIT PROTOCOL OF DISTRIBUTED TRANSACTION - A distributed transaction system includes a plurality of log groups each having a unique identifier assigned thereto, a data storage device storing data and a log storage device storing a log of the data. A table is provided in each of the log groups and has registered therein information about a database management device having the management right of each of the log groups. Wherein in response to the management right of the global representative log group moving to another database management device during an in-doubt state period of the two-phase commit, the table is rewritten to reflect moving of the management right of the global representative log group. | 08-30-2012 |
20120233139 | EFFICIENT MULTI-VERSION LOCKING FOR MAIN MEMORY DATABASES - A transaction creates a wait for dependency on a version in a main memory database implementing a multi-version concurrency control scheme. The wait for dependency allows the transaction to update the version while other transactions are reading the version. The multi-version concurrency control scheme also allows commit dependencies to be implementing concurrently with wait for dependencies. Commit dependencies allow a transaction to read an updated version before the updated version is committed. | 09-13-2012 |
20120239634 | METHOD AND APPARATUS FOR ACCESSING DATABASE AND DATABASE APPLICATION SYSTEM - A method for accessing a database is disclosed, which includes: receiving a modification operation request for shared data in the database which is mapped into a process address space; decomposing the modification operation request to a preset number of atomic operation sequences; invoking atomic operation interfaces according to an execution order of the various atomic operation sequences; and accessing the shared data in the database, which is mapped into the process address space, through atomic operations which are provided by the atomic operation interfaces. An apparatus for accessing a database and a database application system are also disclosed. | 09-20-2012 |
20120254138 | DATABASE MANAGEMENT METHOD - The present invention realize a method of managing a database capable of hierarchically building master nodes, and efficiently performing the update of the master nodes. A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heaptuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control. | 10-04-2012 |
20120271803 | METHOD AND SYSTEM FOR LOAD BALANCING A DISTRIBUTED DATABASE - A method of processing a transaction request at a database load balancer. The method comprises receiving the transaction request, where the transaction request is comprised of one or more operations; analyzing the transaction request to determine the one or more operations; associating one or more database locks with each of the one or more operations; analyzing one or more of the database locks to determine the one or more sequence numbers associated with each of the one or more operations; and transmitting the one or more operations with the associated database locks and the sequence numbers to one or more databases servers accessible to the database load balancer. | 10-25-2012 |
20120278293 | REAL-TIME TRANSACTION SCHEDULING IN A DISTRIBUTED DATABASE - In one exemplary embodiment, a method of a distributed database system includes the step of receiving a database transaction with a node of the distributed database system. A priority of the database transaction is determined. A load of a transaction queue of the node is determined. The execution of a database transaction is delayed if the load of the transaction queue is greater than a first-water mark. The database transaction is delayed for a specified period. A portion of the database transaction is execution after the specified period. It is determined if the load of the queue is below a second-water mark after the specified period. A remaining portion of the database transaction can be processed if the load of the queue is below the second-water mark. | 11-01-2012 |
20120284244 | TRANSACTION PROCESSING DEVICE, TRANSACTION PROCESSING METHOD AND TRANSACTION PROCESSING PROGRAM - An object of the present invention is to carry out transaction processing on a plurality of records even in the case the transaction processing is executed in an environment that manages records composed of pairs of keys and values. The transaction processing device of the present invention includes a group information storage unit that stores information relating to transactions, in association with information relating to groups generated by logically grouping records used in the transactions according to attribute values of a unique key common to the records, a group specification unit that specifies the group corresponding to the transaction by referencing the stored information based on the transaction corresponding to a processing request received from the application, a log management unit that manages logs of the records belonging to the specified group by collectively storing all contents of the logs in the physically same storage area, and a data updating unit that updates real data by reflecting the contents of the managed logs in the records corresponding to those logs. | 11-08-2012 |
20120290547 | TRANSACTION PROCESSING DEVICE, TRANSACTION PROCESSING METHOD, AND TRANSACTION PROCESSING PROGRAM - 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. | 11-15-2012 |
20120290548 | Method and article of manufacture for ensuring fair access to information using a fair propagation delay period in a transaction ownership step - A method of performing transactions in accordance with fairness criteria is provided wherein one of a plurality of entities initiates a transaction on an object at a database. The steps or operations of the initiated transaction are immediately processed up to the transaction ownership step. Propagation delays are determined between the database and at least some of the other entities that are capable of initiating transactions to the database. The propagation delays and a fairness criteria is used to determine the fair propagation delay period. Upon determining that the fair propagation delay period has been exceeded, it is detecting whether any of the other entities initiated a transaction on the same object during the fair propagation delay time period. If not, then the transaction initiating entity performs the transaction ownership step on the initiated transaction. | 11-15-2012 |
20120330913 | SYSTEMS AND METHODS FOR SUPPORTING TRANSACTIONAL MESSAGE HANDLING - In accordance with embodiments disclosed herein, there are provided methods, systems, and apparatuses including, for supporting transactional message handling in an on-demand service environment including, for example: enqueuing a message specifying a transaction to be processed via a host organization; inserting a row into a database of the host organization associating the message with a status of pending, wherein the row is autocommitted to the database upon insertion; updating the status for the row to ready if a commit operation for the transaction is initiated; requesting a lock on the row; and performing final processing for the transaction based on the status for the message and based further on whether the lock is obtained for the row. Final processing may include, for example, a transaction roll back, a transaction commit, a transaction requeue, a termination of transaction processing, or an orphaned transaction clean up. | 12-27-2012 |
20120330914 | SERVER, INTER-BUSINESS ENTERPRISE INFORMATION CONTROL METHOD AND COMPUTER PROGRAM - A Web server includes a storage unit that stores transaction relation information, transaction data requirement information that determines whether a reference authority is appended to a user for transaction data, and information that identifies the user, associated with each other; and a control unit that controls to receive the transaction data containing the transaction relation information, refer to the storage unit, extract user identification information for appending information indicating the transaction relation and the reference authority from the storage unit, when the storage unit stores the received transaction relation information and the received transaction data satisfies the transaction data requirement, and register the extracted information and information for identifying the transaction data in the database, from the user terminal, therefore, separate third parties can refer to every transaction data, even to the transaction data transmitted and received between the same transaction relations. | 12-27-2012 |
20120330915 | STREAMING TRANSACTION NOTIFICATIONS - Methods and systems are provided for identifying data transactions satisfying a streaming query and providing data corresponding to those data transactions to subscribed client devices. One exemplary method involves receiving a subscription request for a streaming query from a client device, monitoring a database for indication of a data transaction corresponding to the streaming query, and in response to identifying the indication of the data transaction corresponding to the streaming query, obtaining data for an entry associated with the data transaction from the database and providing at least a portion of the obtained data to the client device. | 12-27-2012 |
20120330916 | UTILIZING SHARED NUMERIC LOCKS - A method and system for performing at least one transaction on at least one column of a table in a database system is disclosed. The method includes determining whether a first transaction of the at least one transaction fulfills all of at least one criteria. The method further includes ensuring that the at least one column is in a shared numeric lock if the first transaction fulfills all of the at least one criteria, wherein the shared numeric lock is a lock that allows at least a second transaction fulfilling all of the at least one criteria to access the same column concurrently with the first transaction without releasing the shared numeric lock between transactions, and wherein the shared numeric lock is released only after all of the transactions fulfilling all of the criteria have completed processing. The method further includes processing the first transaction. | 12-27-2012 |
20120330917 | BATCHING CONTENT MANAGEMENT OPERATIONS TO FACILITATE EFFICIENT DATABASE INTERACTIONS - Batching content management operations to facilitate efficient database interactions is disclosed. Two or more content management-related requests are received. The two or more content management-related requests are treated as a batch, including by formulating and sending to a database in a single database interaction a grouped request to add, delete, or modify each of a plurality of database records. | 12-27-2012 |
20130006949 | SYSTEMS AND METHODS FOR DATA INTEGRITY CHECKING - Systems and methods are provided for data integrity checking in a computing system. In one exemplary embodiment, the method includes receiving, from each of a plurality of computing devices of the computing system, application transaction logs, wherein the application transaction logs are related to a plurality of applications. The method also includes comparing, by the central computing device, the received application transaction logs to a transactions recorded in a database to identify missing transactions. In addition, the method includes performing one or more actions in response to the identified missing transactions. | 01-03-2013 |
20130013576 | SYSTEM WITH MULTIPLE CONDITIONAL COMMIT DATABASES - 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. | 01-10-2013 |
20130013577 | METHODS AND SYSTEMS FOR BATCH PROCESSING IN AN ON-DEMAND SERVICE ENVIRONMENT - In accordance with embodiments disclosed herein, there are provided mechanisms and methods for batch processing in an on-demand service environment. For example, in one embodiment, mechanisms include receiving a processing request for a multi-tenant database, in which the processing request specifies processing logic and a processing target group within the multi-tenant database. Such an embodiment further includes dividing or chunking the processing target group into a plurality of processing target sub-groups, queuing the processing request with a batch processing queue for the multi-tenant database among a plurality of previously queued processing requests, and releasing each of the plurality of processing target sub-groups for processing in the multi-tenant database via the processing logic at one or more times specified by the batch processing queue. | 01-10-2013 |
20130018860 | PARALLEL NESTED TRANSACTIONS IN TRANSACTIONAL MEMORY - Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. Multiple closed nested transactions are created for a single parent transaction, and the closed nested transactions are executed concurrently as parallel nested transactions. Various techniques are used to ensure effects of the parallel nested transactions are hidden from other transactions outside the parent transaction until the parent transaction commits. For example, retry is allowed to work correctly with parallel nested transactions. When a transaction that is a parallel nested transaction or a child transaction of the parallel nested transaction executes a retry, a read set of the transaction is registered for the retry. When a decision is made to propagate the retry past a parallel nested transaction parent of the transaction, keeping the read set registered and making the read set part of a parent read set. | 01-17-2013 |
20130031067 | DATA AUDIT MODULE FOR APPLICATION SOFTWARE - System and methods of data auditing of transaction data of an application software are described. In one implementation, the method includes data auditing of transaction data by an independent audit module where metadata of the application software is received, and an audit table based on at least one of the audit parameters, indicating the extent of audit data of one or more processes is created in an audit database of the audit module. Further, triggers for capturing data changes from the application software are generated based on at least one audit parameters. Captured changes data is optimized to reduce the storage requirements of audit data. In another implementation, the result of the analysis is displayed in form of a report in user desired format. | 01-31-2013 |
20130031068 | CONTROLLING AND RECOVERING LONG-LIVED TRANSACTIONS - 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. | 01-31-2013 |
20130036105 | RECONCILING A DISTRIBUTED DATABASE FROM HIERARCHICAL VIEWPOINTS - Embodiments of the present disclosure include systems and methods for controlling concurrency of database transactions by hierarchically maintaining transaction consistently in a distributed database system from various viewpoints. Hierarchically maintaining the transaction consistency ensures the serializability of database transactions in the distributed database system and improves the overall performance (e.g., response time) from the perspective of clients of the distributed database system. | 02-07-2013 |
20130036106 | GENERALIZED RECONCILIATION IN A DISTRIBUTED DATABASE - Embodiments of the present disclosure include systems and methods for generalized consistency control of database transactions in a distributed database. In distributed database systems a specific reconciliation procedure is typically needed and coded for each possible irresolvable event. The systems and methods described herein enable a general characterization of multiple types of irresolvable events and thus eliminate and/or reduce the need to write individual code for every specific event. | 02-07-2013 |
20130046743 | METHOD FOR BUNDLED PREPARATION AND EXECUTION OF MULTIPLE DATABASE STATEMENTS - A system and method for preparing and executing multiple database statements to minimize communication overhead between a client application and a database, the method is presented. Multiple database statements are registered for preparation and execution, the registering further including bundling of preparation operations for the multiple database statements and bundling of execution operations for multiple database statements. All of the bundled preparation operations and execution operations for the multiple database statements are executed in a single transaction between the client application and the database, and thereafter results of the preparation operations and the execution operations are accessible by a client application. | 02-21-2013 |
20130086018 | TRANSACTION PROCESSING SYSTEM, METHOD, AND PROGRAM - Using a KVS transaction processing mechanism, four lock states are managed. When a local transaction refers to and updates a map entry, the local transaction is graded up to a global transaction. Start processing as the global transaction is first performed to determine a transaction ID. A committed value, a value being updated, and a transaction ID being updated are then inserted into all map entries for which LX locks are being acquired at present. Another local transaction is then started for all map entries for which S locks are being acquired at present to acquire S locks. Next, the original local transaction is committed. As a result, the LX locks acquired are graded up to GX locks. After the termination of the global transaction as the waiting target, acquisition of S locks (GX locks) is tried as a global transaction. | 04-04-2013 |
20130103659 | DISTRIBUTED TRANSACTION MANAGEMENT FOR DATABASE SYSTEMS WITH MULTIVERSIONING - The subject disclosure relates to a distributed transaction management technique that ensures synchronization between participating nodes in a global or distributed database transaction. The technique leverages a commit protocol that uses local clocks at the respective participating nodes. Participants in a global transaction are configured to utilize the same commit timestamp and logical read time and can advance their respective local clocks to establish this synchronization. In one embodiment, distributed commit utilizes a modified version of two-phase commit that includes an extra phase to collect commit timestamp votes from participants. Additionally, a heartbeat mechanism can be used to establish loose synchronization between nodes. In another embodiment, a node can respond to a remote transaction request by returning a list of nodes involved in generating the result of the transaction and the types of access used by such nodes in addition to the transaction result itself. | 04-25-2013 |
20130117247 | Columnar Database Using Virtual File Data Objects - A plurality of virtual files are instantiated in a columnar database. The columnar database includes a columnar data store that persists tables of data contained therein to the plurality of virtual files. Each virtual file is stored in physical data storage and a portion of the virtual file can be cached transiently in a persistence layer intermediate the columnar data store and the physical data storage. The virtual files each comprise a database object for storing data records. Operation are processed, in the columnar database, using the virtual files such that changes to virtual files resulting from the operations of one transaction are isolated from changes on the same virtual files resulting from the operations of other transactions. Related apparatus, systems, techniques and articles are also described. | 05-09-2013 |
20130151493 | MEDIA SERVICE AND METHOD FOR DELIVERY OF STORED MEDIA - A system includes an application programming interface (API) configured to process a transaction request that specifies data content located at a storage medium. A request processor associated with the API can be configured to determine a delivery format for the data content in response to the transaction request. A file converter can be configured to transform the data content into the delivery format in accordance with the transaction request. | 06-13-2013 |
20130151494 | Consistent Database Recovery Across Constituent Segments - 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. | 06-13-2013 |
20130159265 | Parallel Uniqueness Checks for Partitioned Tables - An insertion of a record into a table that includes a primary key column and a second column that includes a global uniqueness constraint across all of a plurality of data partitions across which the table is split is initiated without checking that a value of the record in the second column is globally unique by contacting other partitions the one partition to which the record is to be added to. The insertion can be processed, at least in part by implementing a write lock on the one partition but without implementing a read lock on the other partitions. The write lock on the one partition can be released after the insertion is completed, after which the validity of the insertion can be verified, for example by examining the other parts and a delta partition corresponding to the table. The insertion can be undone if the insertion was not valid. | 06-20-2013 |
20130166523 | Parallel Execution In A Transaction Using Independent Queries - Embodiments include a method, apparatus and computer program product for executing a database transaction in parallel using subtransactions. The method includes receiving a transaction at an application, the transaction having a first statement and a second statement, and determining whether operation of the first statement is independent from operation of the second statement. When it is determined that operation of the first statement is independent from operation of the second statement, assigning the first statement to a first subtransaction and the second statement to a second subtransaction, the first and second subtransactions being part of a transaction group. The method further includes executing the subtransactions using resources of the database. Finally, when execution of all of the subtransactions have successfully completed, committing all of the subtransactions. | 06-27-2013 |
20130179416 | DATABASE MANAGEMENT METHOD - A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap_tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control. | 07-11-2013 |
20130179417 | DATABASE MANAGEMENT METHOD - A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control. | 07-11-2013 |
20130204855 | DATABASE MANAGEMENT METHOD - A lower-level master node sends, to a higher-level master node, a write set expanded in its own memory including a shadow copy of its own database and a heap tuple map, and the higher-level master node that received the write set verifies whether the update has already been executed and sends the record of this update to the lower-level master node as a transaction log, whereby the database can be updated efficiently and consistently from the lower-level master node to the higher-level master node, and from the higher-level master node to the lower-level master node under its control. | 08-08-2013 |
20130204856 | SELECTIVE LOGGING BASED ON SET PARAMETER - Logging for an identified asset is coordinated when provided by applications implemented on multiple network elements. An indicator is set, prior to activity occurring related to the asset, to log information for the asset based on specified criteria. A first application implemented on a first network element generates, based on the indicator, a first detailed log for activity occurring related to the asset. A representation of the asset is passed to a downstream application implemented on a second network element. A second detailed log for activity occurring related to the asset is generated by the downstream application based on the indicator. The first detailed log is correlated with the second detailed log. | 08-08-2013 |
20130218856 | DATA SUMMARIZATION INTEGRATION - 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. | 08-22-2013 |
20130226890 | SUPPORTING TRANSACTIONS IN DISTRIBUTED ENVIRONMENTS USING A LOCAL COPY OF REMOTE TRANSACTION DATA AND OPTIMISTIC LOCKING - A first process executing in a computer system in a data grid receives a request to perform at least one transaction operation of a transaction based on remote transaction data of at least one other process in the data grid. The at least one other process is capable to perform a prepare operation for a transaction. The first process identifies a local copy of the remote transaction data in a local data structure and performs the at least one transaction operation using the local copy of the remote transaction data without acquiring a lock on the remote transaction data. | 08-29-2013 |
20130226891 | MANAGING VERSIONS OF TRANSACTION DATA USED FOR MULTIPLE TRANSACTIONS IN DISTRIBUTED ENVIRONMENTS - A first process in a data grid provides an initial version that corresponds to transaction data controlled by the first to a second process and a third process. The first process receives a request of the second process and changes the transaction data based on a first transaction. The first process provides a current version value of the transaction data to the second process and commit the change to the transaction data based on the first transaction if the current version value matches the initial version value provided to the second process and creates a new version value for the transaction data upon committing the change. The first process changes the transaction data based on the second transaction and rolls back the change made to the transaction data based on the second transaction if the new version value does not match the initial version value provided to the third process. | 08-29-2013 |
20130238579 | EFFICIENT GARBAGE COLLECTION AND EXCEPTION HANDLING IN A HARDWARE ACCELERATED TRANSACTIONAL MEMORY SYSTEM - Handling garbage collection and exceptions in hardware assisted transactions. Embodiments are practiced in a computing environment including a hardware assisted transaction system. A method includes beginning a hardware assisted transaction, raising an exception while in the hardware assisted transaction, including creating an exception object, determining that the transaction should be rolled back, and as a result of determining that the transaction should be rolled back, marshaling the exception object out of the hardware assisted transaction. | 09-12-2013 |
20130246379 | SYSTEM AND METHOD FOR SUPPORTING APPLICATION INTEROPERATION IN A TRANSACTIONAL MIDDLEWARE ENVIRONMENT - A system and method can support application interoperation in a transactional middleware environment. A first transaction server operates to initiate a global transaction, wherein the first transaction server that is associated with a first format identifier (ID), and wherein the global transaction includes a plurality of branches and each said branch is associated with an individual branch qualifier. Furthermore, the first transaction server can direct at least one branch of the global transaction from the first transaction server to a second transactional server, wherein each said transactional server is associated with a second format identifier (ID), and configure a plurality of branches in the global transaction to share a common format identifier (ID). | 09-19-2013 |
20130262423 | CONTROLLED LOCK VIOLATION FOR DATA TRANSACTIONS - A system, method, and non-transitory computer readable medium for providing controlled lock violation for data transactions are presented. The system includes a processor for executing a first data transaction and a second data transaction, the first and second data transactions operating on a plurality of data resources. A controlled lock violation module grants to the second transaction a conflicting lock to a data resource locked by the first transaction with a lock, the conflicting lock granted to the second transaction while the first transaction holds its lock. The controlled lock violation module can be applied to distributed transactions in a two-phase commit and to canned transactions. | 10-03-2013 |
20130262424 | DATABASE SYSTEM TRANSACTION MANAGEMENT - Systems, methods, and products for database system transaction management are provided herein. One aspect provides for annotating via a computing device at least one data object residing on the computing device utilizing at least one transaction tag, the at least one transaction tag being configured to indicate a status of an associated data object; processing at least one database transaction utilizing a transactional memory process, wherein access to the at least one data object is determined based on the status of the at least one data object; and updating the status of the at least one data object responsive to an attempted access of the at least one data object by the at least one database transaction. Other embodiments and aspects are also described herein. | 10-03-2013 |
20130262425 | TECHNIQUES TO PERFORM IN-DATABASE COMPUTATIONAL PROGRAMMING - Techniques to perform in-database computational programming. In one embodiment, for example, an apparatus may comprise a processor circuit and a client application operative on the processor circuit to generate a general request to perform an analytical calculation on data stored in a distributed database system based on a compute model, where the client application uses a threaded kernel service layer. The apparatus may also comprise a compute request component operative on the processor circuit to convert the general request to a compute request having a request format used by the distributed database system, and send the compute request to a node of the distributed database system having an analytic container. Other embodiments are described and claimed. | 10-03-2013 |
20130262426 | METHOD AND APPARATUS FOR ACCESSING DATABASE AND DATABASE APPLICATION SYSTEM - A method for accessing a database is disclosed, which includes: receiving a modification operation request for shared data in the database which is mapped into a process address space; decomposing the modification operation request to a preset number of atomic operation sequences; invoking atomic operation interfaces according to an execution order of the various atomic operation sequences; and accessing the shared data in the database, which is mapped into the process address space, through atomic operations which are provided by the atomic operation interfaces. An apparatus for accessing a database and a database application system are also disclosed. | 10-03-2013 |
20130268503 | DATABASE NAVIGATION OF CHANGES AT COMMIT TIME - An exemplary database management device includes a database storage memory for storing database information. A user access memory at least temporarily stores information to be included in the database. At least a portion of the user access memory is configured to operate as a database manager that allows a user to indicate an intended change to the database information. The database manager places the intended change into the user access memory and determines whether the intended change complies with a criterion responsive to the user attempting to implement the intended change. The database manager makes the intended change to the database information in the database storage memory if the intended change complies with the criterion. The database manager provides an indication that the intended change will not be made to the database and the database storage memory if the intended change does not comply with the criterion. | 10-10-2013 |
20130297580 | LOCK REORDERING FOR OPTIMISTIC LOCKING OF DATA ON A SINGLE NODE TO AVOID TRANSACTION DEADLOCK - 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. | 11-07-2013 |
20130304714 | Distributed Transaction Management Using Two-Phase Commit Optimization - 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. The two-phase commit operation includes preparing for committing the transaction, writing a committed transaction to a memory, optimizing the two-phase commit operation by omitting a phase of the two-phase commit operation, generating an acknowledgement of the committed transaction. The plurality of transactions of the database are executed with each transaction master. | 11-14-2013 |
20130304715 | SYSTEMS AND METHODS FOR PROVIDING AN AUTOMATED VALIDITY CHECK OF TRANSACTIONAL DATA POSTINGS - 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. | 11-14-2013 |
20130318058 | MANAGEMENT OF LONG-RUNNING LOCKS AND TRANSACTIONS ON DATABASE TABLES - 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. | 11-28-2013 |
20130318059 | TRANSFER OF DATA FROM TRANSACTIONAL DATA SOURCES TO PARTITIONED DATABASES IN RESTARTABLE ENVIRONMENT - 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. | 11-28-2013 |
20130325826 | MATCHING TRANSACTIONS IN MULTI-LEVEL RECORDS - 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. | 12-05-2013 |
20130325827 | INCREMENTAL OPTIMISTIC LOCKING OF DATA DISTRIBUTED ON MULTIPLE NODES TO AVOID TRANSACTION DEADLOCK - 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. | 12-05-2013 |
20130325828 | System and Method For Providing High-Availability and High-Performance Options For Transaction Log - 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. | 12-05-2013 |
20130325829 | MATCHING TRANSACTIONS IN MULTI-LEVEL RECORDS - 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. | 12-05-2013 |
20130325830 | TRANSACTIONAL FILE SYSTEM - 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. | 12-05-2013 |
20130332435 | PARTITIONING OPTIMISTIC CONCURRENCY CONTROL AND LOGGING - 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. | 12-12-2013 |
20130339325 | CONSTRAINED TRANSACTION EXECUTION - 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. | 12-19-2013 |
20130339326 | TRANSACTION BEGIN/END INSTRUCTIONS - 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. | 12-19-2013 |
20130339327 | FACILITATING TRANSACTION COMPLETION SUBSEQUENT TO REPEATED ABORTS OF THE TRANSACTION - 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. | 12-19-2013 |
20130339328 | SELECTIVELY CONTROLLING INSTRUCTION EXECUTION IN TRANSACTIONAL PROCESSING - 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. | 12-19-2013 |
20130339329 | TRANSACTIONAL PROCESSING - 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. | 12-19-2013 |
20130339330 | FACILITATING TRANSACTION COMPLETION SUBSEQUENT TO REPEATED ABORTS OF THE TRANSACTION - 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. | 12-19-2013 |
20140019429 | DOWNTIME REDUCTION FOR LIFECYCLE MANAGEMENT EVENTS - 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. | 01-16-2014 |
20140032514 | ASSOCIATION ACCELERATION FOR TRANSACTION DATABASES - 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. | 01-30-2014 |
20140046918 | Machine Change History Tracking Process for ERP Applications - 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. | 02-13-2014 |
20140046919 | SUPPORT FOR COMPENSATION AWARE DATA TYPES IN RELATIONAL DATABASE SYSTEMS - 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. | 02-13-2014 |
20140081936 | METHOD AND APPARATUS FOR RECORDING AND PROFILING TRANSACTION FAILURE SOURCE ADDRESSES IN HARDWARE TRANSACTIONAL MEMORIES - A method for recording and profiling information of a plurality of aborted transactions from a plurality of transactions is executed by processor core with a transactional memory, a transaction failure instruction address register (TFIAR), and a transaction failure data address register (TFDAR). The transactional memory stores information of a plurality of transactions executed by the processor core. The processor core retrieves instruction and data address associated with the aborted transaction from TFIAR and TFDAR respectively and stores them into a profiling table. The processor core then generates profiling information based on instruction and data addresses associated with the aborted transaction. | 03-20-2014 |
20140081937 | IC CARD AND IC CARD CONTROL METHOD - 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. | 03-20-2014 |
20140095459 | SUPPORTING COORDINATED ACCESS TO A FILE SYSTEM'S SHARED STORAGE USING AUTOMATIC ALIGNMENT OF A PARALLEL FILE ACCESS PROTOCOL AND METADATA MANAGEMENT - Embodiments of the invention relate to supporting coordinated access to a file system's shared disk storage subsystem using an automatic alignment of a parallel file access protocol and metadata management on a per object basis. A file server (among servers in the cluster) receives a client's request to access a file stored by the file system in the storage subsystem using a parallel file access protocol. If the file system has selected a file server to serve as a metadata manager of said file, the file server uses the selected file server to coordinate access to the file's metadata. If the file system has not selected a file server to serve as the metadata manager of the file, the file system selects the file server that received said request as the metadata manager for said file until a file close request operation is received. | 04-03-2014 |
20140108367 | CLIENT APPARATUS AND DATABASE SERVER FOR RESUMABLE TRANSACTION AND METHOD THEREOF - A transaction resuming method includes receiving a transaction unit divided into subsets by the unit when performing a transaction with a client, performing a rollback in a reverse order of the transaction when there is an error, and generating a resumable point to resume the transaction. The method further includes providing the resumable point to the client and receiving transaction unit after the resumable point to resume the transaction. | 04-17-2014 |
20140129531 | Automatic Entity-Grouping for Scalable OLTP - A method for automatic database design for scalability by receiving a database schema and database workload; applying transaction chopping to split a large transaction into smaller transactions; select one or more transactions using dynamic programming based on transaction weights; deriving a database design that covers the selected transactions; and generating a transaction class design that is scalable. | 05-08-2014 |
20140156618 | Distributed, Transactional Key-Value Store - In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction. | 06-05-2014 |
20140156619 | Locking Protocol for Partitioned and Distributed Tables - Systems, methods and computer program product embodiments for providing a locking protocol for partitioned and distributed database tables are disclosed herein. A locking method includes executing, by at least one processor, a first database transaction on a second node, attempting to acquire and acquiring a lock on the second node in intentional exclusive mode, executing, by the at least one processor, a second database transaction on a first node, acquiring a lock on the first node in exclusive mode and waiting to acquire a lock on the second node in exclusive mode, routing, by the at least one processor, the first database transaction to the first node and unsuccessfully trying to acquire a lock on the first node and committing, by the at least one processor, the first database transaction. | 06-05-2014 |
20140164340 | SYSTEM WITH MULTIPLE CONDITIONAL COMMIT DATABASES - 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. | 06-12-2014 |
20140181059 | BATCHING CONTENT MANAGEMENT OPERATIONS TO FACILITATE EFFICIENT DATABASE INTERACTIONS - Batching content management operations to facilitate efficient database interactions is disclosed. Two or more content management-related requests are received. The two or more content management-related requests are treated as a batch, including by formulating and sending to a database in a single database interaction a grouped request to add, delete, or modify each of a plurality of database records. | 06-26-2014 |
20140181060 | Record Protection System For Networked Databases - A record protection system for a networked database is provided. The system includes a client, a host processor accessible by the client via a telecommunications network, a database accessible by the host processor and containing at least one data record, software executing on the host processor for receiving data from the client for one or more fields of the data record, software executing on the processor for receiving data from a source, software executing on the host processor for comparing the data received from the client to the data received from the source, and software executing on the host processor to prevent editing of the data record by the client if the at least a portion of the data received from the client matches the data received from the source. | 06-26-2014 |
20140195505 | SAMPLING TRANSACTIONS FROM MULTI-LEVEL LOG FILE RECORDS - A log file contains operation records, each operation record is of a certain type, and each operation record is associated with a transaction. A plurality of operation records is read from the log file into a record store. Records of the plurality of operation records of each operation record type are sampled at a predefined sampling rate. Operation records in the plurality of operations records are identified that are associated with completed transactions of which the sampled operation records are associated. The identified operation records are then extracted from the record store into a data store. | 07-10-2014 |
20140214784 | APPARATUS FOR PROVIDING TRANSACTION SHARING HYBRID INTERFACE OF SESSION - Provided is an apparatus for providing a transaction sharing hybrid interface of a session. The hybrid interface includes a direct interface, of an imperative application programming interface (API), which retrieves or modifies data in database tables by bypassing a query processor (QP) layer and directly accessing a storage manager (SM) layer, and a SQL interface, of a declarative API, which retrieves or modifies data in database tables by going through the query processor layer before accessing the storage manager layer. From among one or more queries in one transaction of a session, the direct interface performs simple queries, and the SQL interface performs queries other than the simple queries. | 07-31-2014 |
20140222772 | STORAGE SYSTEM AND METHODS FOR TIME CONTINUUM DATA RETRIEVAL - A method and system for storage of a data block for time continuum back-in-time data retrieval. The method comprises receiving a data block from a user node; updating an index stored in a memory respective of a time that the data block was received, wherein the time is a past time for retrieval of the data block; generating a hash number respective of contents of the data block; updating the index with the generated hash number; checking for existence of the generated hash number in a database; upon determination that the generated hash number does not exist in the database saving the data block in a storage device; increasing monotonously a transaction number respective of the generated hash number; and updating the index with the transaction number. | 08-07-2014 |
20140236913 | Accelerating Distributed Transactions on Key-Value Stores Through Dynamic Lock Localization - Systems and methods for accelerating distributed transactions on key-value stores includes applying one or more policies of dynamic lock-localization, the policies including a lock migration stage that decreases nodes on which locks are present so that a transaction needs fewer number of network round trips to acquire locks, the policies including a lock ordering stage for pipelining during lock acquisition and wherein the order on locks to avoid deadlock is controlled by average contentions for the locks rather than static lexicographical ordering; and dynamically migrating and placing locks for distributed objects in distinct entity-groups in a datastore through the policies of dynamic lock-localization. | 08-21-2014 |
20140250094 | STEP IDENTIFIER BASED ON A UNIVERSAL TIMESTAMP - One or more transactions, and their audited update actions, operating on a database may be identified by a step ID. The step ID may include a first set of bits identifying a time the step was created. The step ID may also include a second set of bits uniquely identifying a step created at a certain time from other step created at the same time. The first set of bits may be generated from a coordinated universal time (UTC) that does not change with local seasons, such as daylight saving time. | 09-04-2014 |
20140250095 | MANAGING DATA TRANSACTION REQUESTS - In various embodiments, a system, method, and related computer-readable storage medium to process data transactions are provided. In one example, a system is arranged to process data transactions in a data store including a plurality of databases. The system includes a computer interface module to receive a data transaction request from at least one requesting computer and a data access layer having one or more processors to identify at least one database in the plurality of databases. The data access layer is to define an abstraction layer between a computer interface module and the plurality of databases. Other embodiments are disclosed. | 09-04-2014 |
20140258254 | ANALYZING DATABASE CLUSTER BEHAVIOR BY TRANSFORMING DISCRETE TIME SERIES MEASUREMENTS - A method, system, and computer program product for analyzing performance of a database cluster. Disclosed are techniques for analyzing performance of components of a database cluster by transforming many discrete event measurements into a time series to identify dominant signals. The method embodiment commences by sampling the database cluster to produce a set of timestamped events, then pre-processing the timestamped events by tagging at least some of the timestamped events with a semantic tag drawn from a semantic dictionary and formatting the set of timestamped events into a time series where a time series entry comprises a time indication and a plurality of values corresponding to signal state values. Further techniques are disclosed for identifying certain signals from the time series to which is applied various statistical measurement criteria in order to isolate a set of candidate signals which are then used to identify indicative causes of database cluster behavior. | 09-11-2014 |
20140279986 | System and Method for Performing a Transaction in a Massively Parallel Processing Database - A method for performing a transaction in a massively parallel processing (MPP) database includes receiving, by a transaction manager, from a first resource manager, a first snapshot of the first resource manager and receiving, by the transaction manager, from a second resource manager, a second snapshot of the second resource manager. Also, the method includes reconciling the first snapshot of the first resource manager and the second snapshot of the second resource manager to generate a reconciled snapshot and transmitting, by the transaction manager, to the first resource manager and the second resource manager, the reconciled snapshot. Additionally, the method includes performing a transaction using the reconciled snapshot. | 09-18-2014 |
20140297610 | TRANSACTIONAL LOCK ELISION WITH DELAYED LOCK CHECKING - Avoiding data conflicts includes initiating a transactional lock elision transaction containing a critical section, executing the transactional lock elision transaction including the critical section, and checking a status of a lock prior to a commit point in the transactional lock elision transaction executing, wherein the checking the status occurs after processing the critical section. A determination of whether the status of the lock checked is free is made and, responsive to a determination the lock checked is free, a result of the transactional lock elision transaction is committed. | 10-02-2014 |
20140297611 | WORKLOAD BALANCING IN A DISTRIBUTED DATABASE - A distributed database management system balances the load on query boundaries and to achieve a more evenly balanced load. The system includes two or more query processors with a common data source. A database client manages a transaction including two or more queries. A transaction analyzer checks if a transaction can be processed by more than one query processor. A query processor optimizer locates the optimum query processor for each query in the transaction based on workload of each query processor, while a workload balancer directs each query to the optimum query processor if the transaction can be processed by more than one query processor. This approach is particularly well suited to a clustered database environment that includes query processor nodes that work off a shared disk to provide database access to clients that connect to the node. | 10-02-2014 |
20140304245 | ATOMIC TRANSACTIONS IN A NOSQL DATABASE - Systems and methods are provided for atomic transactions in a NoSQL database. A system writes a pending transaction identifier to write claim data for a first data item in a NoSQL database in response to a determination that the write claim data for the first data item includes a first previous transaction identifier included in last commit data for the first data item. The system writes the pending transaction identifier and a pending commit identifier to the last commit data for the first data item. The system writes a first value associated with a pending transaction to the first data item. The system aborts the pending transaction in response to a determination that the write claim data for the first data item does not include the first previous transaction identifier included in the last commit data for the first data item. | 10-09-2014 |
20140310253 | OUT-OF-ORDER EXECUTION OF STRICTLY-ORDERED TRANSACTIONAL WORKLOADS - A method of transaction processing includes receiving a plurality of transactions from an execution queue, acquiring a plurality of locks corresponding to data items needed for execution of the plurality of transactions, executing each transaction of the plurality of transactions upon acquiring all locks needed for execution of each transaction, and releasing the locks needed for execution of each transaction of the plurality of transactions upon committing each transaction. The plurality of transactions have a specified order within the execution queue, the plurality of locks are sequentially acquired based on the specified order of the plurality of transactions within the execution queue, and an order of execution of the plurality of transactions is different from the specified order of the plurality of transactions within the execution queue. | 10-16-2014 |
20140317070 | WEIGHTED TRANSACTION PRIORITY BASED DYNAMICALLY UPON PHASE OF TRANSACTION COMPLETION - Resource reservation request information originated by a client application during a first phase of a distributed multi-phase transaction is received at a processor. The resource reservation request information specifies a first resource the client application intends to access during a first subsequent phase of the distributed multi-phase transaction after the first phase of the distributed multi-phase transaction is completed. The requested first resource is reserved on behalf of the client application. A transaction weighted priority is assigned to the distributed multi-phase transaction of the client application based upon a stage of completion of the distributed multi-phase transaction. | 10-23-2014 |
20140337303 | BANDWIDTH OPTIMIZED TWO-PHASE COMMIT PROTOCOL FOR DISTRIBUTED TRANSACTIONS - A processing device executing a transaction manager sends prepare messages to a plurality of participants of a two-phase commit distributed transaction. Responsive to receiving commit responses from each of the plurality of participants, the processing device commits the two-phase commit distributed transaction. The processing device then ends the two-phase commit distributed transaction without first sending commit messages to the plurality of participants. | 11-13-2014 |
20140337304 | APPLICATION RETENTION METRICS - The disclosure relates to methods and systems for generating application retention metrics. In one aspect, a method for generating coupled application retention metrics is disclosed. First and second reference application identifiers are selected ( | 11-13-2014 |
20140358878 | Maintaining Database Consistency When Nearing the End of a Database Recovery Log - Log records are generated by a computer system and stored in a computer readable storage area for recording changes to database objects responsive to receiving transaction requests, wherein the locators for the log records are of a predetermined maximum size that provides a maximum trackable size limit of the storage area. A computer system estimates an amount of time for the storing of the generated log records to fill the storage area up to the maximum trackable size limit. A computer system sets a soft limit to the storage area that is smaller than the maximum trackable size limit, including setting the soft limit based on the estimated amount of time. | 12-04-2014 |
20140372394 | SYSTEM, METHOD AND A NON-TRANSITORY COMPUTER READABLE MEDIUM FOR TRANSACTION AWARE SNAPSHOT - A method for generating transaction aware snapshots, the method may include: (a) starting a creation of a certain point in time snapshot for a consistency group that comprises at least one logical volume; (b) detecting that at the certain point in time there is an uncompleted transaction for writing multiple information units to the consistency group; the uncompleted transaction started at a transaction start point in time that precedes the certain point in time; (c) preventing an access to the certain point in time snapshot until a completion of the uncompleted transaction; and (d) associating the multiple information units with at least the certain point in time snapshot. | 12-18-2014 |
20140372395 | NON-DESTRUCTIVE DATA STORAGE - Non-destructive data storage is disclosed. An information change is stored that is associated with a business object such that tracking of the information change is enabled with respect to one a transaction time and/or an effective time. The stored information change is accessed with respect to a time. | 12-18-2014 |
20140379674 | PROVIDING MULTIPLE CONCURRENT TRANSACTIONS ON A SINGLE DATABASE SCHEMA USING A SINGLE CONCURRENT TRANSACTION DATABASE INFRASTRUCTURE - Executing multiple concurrent transactions on the single database schema using a single concurrent transaction database infrastructure, wherein the single database schema is a single concurrent transactional relational database. | 12-25-2014 |
20140379675 | DIRECTORY SYNCHRONIZATION OF A DISPERSED STORAGE NETWORK - A method begins by independently executing a first write transaction in a dispersed storage network (DSN) to a particular write verification step of a multiple step write process, wherein the first write transaction has a first transaction identifier. The method continues by independently executing a second write transaction in the DSN to the particular write verification step, wherein the second write transaction has a second transaction identifier, and wherein subject matter of the first write transaction is related to subject matter of the second write transaction. The method continues by dependently finalizing the multiple step write process for each of the first and second write transactions utilizing the first and second transaction identifiers when each of the first and second write transactions have reached the particular write verification step. | 12-25-2014 |
20150019516 | Providing Durability of In-Memory Columnar Datastores Using Multile Logs - Embodiments described herein generally relate to providing durability of in memory columnar datastores using multiple logs. A computer-implemented method is described. The method includes receiving a request to perform a transaction involving multiple tables in a column-oriented database system. The method further includes performing the transaction on each of the two or more database tables. Performance of the transaction generates two or more commit fragments corresponding to each of the two or more database tables. The method further includes writing each commit fragment to a transaction log for each of the two or more database tables. The method also includes writing a commit record for the transaction to a commit log after all commit fragments have been written. | 01-15-2015 |
20150032710 | Method Of Communicating Changes In A Main Database To A Client Application - A method is described for communicating changes in a main database to a database cache associated with a client application. The main database is stored on a server that is remote from and in communication with the database cache. The method includes: receiving, at an emitter associated with the main database, a set of changes in the main database, each change in the set of changes having a transaction identifier (ID) associated with an atomic transaction; queuing, at the emitter, the received set of changes until a commit associated with the atomic transaction is received; and in response to receipt of the commit, sending a transaction notification from the emitter to a publisher, the transaction notification corresponding to all changes associated with the atomic transaction and having the same transaction ID. Advantageously, transaction-level notifications are sent, rather than row-level notifications. | 01-29-2015 |
20150039576 | Managing Transactional Data for High Use Databases - According to one embodiment of the present invention, a system compares database transactions to corresponding performance information to identify conforming database transactions with an acceptable deviation from the performance information and outlier database transactions beyond the acceptable deviation from the performance information. The system aggregates information from a threshold quantity of conforming database transactions into an aggregated record, wherein the threshold quantity is dynamically adjusted, and generates a record for each outlier database transaction, wherein conditions for identifying the outlier database transactions are dynamically adjusted. Embodiments of the present invention further include a method and computer program product for managing database transactions in substantially the same manners described above. | 02-05-2015 |
20150039577 | SYSTEMS AND METHODS FOR ATOMIC STORAGE OPERATIONS - An atomic storage module may be configured to implement atomic storage operation directed to a first set of identifiers in reference to a second, different set of identifiers. In response to completing the atomic storage operation, the atomic storage module may move the corresponding data to the first, target set of identifiers. The move operation may comprise modifying a logical interface of the data. The move operation may further include storing persistent metadata configured to bind the data to the first set of identifiers. | 02-05-2015 |
20150039578 | MANAGING TRANSACTIONAL DATA FOR HIGH USE DATABASES - According to one embodiment of the present invention, a system compares database transactions to corresponding performance information to identify conforming database transactions with an acceptable deviation from the performance information and outlier database transactions beyond the acceptable deviation from the performance information. The system aggregates information from a threshold quantity of conforming database transactions into an aggregated record, wherein the threshold quantity is dynamically adjusted, and generates a record for each outlier database transaction, wherein conditions for identifying the outlier database transactions are dynamically adjusted. Embodiments of the present invention further include a method and computer program product for managing database transactions in substantially the same manners described above. | 02-05-2015 |
20150058306 | DISTRIBUTED TRANSACTION LOG - Embodiments of the disclosure provide techniques for updating a distributed transaction log on a previously offline resource object component using distributed transaction logs from active host computer nodes from separate RAID mirror configurations. Each component object maintains a journal (log) where distributed transactions are recorded. If a component object goes offline and subsequently returns (e.g., if the node hosting the component object reboots), the component object is marked as stale. To return the component object to an active state, a distributed resources module retrieves the journals from other resource component objects from other RAID configurations where the data is mirrored. The module filters corresponding data that is missing in the journal of the previously offline corresponding object and merges the filtered data to the journal. | 02-26-2015 |
20150074070 | SYSTEM AND METHOD FOR RECONCILING TRANSACTIONAL AND NON-TRANSACTIONAL OPERATIONS IN KEY-VALUE STORES - Techniques are provided for detecting and resolving conflicts between native and transactional applications sharing a common database. As transactions are received at the database system, a timestamp is assigned to both the start and the commit time of a transaction, where the timestamps are synchronized with a logical clock in the database system. When the database system receives a native operation, the database system increments the time in the logical clock and assigns that updated time to the native operation. When the transaction is ready to commit, database system may determine conflicts between native and transactional operations. If the database system determines that a native operation conflicts with a transactional operation, database system will abort the transaction. | 03-12-2015 |
20150074071 | METHOD AND SYSTEM FOR PERFORMING TRANSACTIONAL UPDATES IN A KEY-VALUE STORE - A method and system for performing a transactional update of a plurality of values in a key-value store that includes a first writer starting a transaction, a second writer joining the transaction, the first writer and the second writer writing changes to the plurality of values in a temporary transaction area in a storage area, and after the first writer and the second writer complete writing the changes, moving the plurality of values from the temporary transaction area to a global area in the key-value store. | 03-12-2015 |
20150088844 | METHOD AND APPARATUS FOR DATABASE - A method for representing a database in a computer readable medium. Accessing a first table in the database. The first table has rows of data, each row of data having one or more columns. Storing a first representation of the first table in a volatile computer memory in a column-oriented format, the column-oriented format comprising at least one B-tree for at least one column, wherein the B-tree is composed of at least one array and the at least one B-tree includes references to a plurality of arrays, each array of the plurality of arrays comprised of data corresponding to the rows of one column of the table, wherein the storing further comprising storing data corresponding to the rows in a packed format. Storing a second representation of the database on the computer-readable medium, the second representation substantially identical to the first representation. | 03-26-2015 |
20150100560 | Network Controller for Managing Software and Hardware Forwarding Elements - Some embodiments provide a set of one or more network controllers that communicates with a wide range of devices, ranging from switches to appliances such as firewalls, load balancers, etc. The set of network controllers communicates with such devices to connect them to its managed virtual networks. The set of network controllers can define each virtual network through software switches and/or software appliances. To extend the control beyond software network elements, some embodiments implement a database server on each dedicated hardware. The set of network controllers accesses the database server to send management data. The hardware then translates the management data to connect to a managed virtual network. | 04-09-2015 |
20150106348 | MONITORING BUSINESS TRANSACTION FAILURES INVOLVING DATABASE PROCEDURE CALLS - Systems, methods, and other embodiments associated with modifying applications and monitoring exceptions are described. In one embodiment, a computer implemented method searches an executable code for code representing a database procedure call within the executable code. At a location in the executable code prior to the database procedure call, exception capturing code is inserted into the executable code that is configured to cause information to be collected about an exception when the exception occurs during execution of the database procedure call. After the database procedure call, termination code is inserted in the executable code, wherein the termination code is configured to terminate the collection of the information caused by the exception capturing code. | 04-16-2015 |
20150112955 | MECHANISM FOR COMMUNICATION IN A DISTRIBUTED DATABASE - In a method for providing communication integrity within a distributed database computer system, a first node of a plurality of nodes transmits a change notification to a second node of the plurality of nodes. The second node is a neighbor of the first node. The first node receives at least one change confirmation from the second node. The change confirmation confirms acknowledgment of the change notification by the second node and by a third node of the plurality of nodes. The third node is not a neighbor of the first node. Responsive to receiving the at least one change confirmation, the first node determines that all the plurality of nodes have acknowledged the change notification. | 04-23-2015 |
20150112956 | TRANSACTION PROTOCOL FOR READING DATABASE VALUES - Techniques are provided for more efficient multi-row atomic, consistent, isolated and durable (ACID)-compliant transactions with snapshot isolation semantics (or just “multi-row transactions” for short). In some embodiments, the techniques are implemented in a computing system that includes a client application, a lightweight in-memory lease-based lock service, a multi-row transaction orchestrator, and an underlying database system. The transaction orchestrator implements a read protocol and a write protocol that provides support to the client application for carrying out multi-row transactions against the underlying database system irrespective of whether the database system itself supports multi-row transactions. The transaction orchestrator explicitly maintains transaction-level locks obtained from the lease-based lock service as part of the transaction protocol. Further, the transaction orchestrator is tolerant to lock service failure and unavailability without compromising ACID-compliance and snapshot isolation guarantees to the client application. | 04-23-2015 |
20150127625 | CLUSTER-NODE LOAD BALANCING IN A DISTRIBUTED DATABASE SYSTEM - In one exemplary aspect, a method of a cluster-node load balancing system of a distributed database system includes receiving a request from a cluster with at least one node of a cluster of the distributed database system. The request includes a query for an identity of all other nodes known by the node as well as a metadata of all data maintained by the node. The identity of all other nodes known by the node as well as the metadata of all data maintained by the node is provided to the cluster. | 05-07-2015 |
20150149426 | TRANSACTION COMMIT OPERATIONS WITH THREAD DECOUPLING AND GROUPING OF I/O REQUESTS - Innovations in the area of server-side processing when committing transactions to disk in a distributed database system can improve computational efficiency at database nodes and/or reduce network bandwidth utilization. For example, when transactions are committed in a database system, at a master node of the database system, a server uses different threads for certain processor-intensive operations and certain I/O-intensive operations. Or, as another example, when transactions are committed in a database system, at a master node of the database system, a server groups jobs for I/O requests. | 05-28-2015 |
20150310054 | DATA MOBILITY, ACCESSIBILITY, AND CONSISTENCY IN A DATA STORAGE SYSTEM - A transactional block storage system is provided which is capable of supporting a single-phase commit for data writes specifying a protected storage unit. The storage system includes a data storage map that logically links the protected data storage unit to two or more block storage units associated with a layer of the protected data storage unit. The storage system also includes an address abstraction layer which translates write requests to the block storage units and resolves whether those write requests are atomically committed to the storage system in a single phase transaction. The address abstraction layer is further configured to detected when a block storage unit becomes unavailable during a transaction and create a cleaning kit for that block in order to prevent data loss. Additionally, the address abstraction layer facilitates moving, copying, and merging of block storage units without global locking in the storage system. | 10-29-2015 |
20150317183 | SYSTEM AND METHOD FOR PROVIDING A DISTRIBUTED TRANSACTION LOCK IN A TRANSACTIONAL MIDDLEWARE MACHINE ENVIRONMENT - A system and method can support a distributed transaction lock in a transactional middleware machine environment. The system can use a global transaction identifier to locate a hash bucket in a transaction hash table, wherein the transaction hash table contains a plurality of hash buckets. Then, the system can lock said hash bucket in the transaction hash table, and allow only one process to access one or more global transaction entry structures in the transaction table before said hash bucket is unlocked, wherein said one or more global transaction entry structures are associated with the locked hash bucket in the transaction hash table. | 11-05-2015 |
20150324444 | METHODS AND APPARATUS FOR IMPLEMENTING A DISTRIBUTED DATABASE - According to a first aspect of the present invention there is provided a method of operating a distributed database comprising a plurality of database nodes each storing a plurality of data objects. The method comprises, when executing a database transaction that requires data operations be performed on a plurality of data objects that are distributed between two or more of the database nodes, grouping the data objects that are involved in the database transaction at one of the plurality of database nodes. | 11-12-2015 |
20150331896 | METHOD AND APPARATUS FOR MANAGING DISTRIBUTED TRANSACTIONS - A method for managing a distributed transaction including the steps of identifying a transactional resources upon which the transaction is to be implemented; assigning a priority value to each transactional resource, the priority value being dependent upon the probability that the transactional resource will make a heuristic decision and/or an actual or perceived importance of implementing the transactional on the transactional resource; and sequentially instructing the transactional resources to either commit to the transaction or to rollback the transaction in an order that is at least partially dependent upon the priority values assigned to the transactional resources. | 11-19-2015 |
20150331898 | METHOD AND APPARATUS FOR CONCURRENT ACCESS OF MIXED SERVICES - Embodiments of the present invention provide a method and an apparatus for concurrent access of mixed services, and relate to the field of database applications, so as to implement concurrent read/write access to a database service, allow lock-free concurrency of query and modification operations, lower operation complexity, reduce overheads, reduce a waste of memory, and improve data timeliness. The method includes: dividing a data table to obtain at least one data set; breaking down a modification or query operation on the data table into at least one point operation; determining whether to-be-processed data on which point operation processing is performed is distributed in multiple columns; and if the to-be-processed data is distributed in multiple columns, determining whether the to-be-processed data is in a same data set, and performing a modification or query operation on the to-be-processed data according to a result of the determining. | 11-19-2015 |
20150356117 | EVENTUAL CONSISTENCY TO RESOLVE SUBSCRIBER SHARING RELATIONSHIPS IN A DISTRIBUTED SYSTEM - A method is disclosed. The method comprises executing a transaction on a number of distributed objects. The distributed objects are maintained on a number of computing entities, and a distributed relationship exists between the objects. The executing the transaction includes performing a preparation operation, performing a processing operation, and performing a post-processing operation. | 12-10-2015 |
20150356133 | Distributed, Transactional Key-Value Store - In one embodiment, a system for implementing a distributed, transactional key-value store is provided. The system includes a set of nodes, where each node is communicatively coupled with one or more storage devices storing a set of data log files, and where each data log file including key-value pairs for a key namespace. Each node is configured to execute, using a transaction log file specific to the node, transactions for modifying or retrieving key-value pairs in the set of data log files, where the transaction log file includes state information for the transactions. The transactions are executed in a manner that ensures the atomicity and durability of each transaction. | 12-10-2015 |
20150378774 | LOG-BASED CONCURRENCY CONTROL USING SIGNATURES - A transaction request is received at a log-based transaction manager, indicating a conflict check delimiter and a read set descriptor indicative of one or more locations from which data is read during the requested transaction. Using the conflict check delimiter, a subset of transaction records stored in a particular persistent log to be examined for conflicts prior to committing the requested transaction is identified. In response to determining that none of the read locations of the requested transaction correspond to a write location indicated in the subset of transaction records, a new transaction record is stored in the particular persistent log indicating that the requested transaction has been committed. | 12-31-2015 |
20150379033 | PARALLEL MATCHING OF HIERARCHICAL RECORDS - Identifying matching transactions between two log files. First and second log files contain operation records of transactions in a transaction workload. The first and second log files are split into first and second corresponding partition files, based on distinct sequences of operation record types beginning operation records of the transactions in each of the log files. A record location in a first partition file, and a window of sequential record locations in a corresponding second partition file at a defined offset relative to the record location in the first file are advanced one record location at a time. If each operation record of a complete transaction at a record location in a first file has a matching record in the associated window of record locations in a second file, the corresponding transactions match. | 12-31-2015 |
20160042023 | TRANSACTION EXECUTION COMMITMENT WITHOUT UPDATING OF DATA ROW TRANSACTION STATUS - A system for executing a plurality of transactions comprises a first processor and a memory. The first processor is configured to execute a first transaction comprising: providing a plurality of indications to make a plurality of first changes to a plurality of first records of a database; and committing the first transaction by updating the status of the first transaction in a transaction table while not providing an indication to update the status of the first records from pending. The memory is coupled to the first processor and configured to store the transaction table. | 02-11-2016 |
20160042025 | SYSTEMS AND METHODS FOR DATA CONFIGURATION AND MANIPULATION - An apparatus for data configuration and manipulation is provided. The apparatus may include a receiver. The receiver may be configured to receive a trigger. The trigger may include a field, a qualifier and a value. The receiver may also be configured to receive an executable. The executable may include an action, a parameter and a location. The apparatus may include a database. The database may include a plurality of transactions. The apparatus may include a processor. The processor may be configured to determine, using the trigger, from among the plurality of transactions, all relevant transactions. Each relevant transaction may be selected because the relevant transaction includes the value qualified by the qualifier. The processor may also be configured to alter each relevant transaction by executing the executable, wherein the parameter may be passed to the actions, and the actions may be executed in the location of each relevant transaction. | 02-11-2016 |
20160048553 | Halloween Protection in a Multi-Version Database System - Mitigating problems related to the Halloween problem including where update operations potentially allow the record to be visited more than once during the operation. A method includes accessing an instance of a data store operation statement. The instance of the data store operation statement is executed causing an update or delete to an old version of data store record or creation of a data store record resulting in a new version of the data store record in the case of an update or creation of a data store record and a deleted version of the data store record in the case of a delete in the data store. The instance of the data store operation statement is correlated with the new version of the data store record or the deleted version of the data store record. | 02-18-2016 |
20160063051 | METHODS FOR PERSISTING DATA ON NONVOLATILE MEMORY FOR FAST UPDATES AND INSTANTANEOUS RECOVERY AND DEVICES THEREOF - A storage management computing device, method and non-transitory computer readable medium that persist data on non-volatile memory includes maintaining a data storage structure comprising multiple nodes on non-volatile memory in at least one storage server. A determination is made when a received key in an update matches an existing key in one of the multiple nodes in the data storage structure. When the determination indicates the match, the update is provided for insertion in a slot in a vector extending from the existing key in the one of the multiple nodes for the data storage structure which matches the received key. | 03-03-2016 |
20160070740 | STATELESS DATASTORE-INDEPENDENT TRANSACTIONS - At a client-side component of a storage group, a read descriptor generated in response to a read request directed to a first data store is received. The read descriptor includes a state transition indicator corresponding to a write that has been applied at the first data store. A write descriptor indicative of a write that depends on a result of the read request is generated at the client-side component. The read descriptor and the write descriptor are included in a commit request for a candidate transaction at the client-side component, and transmitted to a transaction manager. | 03-10-2016 |
20160070747 | TECHNIQUES TO REDUCE CONTENTION WINDOWS - Embodiments of the present invention provide improved concurrency by reducing the time period (also referred to herein as a locking window or contention window) during which a record is locked. This provides the benefits of pessimistic locking schemes by preventing transaction due to concurrent updates, while also reducing the time during which a record is exclusively locked. This improves user experience and performance. | 03-10-2016 |
20160078077 | METHODS, SYSTEMS, AND APPARATUS FOR PROCESSING DATA EVENT STREAMS IN A DATABASE ENVIRONMENT - Methods, systems, computer program products, and articles of manufacture for processing events are described. An event is obtained and the event is processed to generate data using a first set of one or more operators. The generated data is stored in a first column store with a first row/transaction identifier and the first row/transaction identifier is stored in one or more first processing queues to enable further processing of the event using a second set of one or more operators. | 03-17-2016 |
20160103866 | TRANSACTION COMPENSATION FOR SINGLE PHASE RESOURCES - A method including initiating, by a processing device, a transaction including a plurality of data items in one or more data stores to cause a change to at least a data item of the plurality of data items. The transaction includes a transaction identifier (ID). The method further includes for at least a data item of the plurality of data items, generating transactional data usable to undo the change to each data item associated with the transaction. The method further includes intercepting data items. The method further includes adding the transactional ID and the transactional data to each data item. The method further includes providing the data items to a data store of the one or more data stores. | 04-14-2016 |
20160117357 | ADAPTIVELY ROUTING TRANSACTIONS TO SERVERS - A method and apparatus is provided for dynamically generating data to dataset mappings and dataset to logical instance mappings and distributing these mappings to subscribers for the purpose of routing work. An advisory engine updates the mappings of data to data sets based at least in part on changing demands and patterns of access to data, and updates the mappings of datasets to logical instances based at least in part on anticipated capacity and change in conditions of the database servers. The subscribers receive and store the mapping information that maps the data to dataset identifiers, and dataset identifiers to logical database instances. The subscribers may also receive information that describes the current availability conditions of database instances, which are used to override the mapping of logical database instances to physical database instances. Subscribers may use the data to dataset mapping to map data identified from in an incoming database request to a dataset. Subscribers may use the dataset to logical instance mapping to map a dataset to a possible database server, and the logical instance to physical instance mapping to map a possible database server to an available database server. In this manner, the subscribers may route data efficiently even when access patterns and server conditions change. | 04-28-2016 |
20160125018 | DATABASE MANAGEMENT SYSTEM AND METHOD - A database management system generates a log each transaction during execution of a plurality of transactions and stores the generated logs in log storage areas. The database management system records sequence numbers of logs at least in the generated logs of transactions belonging to a set of transactions of which results are different depending on a transaction execution order. | 05-05-2016 |
20160132548 | RESOURCE USAGE OPTIMIZED AUDITING OF DATABASE SHARED MEMORY - A method for security auditing of database transactions is provided in the illustrative embodiments. For a specified period, an available capacity of a computing resource in a data processing system usable to analyze a database protocol packet. The database protocol packet is stored in a shared memory during a data communication. A number of database protocol packets expected in the shared memory during the specified period is determined. Determining a second number of database protocol packets that can be analyzed using the available capacity of the computing resource is computed. During the specified period, the second number of database protocol packets is caused to be selected from every number of database protocol packets stored in the shared memory for analysis using the computing resource during the specified period. | 05-12-2016 |
20160140160 | TRANSACTION PROCESSING APPARATUS, TRANSACTION PROCESSING METHOD, AND COMPUTER-READABLE RECORDING MEDIUM - The transaction processing apparatus ( | 05-19-2016 |
20160147812 | Garbage Collection of Versions Driving the Garbage Collection of Multi-Version Concurrency Control Timestamps - Disclosed herein are system, method, and computer program product embodiments for performing garbage collection on a multi-version concurrency control information in the database management system. An embodiment operates by determining, using multi-version concurrency control (MVCC) information, when a row manipulated by a write transaction is visible to a plurality of readers accessing a table that includes the row. The MVCC information for the row includes at least a creation timestamp, a destruction timestamp and a row state. Once the row is visible to the plurality of readers, garbage collecting at least the creation timestamp or the destruction timestamp in the MVCC information. After the creation timestamp or destruction timestamp have been garbage collected, the plurality of readers use the row state to determine accessibility of the row in the table. | 05-26-2016 |
20160147813 | DISTRIBUTED TRANSACTION COMMIT PROTOCOL - Disclosed herein are system, method, and computer program product embodiments for implementing a distributed transaction commit protocol with low latency read and write transactions. An embodiment operates by first receiving a transaction, distributed across partial transactions to be processed at respective cohort nodes, from a client at a coordinator node. The coordinator node requests the cohort nodes to prepare to commit respective partial transactions. Upon receiving prepare commit results, the coordinator node generates a global commit timestamp for the transaction. Coordinator node then simultaneously sends the global commit timestamp to the cohort nodes and commit the transaction to a coordinator disk storage. Upon receiving both sending results from the cohort nodes and a committing result from the coordinator disk storage, the coordinator node provides a transaction commit result of the transaction to the client. | 05-26-2016 |
20160147821 | Supporting Cursor Snapshot Semantics - A database upon opening each of at least one cursor for a transaction, assigns each statement forming part of a transaction a statement sequence number (SSN) involving at least one row of the database. Thereafter, temporary timestamps are assigned to the at least one row using a transaction identifier and the corresponding SSN. Further, active cursors are monitored such that a final timestamp is prevented from being associated with each row until it has no remaining cursors. Related apparatus, systems, techniques and articles are also described. | 05-26-2016 |
20160147827 | IN-MEMORY DATABASE SYSTEM - An in-memory database system includes database table stored in system memory. The database table comprises a plurality of rows including a particular row. Data corresponding to each row is stored entirely in the system memory. The database table comprises a first version of the particular row having a first valid time, and a second version having a second valid time. Index(es) are associated with the database table. Each index is implemented as a lock-free data structure and references the plurality of rows, including referencing the first and second versions of the particular row. A first transaction acting on the first version of the particular row is executed. The first version of the particular row is visible to the first transaction based on the first valid time and the second version of the particular row being not visible to the first transaction based on the second valid time. | 05-26-2016 |
20160154829 | PRESERVING DEPRECATED DATABASE COLUMNS | 06-02-2016 |
20160154843 | CONDITIONAL COMMIT FOR DATA IN A DATABASE | 06-02-2016 |
20160162537 | DATA READINESS USING INITIATOR REGION LAST COMMIT SELECTION - A portion of a transaction is received at a distributed transaction system from an initiator region. The distributed transaction system operates under a multi-tier two-phase commit protocol. A local unit of work is established that represents the portion of the transaction received from the initiator region. Processing of the local unit of work is invoked with at least one transaction participant. An indication is received from the initiator region to assume a role of transaction coordinator for the transaction. The initiator region is instructed to commit last relative to the at least one transaction participant of the local unit of work. | 06-09-2016 |
20160171042 | MERGING DATABASE OPERATIONS FOR SERIALIZABLE TRANSACTION EXECUTION | 06-16-2016 |
20160179869 | ENFORCING REFERENTIAL INTEGRITY FOR OBJECT DATA DOCUMENTS | 06-23-2016 |
20160179875 | RELIABILITY IMPROVEMENT OF DISTRIBUTED TRANSACTION PROCESSING OPTIMIZATIONS BASED ON CONNECTION STATUS | 06-23-2016 |
20160179876 | SYSTEM AND METHOD FOR HIGHLY SCALABLE DECENTRALIZED AND LOW CONTENTION TRANSACTIONAL PROCESSING X | 06-23-2016 |
20160253376 | Updating Object Attributes in a Lock-Coupled Namespace Traversal | 09-01-2016 |
20160378818 | GRANULAR BUFFERING OF METADATA CHANGES FOR JOURNALING FILE SYSTEMS - Responsive to determining an in-memory image of a metadata disk block, a buffer is generated in memory and includes metadata updates made to the metadata disk block. Metadata updates to the disk block by a first transaction are recorded and stored in the buffer. Transfer of metadata updates that are logically complete, but remain in an active transaction list stored in the buffer, are delayed to a completed transaction list, scheduled to be written to a log file on disk at a subsequent time. A determination is made as to whether the metadata disk block is deleted by a second transaction following the first, and responsive to determining the metadata disk block is to be deleted and the metadata updates of the second transaction transfer to the completed transaction list, preventing the writing of the metadata updates to the log file and the metadata disk block to disk. | 12-29-2016 |
20160378819 | Transactional Database Layer Above a Distributed Key/Value Store - A computing system is configured to be coupled to a remote storage system. The remote storage system comprises a key/value store. The computing system is configured to perform transactions on data stored at the remote storage system. The system includes a database client. The database client includes an interface configured to allow a user to request database operations using the database client. The system further includes a database engine coupled to the database client. The database engine is configured to receive requests for database operations from the database client. The database engine is further configured to obtain and operate on transaction state stored as one or more key/value pairs in the key/value store at the remote storage system from the remote storage system. The database engine is configured to transactionally perform data operations, using the transaction state, on one or more data key/value pairs in the key/value store. | 12-29-2016 |
20160378820 | GRANULAR BUFFERING OF METADATA CHANGES FOR JOURNALING FILE SYSTEMS - Responsive to determining an in-memory image of a metadata disk block, a buffer is generated in memory and includes metadata updates made to the metadata disk block. Metadata updates to the disk block by a first transaction are recorded and stored in the buffer. Transfer of metadata updates that are logically complete, but remain in an active transaction list stored in the buffer, are delayed to a completed transaction list, scheduled to be written to a log file on disk at a subsequent time. A determination is made as to whether the metadata disk block is deleted by a second transaction following the first, and responsive to determining the metadata disk block is to be deleted and the metadata updates of the second transaction transfer to the completed transaction list, preventing the writing of the metadata updates to the log file and the metadata disk block to disk. | 12-29-2016 |
20160378881 | AGGREGATING AND SUMMARIZING SEQUENCES OF HIERARCHICAL RECORDS - Sequences of hierarchical records are aggregated and summarized. A capture log that includes a plurality of operations of a workload is received. A first data structure that models transaction types as sequences of nodes is created. The nodes identify operations in the workload. A present operation and a transaction identifier are read from the capture log. The transaction identifier is dissociated from a first node that identifies a prior operation. The transaction identifier is associated with a second node that identifies the present operation. In a second data structure that associates nodes with transaction identifiers, the first node is dissociated from the transaction identifier and the second node is associated with the transaction identifier. A summary of the workload is generated based, at least in part, on the first and second data structures. The summary includes signatures of transaction types and counts of instances of the transaction types. | 12-29-2016 |
20180025049 | Server and Data Processing Method | 01-25-2018 |
20190146967 | LOGS TO METRICS SYNTHESIS | 05-16-2019 |
20190147079 | TECHNIQUES FOR GENERATING PRE-EMPTIVE EXPECTATION MESSAGES | 05-16-2019 |
20190147080 | TECHNIQUES FOR AUTOMATICALLY ADDRESSING ANOMALOUS BEHAVIOR | 05-16-2019 |
20220138179 | PRIVATE BLOCKCHAIN SYSTEM AND METHOD - A system, apparatus or method includes defining and creating a private blockchain that stores records or documents on a cloud storage by a predefined set of nodes, receiving a selection from a user node of a record or of a document for modification where the selection creates a flagged record or a flagged document, receiving a vote tally from among the predefined set of nodes, and modifying the record or document based on a consensus of the vote tally by adding an update block to the blockchain. The system, apparatus or method can further broadcast the update block to each node in the predefined set of nodes, add the update block to a local blockchain of each node, and present the flagged document or the flagged record as modified by the update block. | 05-05-2022 |
20220138180 | BLOCKCHAIN SERVICE BASED APPLICATION GENERATOR - Disclosed herein are various embodiments for blockchain service based application generator. An embodiment operates by determining a blockchain service configured to access, store, and receive updates to transactional data of the blockchain service. An enhanced data object including a wrapper with one or more additional properties corresponding to an original data object of the blockchain service is generated. The enhanced data object is transformed into a data protocol object. Metadata is generated based on the data protocol object. A data protocol service is generated based on the metadata. The application interface is configured based on the metadata, wherein the application interface is configured to communicate with both the data protocol service and the blockchain service. The application interface is provided to a user who is enabled to update the transactional data through the application interface. | 05-05-2022 |
20220138181 | SCHEMA-BASED PRUNING OF BLOCKCHAIN DATA - An example operation may include one or more of receiving, from a client, a pruned data structure that comprises a plurality of fields and a plurality of hash values, respectively, identifying a schema associated with the pruned data structure, determining whether the pruned data structure is a valid based on the plurality of fields in the data structure and the identified schema associated with the client, and in response to a determination that the pruned data structure is valid, committing the pruned data structure to a blockchain. | 05-05-2022 |
20220138182 | SYSTEMS AND METHODS OF TRANSACTION IDENTIFICATION GENERATION FOR TRANSACTION-BASED ENVIRONMENT - Described herein are systems and methods for transaction identification (ID) generation in transaction-based environments. The systems and methods provided generated transaction IDs which inherently define a range of values (a range of blockchain heights) within which the transaction is valid. This obviates problems associated with traditional transaction ID databases where a transaction ID only comprises a hashed value. That is, the presently disclosed systems and methods are an improvement over traditional hashing schemes as in traditional hashing schemes, a server must traverse an entire transaction ID database to determine if an incoming transaction is valid. | 05-05-2022 |