8 results about "Binary large object" patented technology

A method for managing log files for recording operations on data stored in a database is provided, wherein a set of log files having an allocated first portion of storage is updated, the allocated first portion of storage is monitored, and a second portion of storage is allocated in dependence on a determination that an available portion of storage is below a predetermined size. A method for generating a snapshot is provided, wherein data entries are included in the snapshot in dependence on a determined relative order of log records in a set of log files. A method of replicating a binary large object is provided, wherein the binary large object is sent to a second database in response to identifying a log record comprising data indicating the binary large object. A method for deleting one or more binary large objects is provided, wherein the data indicating one or more binary large objects that have been logically deleted are stored in a snapshot and the one or more binary large objects are deleted using the data indicating the one or more binary large objects after a previous snapshot is deleted.

A method for managing log files for recording operations on data stored in a database is provided, wherein a set of log files having an allocated first portion of storage is updated, the allocated first portion of storage is monitored, and a second portion of storage is allocated in dependence on a determination that an available portion of storage is below a predetermined size. A method for generating a snapshot is provided, wherein data entries are included in the snapshot in dependence on a determined relative order of log records in a set of log files. A method of replicating a binary large object is provided, wherein the binary large object is sent to a second database in response to identifying a log record comprising data indicating the binary large object. A method for deleting one or more binary large objects is provided, wherein the data indicating one or more binary large objects that have been logically deleted are stored in a snapshot and the one or more binary large objects are deleted using the data indicating the one or more binary large objects after a previous snapshot is deleted.

A method for real-time, reboot-less configuration of network interface cards. The method includes: constructing a network interface binary large object (NI-BLOB) including a firmware update package; transferring, to a network interface card, a firmware update including the NI-BLOB; and activating, without power-cycling a host whereon the network interface card is installed, the firmware update to configure the network interface card in real-time. In foregoing the power-cycling of the host, embodiments described herein minimize (if not eliminate) any service downtime potentially caused through the frequent application of configuration changes to network interface card(s).

The present application relates to the technical field of computer storage, and specifically discloses a hybrid encoding-based binary large object (BLOB) storage repair method and apparatus. The method comprises: acquiring a plurality of BLOBs, performing non-systematic minimum storage regeneration (MSR) encoding on a small BLOB among the plurality of BLOBs, and performing systematic MSR encoding on a large BLOB among the plurality of BLOBs; storing the plurality of encoded BLOBs in a plurality of storage nodes in a balanced manner; and on the basis of the type of a BLOB to be repaired, determining a corresponding repair strategy, and on the basis of the repair strategy and the plurality of encoded BLOBs in the plurality of storage nodes, using a group-based parallel repair technique to repair the BLOB to be repaired. The method can improve BLOB repair efficiency.

A method for preparing content to be provided from a hardware security module, HSM, to an integrated secure element, iSE, comprising: a) providing in the HSM a pre-shared key PSK derived from a first seed (S1) and a generic key derivation constant KDC permanently stored in the iSEs, where the KDC is identical for a large number of multiple iSEs and the first seed (51) is specific or unique for a specific content provider (CP) of the content; b) in the HSM, providing a second seed (S2) that is specific or unique to the iSE and applying a CEK key derivation scheme based on the PSK and the second seed in order to derive a code encryption key CEK; c) in the HSM, encrypting the code packet with a code encryption key CEK and by applying a code encryption scheme in order to generate an encrypted code packet (OS packet); d) in the HSM, generating a header comprising a second seed (S2) and, if needed, further: information about the code encryption scheme of step c) or / and information about the CEK key derivation scheme of step b); e) in the HMS, encrypting the header using the PSK or a header encryption key derived from the PSK and applying a header encryption scheme to generate an encrypted header (Header), f) in the HSM, merging the encrypted code packet (OS packet) and the encrypted header (Header) in order to create a binary large object BLOB to be transmitted to the iSE.

The application belongs to the technical field of computer storage, and specifically discloses a binary large object storage repair method and device based on hybrid coding, which comprises the following steps: acquiring a plurality of binary large objects (Blob), and performing non-systematic minimum storage regeneration (MSR) coding on small-sized Blob in the plurality of Blob and systematic MSR coding on large-sized Blob in the plurality of Blob; storing the coded plurality of Blob in a plurality of storage nodes in a balanced manner; determining a corresponding repair strategy based on the type of a Blob to be repaired, and repairing the Blob to be repaired by using a grouping and parallel repair technology based on the repair strategy and the coded plurality of Blob in the plurality of storage nodes. The method can improve the Blob repair efficiency.

A system can read, by a first reader component, a first sub-sequence of a sequence of random computer data starting at a first offset position of the sequence of random computer data. The system can read, by a second reader component, a second sub-sequence of the sequence of random computer data starting at a second offset position of the sequence of random computer data, wherein the first offset position differs from the second offset position. The system can store the first sub-sequence as a first binary large object. The system can store the second sub-sequence as a second binary large object.

This invention belongs to the interdisciplinary field of geographic information systems, spatial databases, and big data storage technology. Specifically, it discloses a structured storage method for terrain data based on multi-level grid addressing. This invention designs an innovative database table structure, mapping the two-dimensional row and column indexes of global regular grid terrain data to the database's primary key index and secondary longitude interval fields, and uses binary large object (BLOB) fields for compressed storage. This method achieves efficient organization of massive, high-resolution global raster terrain data within a single database table, achieving high retrieval efficiency, simple topology, convenient maintenance and updates, and easy integration of multi-source, multi-resolution data, fundamentally overcoming the drawbacks of traditional fragmentation methods.