An electronic device includes: a memory storing a database, a journal file for the database, and instructions; and a processor electrically connected with the memory. The instructions are configured to, when executed by the processor, cause the electronic device to: record a result of processing a transaction in the journal file through a thread of a process associated with the database; identify a size of the journal file through the thread; perform a lock for the journal file during a reference time through the thread, based on the identified size of the journal file through the thread; and transfer the result of processing the transaction to the database through the thread, based on a success of the lock for the journal file, the result of processing the transaction being recorded in the journal file.

Described herein are techniques for improving transfer of metadata from a metadata database to a database stored in a data system, such as a data warehouse. The metadata may be written into the metadata database with a version stamp, which is monotonic increasing register value, and a partition identifier, which can be generated using attribute values of the metadata. A plurality of readers can scan the metadata database based on version stamp and partition identifier values to export the metadata to a cloud storage location. From the cloud storage location, the exported data can be auto ingested into the database, which includes a journal and snapshot table.

Solutions for supporting storage using a multi-writer log-structured file system (LFS) are disclosed that include receiving incoming data from an object of a plurality of objects that are configured to simultaneously write to the LFS from different nodes; based at least on receiving the incoming data, determining whether sufficient free segments are available in a local segment usage table (SUT) for writing the incoming data; based at least on determining that insufficient free segments are available, requesting allocation of new free segments; writing the incoming data to a log; acknowledging the writing to the object; determining whether the log has accumulated a full segment of data; based at least on determining that the log has accumulated a full segment of data, writing the full segment of data to a first segment of the free segments; and updating the local SUT to mark the first segment as no longer free.

In some examples, a data management system generates snapshots in a distributed file system based on a protocol or a user triggered event, The data management system identifies a snappable file in a distributed file system and a first data block in the snappable file, the first data block including data and attribute data. The system scans an index file to access the attribute data of the first data block and initiates construction of a patch file based on the accessed attribute data. The system repeats the scanning of the index file to access attribute data of at least a further second data block, the second data block including data and attribute data, and completes construction of the patch file based on the accessed attribute data of the first and second data blocks. The system generates conversion simulation information by collecting attribute data for all the data blocks of the constructed patch file, and writes the simulation information to a patch file image.

A robust, computationally-efficient and secure system is described for streaming content from a server to a client device via the Internet or another digital network. Various aspects relate to automated processes, systems and devices for securing a media stream with efficient yet effective digital cryptography. In particular, content may be transmitted in transport stream (TS) format in which all packets are encrypted (e.g., using a cipher block chain), in which control packets are exempted from encryption (e.g., using an electronic codebook), or in any other manner.

A method for of input/output (I/O) quiescing in a write-ahead-log (WAL)-based storage system comprising a WAL, is provided. The method generally includes receiving a request to process a control operation for the storage system, determining whether a memory buffer includes payload data for one or more write requests previously received for the storage system and added to the WAL, forcing a flush of the payload data in the memory buffer to a persistent layer of the storage system when the memory buffer includes the payload data, and processing the control operation subsequent to completing the asynchronous flush, without waiting for processing of one or more other write requests in the WAL corresponding to payload data that was not added to the memory buffer prior to receiving the request to process the control operation.

A system, method and apparatus in which a client computer initiates and communicates a distributed ledger transaction, which transaction is labeled with a timestamp. A first hashing algorithm are applied to the transaction data and timestamp data to create a first hash value, and the first hash value is associated with the transaction data. When a second distributed ledger transaction is initiated, a second hashing algorithm is applied to the second transaction data to generate a second hash value, and a third hashing algorithm is applied to the to the first and second hash values to create a third hash value which is associated with the second transaction data. The procedure is implemented with each additional transaction data submission. The transaction data is processed in a first-in-first-out sequence based upon the hash values associated with the transaction data.

Embodiments described herein are generally directed to techniques for avoiding or mitigating shared-state damage during a split-brain condition in a distributed network of compute nodes. According to an example, a number, N, of nodes within the distributed computing system is determined. During normal operation of the distributed computing system, a unified state is maintained by synchronizing shared state information. The nodes are ordered by increasing importance to an application from 1 to N. A quora value, q.sub.n, is assigned to each of the nodes in accordance with the ordering, where q.sub.1=1 and each subsequent quora value, q.sub.n+1, is a sum of all prior quora values, q.sub.1 to q.sub.n, plus either 1 or a current value of n. These quora values may then be used to determine membership in the dominant or a yielding set to facilitate recovery from the split-brain condition by performing pessimistic or optimistic mitigation actions.

Provided is a memory management system based on a non-uniform memory access, which includes: a first persistent memory disposed in a first node; a second persistent memory disposed in a second node physically distinguished from the first node; a first journaling process disposed in the first persistent memory; and a second journaling process disposed in the second persistent memory.

System and method for journaling metadata update transactions of file system operations use logical metadata update transactions to record metadata updates for a target file in response to file system operation requests at a file system of the system. A single physical metadata update transaction is generated by consolidating multiple logical metadata update transactions for the target file. The physical metadata update transaction is then written to a journal area of a physical storage.