Abstract: A query is received from a client that specifies at least one database operation implicating data within a first database and within a second database. The first database has a first transaction manager and the second database has a second transaction manager. Thereafter, a plurality of transactions responsive to the query are initiated to access the data within the first database and the second database. Execution of the plurality of transactions are coordinated using the first transaction manager such that commits for both of the first database and the second database are handled by the first transaction manager. Data responsive to the query can then be provided to the client. Related apparatus, systems, techniques and articles are also described.

Abstract: A computer readable medium storing a computer program for providing a method for evaluating the performance of a software application, the computer program executable by at least one or the one or more processors. The computer program comprising a set of instructions for receiving an indication of the initiation of a workflow transaction in an Application, determining whether the workflow transaction is to be marked as a traceable transaction based on a Measurement Marker Algorithm, tracking the performance of operations executed for the workflow transaction, and storing raw Call Metrics based on the tracked performance in an Intermediate memory.

Abstract: A data system in which a parent transaction that has multiple nested transactions has isolation between the nested transactions. Each of at least some of the plurality of operations are included within a nested transaction within the parent transaction. For each of at least some of the nested transactions, a begin transaction identifier is assigned to the nested transaction; and on or around completion of the nested transaction, a completion transaction identifier is assigned as a statement identifier at least one object version operated upon by the nested transaction. Visibility of a particular version of an object to an active nested transaction may be verified by comparing the begin transaction identifier of the active nested transaction to the statement identifier of the particular version of the object. The comparison is done such that visibility achieves the proper isolation between nested transactions.

Abstract: A processor(s) initiates a database transaction, in a computing environment that includes a database that includes one or more memory devices. The processor(s) forks a first address space that represents a current state of the database, to create a second address space. The processor(s) writes an entry indicating timing of the initiating to a log file and generates a file that is mapped to the one or more memory devices. The file includes differences in state between the current state of the database and a state subsequent to executing and committing the database transaction, and a timestamp indicating timing for committing the database transaction. The processor(s) write the database transaction to the second address space.

Abstract: An approach is provided for rationalizing operational data. Persisted knowledge of previous data transactions is determined to not include a previous data profile matching a current data profile. Stochastic data sampling generates a sample of a current dataset. Data size and shape corrections are determined and updated by iterations of a statistical inference technique. Data in the sample is corrected by using the data size and shape corrections to provide a confidence level exceeding a threshold. Persisted knowledge configurations are updated with parameters of the statistical inference technique, the data size and shape corrections, and filtering rule(s). A recommended modification of a query of a current data transaction is determined to provide data in the current dataset with the level of confidence exceeding the threshold. The recommended modification is applied to the query.

Abstract: Aspects of the present invention include a method, which includes updating, by a processor, one or more distributed memory datasets having data stored therein in response to a write data operation, the one or more distributed data memory datasets being located in a database. The method further includes splitting, by the processor, any one of the one or more distributed memory datasets into two distributed memory datasets when a size of the any one of the one or more distributed memory datasets exceeds a threshold value. The method further includes moving, by the processor, the stored data in any one of the one or more distributed memory datasets to regions within the database upon an occurrence of one or more conditions with respect to the one or more distributed memory datasets. Other aspects of the present invention include a system and a computer program product.

Abstract: The present invention is related to a method for load balancing and connection multiplexing structured query language (SQL) queries among a plurality of database servers. A device intermediary to a plurality of clients and a plurality of database servers receives an SQL query to access a database provided by the plurality of database servers from a client via a first connection established between the device and the client. The device identifies for the SQL query a policy for selecting among the plurality of servers. The policy includes an expression to identify predetermined data from content of the SQL query. The device may select a server from the plurality of servers based on applying the expression of the policy to content of the SQL query and forward the SQL query to the selected server via a second connection established between the device and the selected server.

Abstract: A database system can receive, from a client, a query specifying at least one database operation implicating data within a first database and within a second database. The first database can have a first transaction manager and the second database can have a second transaction manager. Thereafter, a plurality of transactions are initiated that are responsive to the query to access the data within the first database and the second database. The first transaction manager and the second transaction manager together coordinate execution of the plurality of transactions. All changes specified by the at least one database operation are persisted in persistence of the first database including changes implicating data stored within the second database. Data responsive to the query can then optionally be provided to the client. Related apparatus, systems, techniques and articles are also described.

Abstract: The system may be configured to perform operations including receiving a transaction message based on a marker associated with the transaction message; applying a processing module to the transaction message, wherein the processing module is comprised in the processing machine; accessing processing information in the memory in order to execute the processing module; and processing the transaction message by executing the processing module on the transaction message. The transaction message may have been separated from an input file and may represent a transaction between a merchant and a consumer. The marker may represent a transaction characteristic of the transaction message.

Abstract: Methods, systems, and computer-readable media of columnar storage of a database index are disclosed. A particular columnar index includes a column store that stores rows of the columnar index in a column-wise fashion and a delta store that stores rows of the columnar index in a row-wise fashion. The column store also includes an absence flag array. The absence flag array includes entries that indicate whether certain rows have been logically deleted from the column store.

Abstract: A query is received from a client that specifies at least one database operation implicating data within a first database and within a second database. The second database includes a document store storing a collection of documents. Thereafter, a plurality of transactions responsive to the query are initiated to access the data within the first database and the second database. Execution of the plurality of transactions are coordinated between the first database and the second database. All changes specified by the at least one database operation are persisted in the first database including changes implicating data stored within the second database. Data responsive to the query can then be provided to the client.

Abstract: Complex workflows are composed of a plurality of idempotent actions. During execution of the complex workflows, a computing system accesses the plurality of idempotent actions and determines whether corresponding guard conditions for triggering processing of the idempotent action are satisfied. When satisfied, a lock is taken on one or more resources used for executing the idempotent code of the idempotent action and execution of the idempotent code is initiated. Thereafter, upon successful execution of the idempotent code, the corresponding record is updated to reflect execution of the idempotent action and the lock is released. When execution of the idempotent action is unsuccessful, an exception is logged and the lock is released.

Abstract: A query is received from a client that specifies at least one database operation implicating data within a first database and within a second database. The first database can have a first transaction manager and the second database can have a second transaction manager. Thereafter, a plurality of transactions responsive to the query are initiated to access the data within the first database and the second database. Execution of the plurality of transactions is then coordinated using the first transaction manager and the second transaction manager. All changes specified by the at least one database operation are logged in a distributed log in the first database including changes implicating data stored within the second database. The distributed log is configured such that it is accessible by both of the first transaction manager and the second transaction manager.

Abstract: A method is provided for performing transaction processing in a system that includes a transaction distributor and a plurality of nodes. Each of the nodes include a processor, an application executing in the processor, and an instance of a database used by the application. Each node executes transactions. The transaction distributor selects at least two of the nodes to receive the same request to process a transaction, and the processor at each of the at least two nodes executes the same request to process a transaction. Each of the at least two nodes replicates to one or more other nodes in the system the steps and operations of the transactions up until a transaction END step.

Abstract: An analytical computing environment for large data sets comprises a software platform for data management. The platform provides various automation and self-service features to enable those users to rapidly provision and manage an agile analytics environment. The platform leverages a metadata repository, which tracks and manages all aspects of the data lifecycle. The repository maintains various types of platform metadata including, for example, status information (load dates, quality exceptions, access rights, etc.), definitions (business meaning, technical formats, etc.), lineage (data sources and processes creating a data set, etc.), and user data (user rights, access history, user comments, etc.). Within the platform, the metadata is integrated with all platform services, such as load processing, quality controls and system use. As the system is used, the metadata gets richer and more valuable, supporting additional automation and quality controls.

Abstract: Various examples are directed to systems and methods for executing distributed transactions with dynamic form. A transaction coordinator may send to a first transaction node a commit request indicating a first transaction operation and a first object and receive an indication that the first transaction node holds a lock for the first object. The transaction coordinator may also send to a second transaction node a commit request indicating a second transaction operation and a second object and receive an indication that the second transaction node is one-phase-aware. If the number of enrolled transaction nodes includes at least a threshold number of nodes, the distributed transaction may be converted to a compensation transaction.

Abstract: A computer-implemented method and apparatus, the method comprising: responsive to a user of a mobile device selecting a specific application, starting a parent application with a parameter associated with the specific application, wherein the parent application is configured to provide a functionality of the specific application; retrieving from a local database in the mobile device a configuration of the specific application, wherein the configuration comprises a set of modules used by the specific application and a manner of usage thereof; and activating the set of modules to provide the functionality of the specific application by the parent application.

Abstract: Provided is a data sharing method based on a plurality of blockchains. The method includes registering, by a management server, user block data which includes user information and a hash key of each user of a plurality of users in a user information blockchain, receiving, by the management server, storage information of data provided by a first user from a storage server, and receiving, by the management server, a request for specific data from a second user and transmitting storage information of the specific data to the second user.

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