Abstract: A method for detecting a defect may include extracting, from application code, a registration of a framework object and a request for the framework object, deriving a synthetic request using the registration and the request, transforming the application code by replacing, by a computer processor, the request with the synthetic request, and detecting the defect by performing a static analysis on the transformed application code.

Abstract: A reliable network function virtualization (rVNF) system includes a virtualized network function (VNF) application instance that includes a plurality of physical VNF instances. A load balancer provides an interface between a client and the VNF application instance. A load balancer interface facilitates delivery of packets related to a particular user context to the same physical VNF instance. A communication interface facilitates communication between the client and the VNF application instance. Application storage stores session data associated with the VNF application instance.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for providing blockchain-based data authorization. One of the methods includes receiving, by a blockchain node, a data acquisition transaction submitted by a data user for obtaining target data possessed by a data owner, determining, by the blockchain node, that the data user has obtained authorization of the target data, and executing, by the blockchain node, a smart contract invoked by the data acquisition transaction to provide one or more of the target data and a computational result of one or more predetermined computational operations performed based on the target data to the data user.

Abstract: A data curation system is provided that includes various methods to enable efficient reuse of human and machine effort. To reuse effort, various facilities are presented that model, save, and allow for querying of provenance and state information of a curation workflow and allow for incremental, stateful transitions of the data and metadata thereof.

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.

Abstract: An automated method is provided for replacing a currently operating data replication engine with a new data replication engine. The currently operating data replication engine replicates source database transactions including any new source database transactions committed in an audit trail of the source database before the currently operating data replication engine stops replicating. A list of active database transactions is generated and recorded as a first token in the audit trail. The currently operating data replication engine is stopped when all of the database transactions in the first token have completed. The new data replication engine is started and positioned to begin processing source database transactions in the audit trail of the source database at a beginning position that is located at or prior to the position of the first token in the audit trail.

Abstract: According to some exemplary embodiments of the present disclosure, a method for index recovery performed by a database server is disclosed. The method is an index redo logging method performed by a database server.

Abstract: The subject technology stores database data in a table, the table comprising a plurality of micro-partitions each having rows and columns. The subject technology stores metadata for the table in a data structure, the metadata comprising a first level of the data structure comprising a column expression property comprising information about data stored in a column of a micro-partition of the table, a micro-partition expression property comprising information about data stored in the micro-partition of the table, and a second level of the data structure comprising a grouping expression property comprising information about data stored in the micro-partition and one or more additional micro-partitions of the table.

Abstract: In example implementations, a system may receive an input/output (I/O) operation in an object store storing a first object, determine objects represented in the object store affected by storing the first object, transcode the I/O operation into a transaction including the linked list of updates to objects represented in the object store, determine a persistent storage for storing the transaction and persist the transaction to the persistent storage according to a data structure determined by the type of persistent storage.

Abstract: Techniques are described that enable client computer systems to request an attestation provider server to execute a given algorithm as identified by a decentralized algorithm identifier on the blockchain, using a specific data set. In some embodiments, the owners of the algorithms, data schemas, and data sets use their private key to sign/register each of these decentralized identifier structures, which includes a copy of the owner's public key. Ownership of these decentralized identifiers can be validated by verifying the digital signatures on the blockchain. In some embodiments, only the owner can replace or delete (retire) these identifiers by creating a cancellation transaction on the blockchain for each of these identifiers. In some scenarios, the decentralized identifier structures may include payment options for requesting the execution of an algorithm upon a given appropriate data set.

Abstract: Systems, methods, and devices for multiple level metadata organization in database systems. A system includes a plurality of shared storage devices collectively storing database data across a plurality of tables that each comprise one or more micro-partitions constituting immutable storage devices. The system includes a resource manager configured to manage the storage of database data stored in a table across one or more of the plurality of shared storage devices. The resource manager is configured to manage the storage of metadata for the table. The metadata includes a column expression property with information about data stored in a column, a micro-partition expression property with information about data stored in a micro-partition, a grouping expression property with information about data stored in two or more micro-partitions, and cumulative table metadata with global information about all micro-partitions of the table.

Abstract: A method of synchronizing blockchain state data, where account state data in the blockchain is organized into a Merkle state tree and stored in a database; the Merkle state tree includes a current Merkle state tree formed by a latest account state of each blockchain account; and a history Merkle state tree formed by a history account state of each blockchain account; and the method includes: receiving a data synchronization instruction for the Merkle state tree; in response to the data synchronization instruction, obtaining in real time the current Merkle state tree of the latest block stored in the database of other node device in the blockchain; and storing the obtained current Merkle state tree of the latest block to the local database to complete real-time data synchronization for the Merkle state tree.

Abstract: A journaled database may comprise a computing node that forms a local version of a global state, synchronized with respect to the high-water mark of a data node that maintains the global state. Instructions to modify the state that have been committed, subsequent to forming the local version of the state, may be represented in a merge signature. An uncommitted transaction may be checked for conflicts with respect to a last-ordered committed instruction to modify the data state. Validation with respect to earlier instructions represented by the merge signature may be skipped.

Abstract: A method, system and computer program for analysis of patch impact. The method comprises obtaining first data manipulating statement (DMS) from description of a patch to be installed to a database system; extracting first parse tree and first access path of first DMS; obtaining second DMS from an running database application; extracting second parse tree of second DMS; comparing first parse tree with second parse tree and first access path with second access path; and installing the patch to a database system in response to a determination that first parse tree is a subset of second parse tree and first access path is a subset of second access path.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for digital asset management. One of the methods includes: obtaining a request for creating a digital asset corresponding to a tangible asset, wherein the request comprises one or more characteristics of the digital asset; generating a blockchain contract corresponding to the tangible asset based on the one or more characteristics of the digital asset; and deploying the generated blockchain contract on a blockchain, wherein the deployed blockchain contract is executable to issue the digital asset corresponding to the tangible asset.

Abstract: Implementations of the present application provide a blockchain-based resource allocation method. A target transaction is obtained, by a first node device in a blockchain network, from a distributed database of the blockchain network. The blockchain network comprises a target user device of a target user and the first node device. The target transaction comprises service behavior data of the target user, and the service behavior data of the target user is generated by the target user device by using a target service. A smart contract corresponding to an allocation of a resource is invoked comprising: executing a resource allocation logic that is stored in the smart contract and that is related to the service behavior data of the target user, and performing the allocation of the resource to the target user.

Abstract: Disclosed is a method for controlling a database service for processing a service according to an exemplary embodiment of the present disclosure.

Abstract: Certain embodiments described relate to methods and systems for adding one or more nodes to a first cluster including a first node in a computer system. A method performed by the first node comprises retrieving a first cluster configuration associated with the first cluster from a distributed database through a first database server (DBS) and creating a second cluster configuration using the first cluster configuration and information received from a second node as part of a request to join the first cluster. The method further comprises populating a first one or more local trust stores of a first one or more processes executing on the first node with a second one or more security certificates of a second one or more processes executing on the second node. The method further comprises writing the second cluster configuration to the distributed database and returning the second cluster configuration to the second node.

Abstract: An efficient and scalable transaction processing using a consensus-based transaction model is disclosed. A transaction processor receives a transaction that includes a plurality of update subtransactions to be performed against a corresponding plurality of resources. A transaction identifier (ID) that corresponds to the transaction is determined. For each resource of the plurality of resources, the transaction ID is sent to a resource manager associated with the resource to determine a status of the corresponding update subtransaction as one of 1) a not seen status, 2) a prepared status, or 3) a committed status. Based on the status of the corresponding update subtransaction, any action against the resource via the resource manager that is necessary to bring the status of the corresponding update subtransaction to the committed status is performed. The transaction is marked as being completed.

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: Provided are systems and methods to acquire a manifest data file and a binary copy of a document store slice log having a first filename and comprising a plurality of entries, each of the plurality of entries associated with a respective database transaction and a commit identifier, and the manifest data file indicating one or more data partitions and one or more slices of each of the one or more data partitions, acquire a partition log for one of the indicated one or more data partitions, the generated partition log comprising a log entry associated with a transaction to create a slice and including a second filename associated with the slice, sort the plurality of entries of the document store slice log based on their associated commit identifiers, change the commit identifiers of each of the plurality of entries to a same commit identifier, and store the sorted and changed entries in a second document store slice log having the second filename.

Abstract: Some examples include decomposing an application into fragments and streaming the application in fragments. For instance, a plurality of application fragments may include a first application fragment and a second application fragment that each correspond to a portion of a mobile game application. When streaming the first application fragment to the mobile device, a system may determine that the second application fragment follows the first application fragment based on a fragments relationship data structure. The fragments relationship data structure may associate the first application fragment with the second application fragment based on an analysis of the fragment information that indicates that the second application fragment follows the first application fragment during operation of the mobile game application. The system may stream the second application fragment to the mobile device based on the determination that the second application fragment follows the first application fragment.

Abstract: A method for executing a graph algorithm may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: Systems, methods, and devices for multiple level metadata organization in database systems. A system includes a plurality of shared storage devices collectively storing database data across a plurality of tables that each comprise one or more micro-partitions including immutable storage devices. The system includes a resource manager configured to manage the storage of database data stored in a table across one or more of the plurality of shared storage devices. The resource manager is configured to manage the storage of metadata for the table. The metadata includes a column expression property with information about data stored in a column, a micro-partition expression property with information about data stored in a micro-partition, a grouping expression property with information about data stored in two or more micro-partitions, and cumulative table metadata with global information about all micro-partitions of the table.

Abstract: The present disclosure describes methods, systems, and computer program products for serializing data for data transfer. One computer-implemented method includes analyzing a column of data stored in the first database to determine at least one serialization parameter, the at least one serialization parameter comprises a repetition counter, a replication counter, or a variable type; determining a data serialization scheme associated with the data based on at least one of the repetition count or the replication counter; determining a variable serialization scheme associated with the data based on the variable type; repeating the analyzing, the determining of the data serialization scheme, and the determining of the variable serialization scheme; serializing the data stored in the first database using the data serialization scheme associated with the data and the variable serialization scheme associated with the data; and transferring the serialized data to the second database.

Abstract: Embodiments of the present invention provide a method, computer program product, and computer system for ordering records in a blocked record environment. The method includes generating metadata associated with blocked records. The metadata is appended to the end of a set of blocked records. The blocked records and metadata is de-blocked and stored such that the metadata is grouped with its corresponding records.

Abstract: This disclosure provides various techniques that may allow for key-level lock requests in a database to be managed by code that manages a memory buffer for the database. The transaction-level locks and other higher level locks may be managed by a separate lock manager. In an embodiment, the code inserts key-level lock requests in the record chain even if there is a conflict, and the key-level lock requests remain in the chain after the locks are subsequently granted. Preemption may also be supported in the record chain, in some embodiments.

Abstract: A method for performing a write operation in a distributed storage system is disclosed. The method comprises receiving a first time-stamped write request from a proxy server. Further, the method comprises determining if the first time-stamped write request is within a time window of a reorder buffer and if the first time-stamped write request overlaps with a second time-stamped write request in the reorder buffer. Responsive to a determination that the first time-stamped write request is outside the time window or that the first time-stamped write request is within the time window but has an older time-stamp than the second time-stamped write request, the method comprises rejecting the first time-stamped write request. Otherwise, the method comprises inserting the first time-stamped write request in the reorder buffer in timestamp order and transmitting an accept to the proxy server.

Abstract: The example embodiments are directed to a system and method for detecting phantom data items in a blockchain transaction. In an example, the method includes one or more of generating a transaction data set during a read phase of a blockchain transaction, the transaction data set including an identification of each query of the transaction executed during the read phase and results of each query, generating a validation data set by re-executing each query during a validation phase of the blockchain transaction, the validation data set including query results of each respective re-executed query, determining whether the blockchain transaction observes one or more phantom data items based on the query results of the transaction data set and the validation data set, and, in response to determining the transaction observes the one or more phantom data items, preventing the transaction data set from being written to the blockchain.

Abstract: Techniques are described for creating multiple virtual network interfaces usable by a logically-related group of one or more containers (“pod”) for communicating on respective virtual networks of a network infrastructure. In some examples, a control flow for pod network interface configuration on a host includes obtaining, by a CNI instance, a list of multiple virtual network interfaces from an agent of a network controller that is executing on the host. The single CNI instance processes the list of multiple virtual network interfaces to create corresponding virtual network interfaces for the pod and, for each of the virtual network interfaces, to attach the virtual network interface to the pod and to the virtual router or bridge for the host. In this way, the single CNI enables packetized communications by containers of the pod over multiple networks using the multiple virtual network interfaces configured for the pod.

Abstract: A method includes identifying a state of an application and taking a snapshot of application data. The method continues to generate a virtual filter input/output snapshot from I/O filter records for the snapshot. The filer records are generated by a filter driver that intercepts I/Os between the application and disks that store application data. The method further includes releasing the snapshot, resuming the application and performing a backup using the virtual filter I/O snapshot. Finally, the method triggers the filter driver to replace multiple filter driver records corresponding to the virtual filter I/O snapshot with data indicating the application data was backed up using the virtual filter I/O snapshot.

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