A decentralized information system may include a plurality of nodes that are in electronic communication and may include a first primary node operable by a first user, a second primary node operable by a second user, and a secondary node, and the secondary node may be an unmanned sensor that is configured to record sensor data. The system may also include a plurality of decentralized applications, with each decentralized application running on at least one node. Preferably, each node of the plurality of nodes is running one decentralized application of the plurality of decentralized applications. A distributed ledger may be used to confirm and catalog data for the decentralized applications. At least one message data may be generated by the first primary node and addressed to the second primary node, the message data added to the distributed ledger via a consensus mechanism performed by the decentralized applications.

Methods, systems, and computer-readable storage media for providing a VPDL within a data exploration system, storing enterprise-provided data in the VPDL, the enterprise-provided data including enterprise data from an enterprise system and data lake data from an enterprise data lake, importing, from an external data source, external data, automatically identifying associations between a sub-set of the enterprise-provided data and a sub-set of the external data and storing correlation data in the VPDL in response to an association, and reading at least a portion of the enterprise-provided data, at least a portion of the external data, and at least a portion of the correlation data, the data exploration tool being configured to generate one or more of visualizations and analytics by processing the at least a portion of the enterprise-provided data, the at least a portion of the external data, and the at least a portion of the correlation data.

Disclosed are some implementations of systems, apparatus, methods and computer program products for facilitating the implementation of declarative transaction control. A database transaction control configuration associated with an element of a process flow can be obtained via a graphical user interface (GUI) and stored in association the element. The database transaction control configuration indicates whether a pending database transaction is to be committed to a database prior to executing a set of computer-readable instructions corresponding to the element. During execution of the process flow, the database transaction control configuration is accessed and it is determined whether a currently pending database transaction is to be committed to a database prior to executing a set of computer-readable instructions corresponding to the element. The currently pending database transaction is committed to a database prior to executing the set of computer-readable instructions according to a result of the determination.

Techniques are disclosed relating to a database system includes worker nodes operable to perform transactions and director nodes operable to ensure transactional consistency for the transactions. A worker node may receive a request to perform a transaction involving writing a record. The worker node may then issue, to director nodes of the database system, a request for information that facilitates performance of an operation for the transaction. A director node may determine whether to approve the request based on whether the operation could cause transactional inconsistency in the database system. The worker node may proceed to perform the operation for the transaction in response to receiving approval responses from a majority of the director nodes, with none of the received responses indicating a disapproval of the transaction.

Techniques are disclosed relating to a database system includes worker nodes operable to perform transactions and director nodes operable to ensure transactional consistency for the transactions. A worker node may receive a request to perform a transaction involving writing a record. The worker node may then issue, to director nodes of the database system, a request for information that facilitates performance of an operation for the transaction. A director node may determine whether to approve the request based on whether the operation could cause transactional inconsistency in the database system. The worker node may proceed to perform the operation for the transaction in response to receiving approval responses from a majority of the director nodes, with none of the received responses indicating a disapproval of the transaction.

System and methods discussed herein are directed to detecting the existence or modification of one or more data assets within a cloud-computing tenancy. The method may include obtaining, by a data management service, a plurality of connection data instances associated with a tenant. Cloud-computing data assets associated with the tenant can be identified from the plurality of connection data instances and presented to the user at a user interface. The user may select which data assets to add to a data catalog managed by the data management service. The data management service may be configured to monitor for new data assets or connections and/or for changes in data and/or connections of previously-selected data assets.

Systems and methods for processing computing jobs of a managed network are disclosed. Each of one or more worker nodes may implement a scheduler thread and a pool of worker threads. Upon waking up from a sleep state, the scheduler thread may determine a current number of jobs in an in-memory job queue that are waiting for processing by a worker thread, and may compute a job-completion rate of jobs processed by threads of the pool. Based on the job-completion rate, the scheduler thread may perform one or more of retrieving more jobs from a centralized database job queue and adding them to the in-memory job queue; removing one or more jobs from the in-memory job queue and returning them to the database job queue; leaving the in-memory job queue unchanged; or adjusting the duration of the sleep-interval timer. The scheduler thread may then return to a sleep state.

A server receives a first hypertext transfer protocol (HTTP) from a client device that requests first and second items of content associated with a webpage and applies a defer directive to the second item. The server retrieves, from a database, via a single worker thread, first data associated with the first item and transmits a first message comprising the first data associated with the first item. The server retrieves, from the database, via the worker thread, second data associated with the deferred item and transmits a second message comprising the second data associated with the second item.

Herein are resource-constrained techniques that plan ahead for resiliently moving pluggable databases between container databases after a failure in a high-availability database cluster. In an embodiment, a computer identifies many alternative placements that respectively assign each pluggable database to a respective container database. For each alternative placement, a respective resilience score is calculated for each pluggable database that is based on the container database of the pluggable database. Based on the resilience scores of the pluggable databases for the alternative placements, a particular placement is selected as an optimal placement that would maximize utilization of computer resources, minimize database latencies, maximize system throughput, and maximize the ability of the database cluster to avoid a service outage.

A key-value store is provided, implementing multiple-tiered sorted data structures in memory and storage, including concurrent write buffers in memory, and page-level consolidation of updates on storage, where pages are trivially translated in physical-to-virtual address mapping. The key-value store is built on an indexed sorted data structure on storage, occupying much less storage space and incurring much less disk activity in consolidating updates than a conventional log-structured merge tree organized into files. Concurrent write buffers operate concurrently and independently so that data is committed from memory to storage in an efficient manner, while maintaining chronological sequence of delta pages. Trivial mapping allows mappings of a number of physical pages to be omitted, enabling page mapping tables to occupy less storage space, and simplifying processing workload of read operation retrievals from storage.