Abstract: This invention pertains generally to a method for resolving and managing eventual consistency conflicts when using a Prefix Hash Tree (“PHT”) in which the underlying storage system is a Distributed Hash Table (“DHT”). An embodiment according to the within invention comprises a computer implemented method for resolving eventual consistency conflicts when using a PHT and DHT.

Abstract: 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.

Abstract: 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.

Abstract: Methods, systems and devices for performing incremental updates of a partial database stored on a client device from a computer system containing the database of which the partial database is a subset. A first database record which has been inserted into, deleted from or changed in the server database as a result of a database operation is identified in order to perform a corresponding operation on the client device. In addition, a second record that has not been inserted, deleted or changed, but that is related to the first record through a constraint, is identified. The second record is inserted into or deleted from the partial database through a database operation performed on the client device such that the constraint is fulfilled in the partial database. Identification of records is based on database logs and on the structured relationship between record types.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Keys are obtained and aggregated by storing a primary object as an entry in a parent keys storage and a child keys storage, the entry identified as unvisited in each. An object evaluation process is then performed until all unique entries in the parent keys storage and all unique entries in the child keys storage have been visited and by committing the keys of at least one related object as an entry to the hierarchical database. The object evaluation process visits each unvisited object in the parent keys storage and child keys storage by selecting, for the unvisited object, objects in the parent direction that have not already been visited and objects in the child direction that have not already been visited and by inserting the keys of the selected related objects as entries in the parent keys storage or child keys storage.

Abstract: According to example configurations, a speech-processing system parses an uttered sentence into segments. The speech-processing system translates each of the segments in the uttered sentence into candidate textual expressions (i.e., phrases of one or more words) in a first language. The uttered sentence can include multiple phrases or candidate textual expressions. Additionally, the speech-processing system translates each of the candidate textual expressions into candidate textual phrases in a second language. Based at least in part on a product of confidence values associated with the candidate textual expressions in the first language and confidence values associated with the candidate textual phrases in the second language, the speech-processing system produces a confidence metric for each of the candidate textual phrases in the second language.

Abstract: Architecture that includes an ordered and shared log of indexed transaction records represented as multi-version data structures of nodes and node pointers. The log is a sole monolithic source of datastore state and is used for enforcing concurrency control. The architecture also includes a transaction processing component that appends transaction records to the log from concurrent transactions executing on different processors. Each node of a record is assigned a log address.

Abstract: 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.

Abstract: In a multitenant service, security of the entire service is guaranteed by logically separating data for each tenant, and performing control to prevent access to data of another tenant. In an operation of the multitenant service, there are some special cases in which an access to data of another tenant becomes necessary. Further, processing executable across tenants needs to be subjected to restrictions on an executor of the processing and a processing target in addition to restrictions on a processing content. In data access control of the multitenant service, a control operation to determine whether processing is executable across tenants for each API and a control operation to determine whether processing is executable across tenants according to tenant categories of the executor and the processing target are performed.

Abstract: Methods and apparatuses are disclosed that allow for improved speculation success in execute ahead microprocessors. In some embodiments, the method may include speculatively executing a first thread of a program code while a second thread of the program code is executing, determining if a load request is serviceable from a cache line within a cache, and in the event that the load request is serviceable from the cache line, associating a first indicator bit with the cache line. The method also may include determining whether the cache line associated with the first indicator bit has been evicted, and in the event that the cache line is evicted, allowing speculative execution of the first thread to continue.

Abstract: A method, computer program product and apparatus for providing a scheduling mechanism for inserting/updating data items in a database including obtaining each of the at least one keys included within a selected data item, determining whether each of the at least one keys is suitable for processing and storing each of the at least one keys in a first queue when each of the keys is available for processing, otherwise storing the keys in a second queue.

Abstract: A method and system for assessing data quality stored in an enterprise database is provided. In response to a request by a user, a pre-determined event, or other event, a profile is chosen from a list of profiles stored in a profile database based on the request, wherein the profile includes a set of rules for calculating data quality metrics and for triggering workflow processes. One or more data records are received from one or more enterprise databases. The data quality metrics of the one or more data records based on the set of rules for calculating data quality metrics is calculated. Based on the calculated data quality metrics and rules for triggering workflow, a determination is made regarding whether to trigger one or more workflow processes: and, if so, triggering the one or more workflow processes; and/or converting the calculated data quality metrics to a representation for display.

Abstract: 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.

Abstract: 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 (230), and a coupled application retention metric between the first and second reference application identifiers is generated (330). The coupled retention metric is generated by querying (100) an application database including a plurality of application records, where each record includes an application identifier, a user identifier, and retention information. Retention metrics in the application database are compared for application identifiers corresponding to the first or second reference application identifier and having a common user identifier. An application of interest is selected by and its identifier is received (200) from a user of a remote application, where the selected application corresponds to the first reference application identifier.

Abstract: 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.

Abstract: 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.

Abstract: The invention provides in some aspects a distributed rules processing system that includes a first and second digital data processors that are coupled to one another by one or more networks. A rules base and a transactional data base are each coupled to one of the digital data processors; both may be coupled to the same digital data processor or otherwise. One or more coordination modules (e.g., “proxies”), each of which is associated with a respective one of the digital data processors, makes available to a selected one of those digital data processors from the other of those digital data processors (i) one or more selected rules from the rules base, and/or (ii) one or more data from the transactional database on which those rules are to be executed.

Abstract: 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.

Abstract: A system includes an active node and a standby node and zero or more replica nodes. Each of the nodes includes a database system, such as an in-memory database system. Client updates applied to the active node are written through to the standby node, and the standby node writes the updates through to a primary database and updates the replica nodes. Commit ticket numbers tag entries in transaction logs and are used to facilitate recovery if either of the active node or the standby node fails. Updates applied to the primary database are autorefreshed to the active node and written through by the active node to the standby node which propagates the updates to the replica nodes. Bookmarks are used to track updated records of the primary database and are used to facilitate recovery if either of the active node or the standby node fails.

Abstract: A method and data structure for monitoring the progression of a configuration transaction through a communications network is provided. The method includes creating an audit trail associated with the switch-transaction progression, iteratively updating the audit trail incident to an occurrence of a designated transaction-processing substep without overwriting previously stored data, and processing the audit trail so that it is available for access via a user interface. Historical data tracking the configuration transaction's process is preserved rather than overwritten.

Abstract: According to some embodiments, a column-oriented in-memory database structure may be established. The database structure may, for example, include a main store and a dictionary compressed delta store. Moreover, the delta store may comprise a value identifier vector and a delta dictionary associated with a column of the database. A transaction associated with the column may then be received and recorded within the delta store. According to some embodiments, entries associated with the transaction may be added to a value log of the value identifier vector and, independently, to a dictionary log of the delta dictionary.

Abstract: 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.

Abstract: According to one embodiment of the present disclosure, a method and technique is disclosed for maintaining a network connection during transfer of the workload from a global environment of a logical partition to a workload partition of the logical partition and during any subsequent transfer(s).

Abstract: 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.

Abstract: A system and method for receiving and tracking a plurality of transactions and distributing the transactions to at least two replication queues over a network. The system and method comprise a global queue for storing a number of the received transactions in a first predetermined order. The system and method also comprise a sequencer coupled to the global queue for creating a copy of each of the transactions for each of said at least two replication queues and for distributing in a second predetermined order each said copy to each of said at least two replication queues respectively, said copy containing one or more of the received transactions.

Abstract: Systems and methods for managing databases are disclosed. One system includes a processor-addressable physical memory and a processor in communication with the processor-addressable physical memory and configured to execute an environment and to allocate an environment memory to the environment. In such a system, the environment is configured to maintain a database of objects in a database memory within the environment memory. An application executes in an application memory within the environment memory, and upon instantiation of a database object, the application environment allocates memory in the database for the database object, the database providing master storage for the database object. Upon an instruction to obtain the database object from said application, the environment provides to the application a reference to the database object; and upon an access operation on the database object by the application, provides to the application direct access to data of said database object.

Abstract: 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.

Abstract: 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.

Abstract: Row locking is performed at the row level of granularity for database data stored in columnar form. Row level locking entails use of a lock vector that is stored in a compression unit in a data block, the compression unit storing rows in columnar-major format. On an as needed basis, the lock vector is expanded to identify more transactions affecting the rows in the compression unit.

Abstract: 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.

Abstract: In one embodiment, a method for communicating data is provided. The method includes defining a data transmission unit (DTU) to be sent in an xDSL data stream, defining a retransmit container as a time slot that corresponds to the DTU, maintaining, in a retransmit container, a copy of the DTU and an index corresponding to the retransmit container, the retransmit container being maintained at the second device independently of the first device, transmitting the DTU in the xDSL data stream, determining whether the DTU should be retransmitted, and if the DTU should be retransmitted: identifying the DTU by the retransmit container and retransmitting a copy of the DTU as identified by the retransmit container when the DTU reaches a predetermined position in the retransmission buffer.

Abstract: 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.

Abstract: 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.

Abstract: An information processing apparatus including a processor configured to divide print data into a plurality of separated data pieces, and generate a transmitting unit for each of the plurality of separated data pieces. Each of the transmitting units is generated by combining a hash value and the separated data piece, and the hash value for a first transmitting unit is generated using an electronic signature and the hash value for each of transmitting units that is not the first transmitting unit is generated using the previous separated data piece.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Techniques for generating and vending of unique sequence values are described. Each master of a ring of masters is configured to create and vend the unique sequence values downstream to filling pools for eventual client consumption. When a ring of masters is employed, each master communicates with one another to agree on a current range of values that should next be vended. A master may then vend these values to a layer of one or more filling pools, at least of which includes or has access to persistent and non-persistent storage memories.

Abstract: 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.

Abstract: An information processing apparatus includes a detecting unit and a history processing unit. The detecting unit detects a first operation and a second operation. The first operation is an operation of inputting a document to an electronic tray. The second operation is an operation of retrieving a document from the electronic tray.

Abstract: A computerized management system for corporate, entertainment or sports management by a remote party is disclosed. For instance, in entertainment management the entertainment an event is transmitted for the remote party to remotely analyze the performer or participant. A decision is received via a communications link from a remote computing device associated with the remote party, the decision relating to a reading by an actor, choosing between different scripts, a choice of a participant, editing of a script, angle of a lens for a camera shot, and closeness of a lens for a camera shot, which take of a scene is best, choosing between different endings of a script, total budget for a production, amounts to budget for each of a plurality of line items, amounts to spend in advertising, what markets to focus on for release, or what day to release a film in different markets.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A transactional sealed storage system enables data to be accessed according to transactional properties and also enables access to the data to be restricted to secured applications. The transactional properties according to which the data may be accessed may include, for example, at least some levels of atomicity, consistency, isolation, and durability. The access to the data may be restricted by, for example, employing a double layer security policy that involves encrypting the data and also authenticating any application that requests access to the encrypted data.

Abstract: 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.

Abstract: 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.