Abstract: Provided are a computer program product, system, and method for distributed processing of a query with distributed posting lists. A dispatch map has entries, wherein each entry identifies one of a plurality of terms in a dictionary, wherein for each of the terms there is a posting list identifying zero or more objects including the term, wherein at least one of the dispatch map entries indicate at least one distributed processing element including the posting list for the term. The dispatch map is used to dispatch sub-expressions comprising portions of a query to distributed processing elements having the posting lists for terms in the sub-expressions, wherein the distributed processing elements distributed the sub-expressions execute the sub-expressions on the posting lists for the terms in the sub-expression.

Abstract: A method is provided for ensuring transactional integrity of a system that includes a first subsystem and a second subsystem. The first subsystem receives a request to process a transaction. The first subsystem sends to the second subsystem the request to process a transaction. Each of the subsystems process the identical request. An indicia engine at each subsystem computes indicia of the outcome of the processing of the identical request. The indicia engine at the second subsystem sends its computed indicia to the first subsystem, and the indicia engine at the first subsystem compares its computed indicia with the indicia received from the second subsystem, and sends a transaction abort directive to the second subsystem when the comparison indicates that the computed indicia of the second subsystem does not match the computed indicia of the first subsystem, thereby indicating a lack of transactional integrity in one or both of the first and second subsystems.

Abstract: An approach is provided for rationalizing operational data. A current data profile of a current dataset utilized by a current data transaction is determined. Persisted knowledge of previous data transactions is determined to include a previous data profile of a previous dataset that matches the current data profile. If the persisted knowledge indicates that data size and shape corrections were applied to the previous dataset, filtering corrections of the current dataset based on the data size and shape corrections are determined, the persisted knowledge is rationalized based on the filtering corrections, and queries of the current transaction are modified based on the filtering corrections, or if the data size and shape corrections were not applied to the previous dataset, the persisted knowledge is rationalized based on the data profile match and the queries of the current transaction are modified based on the rationalized persisted knowledge.

Abstract: A system and method for handling queries where the queries and the answers to those queries are transmitted by means of a network which may have significantly variable latencies. The system and method involve copying the queries and calculating a response to each copy of the query and sending each response over the network. The first-received response can then be acted upon. The query may be divided up into sub-queries which are then replicated and sent for determination.

Abstract: The present disclosure relates generally to techniques for displaying information in a repository system. In certain embodiments, techniques are described for dynamically determining a view, based on a role of a user, to display information stored in a repository system about one or more objects in a computing environment. An object can include an application, a process, a service, an endpoint device, a method, etc., which can exist in a computing environment. An object can include a resource (e.g., a data structure or a database) in a computing environment. The repository system can store information about an object and its attributes. The information stored in the repository system about an object can be dynamically displayed to a user based on the role associated with the user.

Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.

Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.

Abstract: Some embodiments of the present invention include a method for controlling requests to be transmitted to a server computing system. The method generating, by a first requester, a request to be transmitted to a first server computing system, the first requester being part of a first group of requesters, each of the requesters in the first group of requesters is configured to access an indicator to determine whether the first server computing system is ready to receive its request, the indicator being set or reset at least based on a response received from the first server computing system, the indicator stored in a memory device associated with a second server computing system; and based on the indicator indicating that the first server computing system is not ready, delaying from transmitting, by the first requester, the request to the first server computing system.

Abstract: In developing applications for a plurality of node types, a meta-data definition of the application can be captured into an application definition module. The meta-data definition can describe the application for the plurality of node types. A code generation module can then automatically generate the application code for the plurality of node types, including transaction aware code. The code can be compiled per node type and the packaging necessary to deploy the application to the plurality of node types can also be automatically generated.

Abstract: Systems and methods for implementing a two-tier commit protocol are described herein. In one or more embodiments, a storage system is configured to receive a request to store an object within a storage system, the object comprising (a) data and (b) metadata. Responsive to the request, the metadata is transmitted to a metadata tier of the storage system, which generates a first acknowledgment that a metadata record has been created in the metadata tier with a pending status. Responsive to the first acknowledgment, the object data is transmitted to a data tier of the storage system. A second acknowledgment is then generated indicating that a data record has been created with a pending status. Responsive to the second acknowledgement, the metadata record is updated to a committed status. The data record in the data tier is then updated to a committed status.

Abstract: A transaction manager for handling operations on data in a storage system provides a system for executing transactions that uses a versioned tuple cache to achieve fast, abortable transactions using a redo-only log. The transaction manager updates an in-memory key-value store and also attaches a transaction identifier to the tuple as a minor key. Opportunistic locking can be accomplished due to the low cost of aborting transactions.

Abstract: An exclusive lock is acquired on each of an outer database ownership table and an inner database ownership table to obtain ownership of a database. The exclusive locks are converted to a pair of overlapping shared locks on each of the outer database ownership table and the inner database ownership table, where 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 permits database maintenance operations to be performed while maintaining the ownership of the database.

Abstract: The creation of transaction segment records that are each associated with transaction segments within a log that includes multiple tasks, each of at least some associated with a corresponding transaction. The transaction segment records each include a transaction identifier set that define which tasks are included within the transaction segment. The transaction identifier sets are non-overlapping such that the transaction segments may be processed substantially in parallel by dispatching the transaction segment records to different worker threads. The identity of a latest external dependee entity, if any, is included within the transaction segment record. Upon being assigned a transaction segment for processing, the module assigned the transaction segment awaits completion of processing of the latest external dependee entity prior to processing the transaction segment.

Abstract: Techniques are described for using a distributed key-value store to store data and track transactions performed against the data. The key-value store may include data objects as files in a file system, such that the file name of a file is a key and the contents of the file is a value corresponding to the key. The key-value store may also include transaction objects that track the status of transactions to modify the data objects, the status being one of open, committed, or cancelled. Previous and updated data may be included in the value of a data object to indicate that the data object is in the process of being modified. The value may also include a transaction identifier identifying the transaction that is modifying the data object.

Abstract: A system is provided that reports audit data. The system defines metadata that defines a business object of an application module and an attribute of the business object as being auditable. The system further configures the metadata to enable auditing for the attribute of the business object. The system further generates audit data for the attribute of the business object based on the metadata, where the audit data includes a history of one or more modifications to the attribute of the business object. The system further stores the audit data within a shadow database table based on the metadata. The system further displays the audit data within a user interface.

Abstract: In accordance with an embodiment, described herein is a system and method for providing security in a multitenant application server environment. In accordance with an embodiment, per-partition security configuration includes: per-partition security realm (including configuration for authentication, authorization, credential mapping, auditing, password validation, certificate validation, and user lockout); SSL configuration, including keys, certificates, and other configuration attributes; and access control for partition and global resources. An administrator can designate one or more partition users as partition administrators, via grant of roles.

Abstract: The disclosed embodiments include systems and methods for extracting information from a transaction description. In one embodiment, a system is disclosed that may include one or more processors and one or more memory devices storing instructions that, when executed by the one or more processors, performs operations consistent with the disclosed embodiments. In one embodiment, the operations may include receiving a transaction description. The operations may also include identifying known location information corresponding to the transaction description and determining whether information from the transaction description corresponds to the identified known location information. The operations may further include removing location information from the transaction description based on the determination. In another aspect, the operations may also include extracting additional location information from the transaction description that is not associated with the known location information.

Abstract: Aspects include managing distribution of messages from a message queue to a plurality of consumers for processing by maintaining a processing history for the messages in the message queue. The processing history identifies each message in the message queue by a message identifier and consumers having previously failed to successfully process a message in the message queue having the message identifier. Aspects also include considering the suitability of a particular consumer to receive a next message to be processed from the message queue by determining the message identifier of the next message and the consumer identifier of the particular consumer. Aspects further include distributing the next message to be processed to the particular consumer if the consumer identifier of the particular consumer is not present in the checked set of consumer identifiers.

Abstract: Disclosed herein are system, method, and computer program product embodiments for distributed transaction processing in massively parallel processing (MPP) databases. An embodiment operates by receiving a transaction including a read timestamp corresponding to a version of data of a database associated with the query. It is determined whether a locally stored portion of the data of the database has a local timestamp that is equivalent to or after the read timestamp. A lock may be requested, and if received, the data is updated.

Abstract: A journal manager of a multi-data-store storage system receives a transaction which includes a message to be stored in the storage system's journal if the transaction request is accepted for commit. The journal manager performs a conflict detection operation, accepts the transaction request, and stores a corresponding committed transaction entry including the message in the journal. A write applier associated with a registered materialization node of the journal reads the committed transaction entry and applies a write indicated in the entry. A registered message subscriber of the journal reads the committed transaction entry asynchronously with respect to the write applier, and reads the contents of the message without applying the write.

Abstract: One or more publish control-plane components (PCCs) of a data store determine that operation records (ORs) indicative of operations performed on a data object are to be published via a durable log publisher. The PCCs assign, for a particular publish session of one or more publish sessions established for the data object, an OR submitter to transmit ORs associated with the data object from a designated buffer to the durable log publisher. The OR submitter transmits a particular OR to the publisher, and the publisher replicates the particular OR at nodes of a DAG (directed acyclic graph). Contents of the OR are provided by the publisher in response to a read request.

Abstract: New techniques for automated database deployment are disclosed. Change SQL files intended for any target database are checked into a designated source code control repository. A pre-validation process is applied to the proposed changes and reports all errors therein, not just the first error found. A tracking mechanism may find and report changes that have been done against a database since the last deployment, including changes applied without following source control procedure. All recent SQL files since previous promotion can be automatically gathered and built into a master run book SQL for execution in a correct sequence. Backout SQL may also be automatically generated and validated. A pre-test or mock deployment may be performed during regular business hours against an automatically generated copy of the target database. With these techniques, deployments and maintenance of databases become more efficient, and failure rates and failover responses could be significantly improved.

Abstract: A computer-implemented method for enabling replication targets to reclaim unused storage space on thin-provisioned storage systems may include: 1) replicating data from a replication source to a replication target, 2) identifying unused storage space within the replicated data, 3) generating a reclamation request for reclaiming the unused storage space from a thin-provisioned storage system that provides thin-provisioned storage for the replication target, and then 4) issuing the reclamation request to the thin-provisioned storage system in order to reclaim the unused storage space from the thin-provisioned storage system. Various other related systems, methods, and configured computer-readable media are also disclosed.

Abstract: A planning indication directed to a declaratively-described operation and a target MPP database is received where the operation includes multiple mid-operation states and the operation includes, for each state in the plurality of states, those types of devices in a MPP database which would be affected by that state if the operation were performed, including a first set of affected device types and a first mid-operation state. In response to receiving the planning indication, affected device(s) in the target MPP database which would be affected by the first mid-operation state if the operation were performed are determined without performing the operation on the target MPP database. This determination is based at least in part on the first set of affected device types included in the operation. The first mid-operation state and the affected devices are indicated in a display.

Abstract: Non-blocking processing of federated transactions may be implemented for distributed data partitions. A transaction may be received that specifies keys at data nodes to lock in order to perform the transaction. Lock requests are generated and sent to the data nodes which identify sibling keys to be locked at other data nodes for the transaction. In response to receiving the lock requests, data nodes may send to lock queues indicating other lock requests for the keys at the data node. An evaluation of the lock queues based, at least in part, on an ordering of the lock requests in the lock queues may be performed to identify a particular transaction to commit. Once identified, a request to commit the identified transaction may be sent to the particular data nodes indicated by the sibling keys in a lock request for the identified transaction.

Abstract: A method is provided to verify the computational results of a transaction processing system utilizing cloud resources in a high-availability and scalable fashion. A transaction is allowed to modify an application's state only if the validity of the result of the processing of the transaction is verified across the majority of the participating child nodes in the cloud. Otherwise, the transaction is aborted.

Abstract: A first computer of a distributed computing system, which is an object-oriented enterprise based application server, receives a request for a transaction. The first computer generates a unique identifier for the transaction and associates an indicator with the transaction. The indicator indicates whether coordination of transaction processing can be performed by a second computer, of the distributed computing system, that is any application server apart from an object-oriented enterprise based application server. The first computer sends the unique identifier and the indicator to the second computer which enables the second computer to participate as the coordinator for the processing of that transaction if coordination of transaction processing is permitted to be performed by the second computer.

Abstract: Techniques for restoring point-in-time and transaction consistency across consistency groups between a first and a second independent database management system (DBMS) for a disaster recovery. Several consistency groups (CGs) are defined for replication. For each CG in the first DBMS data changes are transmitted to a second DBMS. A timestamp representing a most recently received commit log record or a heartbeat during periods of inactivity for a CG is stored in a database table at regular intervals. At regular intervals, the timestamp is compared with timestamps for other CGs to identify a common time at which data to be applied to the CGs in the second DBMS have been received into a recoverable data store. The received data is applied to the CGs in the second DBMS up to the common time.

Abstract: A data processing device includes a hash table management module that sequentially steps through linear address space of the hash table to identify hash chain in sequential address order. Each identified hash chain is evaluated, before identifying a next hash chain, to remove any entries marked for deletion.

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

Abstract: Embodiments relate to speculative branch handling for transaction abort. An aspect includes detecting a beginning of a current execution of a transaction. Another aspect includes, based on detecting the beginning of the transaction, disabling speculative execution based on branch prediction of an initial branch instruction of the transaction, wherein the initial branch instruction branches to two possible paths, and wherein a first path of the two possible paths comprises an abort handler. Another aspect includes disabling updating of a history table for the initial branch instruction.

Abstract: The invention relates to a computer system for both online transaction processing and online analytical processing, comprising: a processor coupled to a database, the database comprising the database comprising: a main store (116) for storing records, a differential buffer (114) for receiving and buffering added or deleted or modified records, the differential buffer being coupled to the main store, a schema comprising records stored in the main store and records stored in the differential buffer, and a cache store (112) for caching a result of a query against the schema; and a cache controller (106) executable by the processor and communicatively coupled to the database, the cache controller being configured for: storing the result of the query in the cache store; receiving an analytical request; and determining, in response to the received request, an up-to-date result of the query by (216): accessing the cache store to obtain the cached result; determining the records of the schema that have been added or

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: Execution of a transaction may be initiated by a CPU in a transactional execution (TX) environment. A set of TX performance characteristics of the transaction during the transactional execution may be collected and stored in a location specified by an instruction of the transaction when the transactional execution ends or aborts.

Abstract: The present disclosure provides for enabling concurrent rating during a re-rating operation. A first notification is received. The first notification indicates that a re-rating process, which comprises a modification to a customer state for a customer service account, has been initiated for the customer service account. A concurrent usage request is received while the re-rating process is ongoing. The concurrent usage request comprises a request to perform a transaction affecting the customer service account. The concurrent usage request is then processed.

Abstract: Execution of a transaction may be initiated by a CPU in a transactional execution (TX) environment. A set of TX performance characteristics of the transaction during the transactional execution may be collected and stored in a location specified by an instruction of the transaction when the transactional execution ends or aborts.

Abstract: The present invention relates to a web server having a web application using published API of one or more cloud storage providers, said web application being dedicated to secure and economical sharing of encrypted files residing at the cloud storage providers, said files being managed under a virtual folder which is shared by a group of different entities.

Abstract: A modular search object framework provides modular search results including entity search results reflecting the intent of a searcher. Also, an interface (such as a graphical user interface provided by the framework), aids in organizing results (such as links, titles, and description) according to the intent of the user as manifest in the search query and interactions with the interface. Circuitry of the framework also predicts user intent from historical information corresponding to the searcher (or to a group with which the searcher is associated).

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

Abstract: Methods and arrangements for managing a consistency group for computing sites. A plurality of computing sites are communicated with, each of the sites comprising one or more of (i) and (ii): (i) at least one virtual machine; and (ii) at least one server. Updates captured at each of the sites are received, and the captured updates are batched. The batched updates are communicated to the plurality of sites, thereby ensuring data consistency across the plurality of sites. Other variants and embodiments are broadly contemplated herein.

Abstract: In developing applications for a plurality of node types, a meta-data definition of the application can be captured into an application definition module. The meta-data definition can describe the application for the plurality of node types. A code generation module can then automatically generate the application code for the plurality of node types, including transaction aware code. The code can be compiled per node type and the packaging necessary to deploy the application to the plurality of node types can also be automatically generated.

Abstract: One embodiment provides an apparatus. The apparatus includes a processor, a chipset, a memory to store a process, and logic. The processor includes one or more core(s) and is to execute the process. The logic is to acquire performance monitoring data in response to a platform processor utilization parameter (PUP) greater than a detection utilization threshold (UT), identify a spin loop based, at least in part, on at least one of a detected hot function and/or a detected hot loop, modify the identified spin loop using binary translation to create a modified process portion, and implement redirection from the identified spin loop to the modified process portion.

Abstract: A system and method can support processing a transaction with a plurality of transaction branches. A transaction manager operates to send, to a resource manager, a prepare request for each said transaction branch in the plurality of transaction branches with the exception of at least one transaction branch. Furthermore, after receiving an indication from the resource manager that the received preparation requests are handled successfully (i.e. the transaction branch is read-only and has been committed), the transaction manager operates to send a commit request to commit said at least one transaction branch, which is on hold, to the resource manager.

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

Abstract: At least one read operation of at least one object of an object graph is initiated. For each corresponding read operation, a reference count of the root object is incremented (with the reference count 1 for the root object initially reflecting a single anchor pointer pointing to the root object). Subsequently, one or more of the objects are changed. Incompatible changes result in the root object, at least one changed object, and any intervening objects within the hierarchy of objects being cloned. The anchor pointer is then linked to the cloned root object. The root object is later dropped when the reference count for the root object is zero. In addition, the object graph is traversed starting at the root object and ending at the at least one changed object removing any edges for such objects. Each object having a reference count of zero is then dropped.

Abstract: A memory controller of a mass memory device determining that a memory operation has been initiated which involves the mass memory device, and in response dynamically checks for available processing resources of a host device that is operatively coupled to the mass memory device and thereafter puts at least one of the available processing resources into use for performing the memory operation. In various non-limiting examples: the available processing resources may be a core engine of a multi-core CPU, a DPS or a graphics processor; central processing unit; a digital signal processor; and a graphics processor; and it may also be dynamically checked whether memory resources of the host are available and those can be similarly put into use (e.g., write data to a DRAM of the host, process data in the DRAM with the host DSP, then write the processed data to the mass memory device).

Abstract: A processor includes a processor core, a cache, and a tracker. The processor core is configured to execute persistent write instructions and receive notifications of completed persistent write instructions. The tracker is configured to track the completion state of a persistent write instruction.

Abstract: Example apparatus and methods protect state in a file system using a message-passing multi-threaded journal. One example apparatus stores, in memory, data and metadata affected by a file system transaction. The apparatus may run a thread that receives the file system transaction from the file system and that produces a set of atomic operations configured to complete the file system transaction. The apparatus may also run a thread that records a set of journal entries associated with the set of atomic operations to protect the file system while the atomic operations complete. The journal entries may be written on a non-volatile computer-readable medium. The apparatus may also run a thread that co-ordinates usage of space on the computer-readable medium. Rather than synchronizing journal activity with locks, the threads running on the example apparatus may synchronize their activity using message passing.

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