Abstract: In certain embodiments, a method includes recursively performing a procedure that includes using an allowed set of object identifiers and a hash function to update a bit array, using a disallowed set of object identifiers and the hash function to further update the bit array where collisions occur, repeating the process with a new allowed set that includes object identifiers from the original allowed set that collided with the disallowed set and a new hash function, until reaching a round where no collisions occurred, generating a data structure that includes the bit arrays created during each recursive round, and compressing the data structure.

Abstract: Techniques are disclosed for imager health monitoring systems and methods. In one example, a method includes determining a characteristic of an active unit cell of a focal plane array (FPA) and/or a reference unit cell of the FPA. The active unit cell includes a detector selectively shielded from an incident scene. The reference unit cell includes a reference detector shielded from the incident scene. The method further includes determining a state of the FPA based at least in part on the characteristic. The method further includes transmitting an indication of the state of the FPA to selectively cause adjustment of the FPA Related devices and systems are also provided.

Abstract: Techniques are provided for securing data storage by slicing swapped data portions into data fragments and shuffling a physical storage location of the data fragments. One method comprises obtaining at least one data item; dividing the at least one data item into a plurality of data portions; swapping respective positions of at least two of the data portions of the at least one data item; slicing the plurality of data portions, following the swapping, into a plurality of data fragments; and shuffling a distribution of the data fragments across a plurality of storage nodes in a storage system by moving at least one data fragment from a current physical storage location on a current storage node to a different physical storage location on a different storage node. A predefined number of the plurality of data fragments may be needed to reconstruct the data item.

Abstract: A method for deleting a set of keys from a storage server is provided. The method includes generating a probabilistic data structure for a first set of keys and for each key in a second set of keys, determining whether a key of the second set of keys is found in the probabilistic data structure. The method includes identifying the key as a candidate for deletion if the key is not found in the probabilistic data structure. A system is also provided.

Abstract: A method for packaging blocks of a blockchain implemented in an electronic device. The method identifies whether a packaged block is valid, and extracts from a header of valid packaged block geographic location information of the submitting blockchain node. A mining difficulty of the electronic device is calculated according to the geographic location information of the electronic device and the blockchain node, and a random number is generated. A hash value is calculated according to the random number and a determination made as to whether the calculated hash value conforms to the mining difficulty. If the calculated hash value is determined to conform to the mining difficulty, the geographic location information of the electronic device is encoded into a new block and the new block is written into the blockchain.

Abstract: Devices and techniques are disclosed herein for providing an improved Replay Protected Memory Block (RPMB) data frame and command queue for communication between a host device and a memory device.

Abstract: Disclosed herein are embodiments of a system and method for the dynamic provisioning of static content. In one embodiment, information presented on a content delivery system can be refreshed based on information published on a content management system. One embodiment can interface the content delivery system and the content management system at the page level. More specifically, content dependencies across pages employing the same content or portion(s) thereof can be tracked in a timely, accurate manner. Upon receiving a notification of a change to the content or a portion thereof from the content management system, a content generation system may operate to determine, based on the dependencies, what pages are affected by the change and, based on the determination, dynamically regenerate any and all affected pages. The regenerated pages may then be stored and/or pushed to the web tier for delivery to end users.

Abstract: Methods, systems, and devices for address scrambling by linear maps in Galois fields are described. For instance, a device may determine a bijective matrix based on a power up condition. In some examples, the device may determine the bijective matrix based on a seed value and/or may select the matrix from among a set of bijective matrices. In some examples, the bijective matrix may have at least one column and/or one row that has at least two non-zero elements. The device may generate a first address of a first address space based on applying the matrix (e.g., each column of the matrix) to at least a portion of a second address of a second address space and may access a memory array of the device based on generating the first address.

Abstract: Example implementations relate to deduplication operations in a storage system. An example includes, in response to initiation of a new backup process to store a first stream of data, initializing a temporary sparse index to be stored in a memory of a deduplication storage system; identifying a cloned portion of the first data stream; identifying at least one container index associated with the cloned portion of the first data stream; identifying a set of hook points included in the at least one container index; and populating the temporary sparse index with a set of entries, the set of entries mapping the identified set of hook points to the at least one container index.

Abstract: A system and method access memory blocks in a memory by receiving a memory transaction request from a processing device. First hash bits of the memory transaction request are compared with second hash bits of a first memory block of a memory. Data associated with the first memory block is output to the processing device based on the comparison of the first hash bits with the second hash bits.

Abstract: A method is described that includes computing a first index based on a hash of a first key for a first object to be stored in a memory device, determining an availability of a first segment on the memory device corresponding to the first index, computing a second index based on the hash of the first key for the first object, in response to determining that the first segment corresponding to the first index is unavailable for storage, determining an availability of a second segment on the memory device corresponding to the second index, and adding an indicator of a location of the second segment to a collision table in a first metadata of the first segment.

Abstract: To protect the integrity of data stored in a protected area of memory, data in the protected area of memory is retrieved in data blocks and an authentication code is associated with a memory granule contiguously comprising a first data block and a second data block. Calculation of the authentication code comprises a cryptographic calculation based on a first hash value determined from the first data block and a second hash value determined from the second data block. A hash value cache is provided to store hash values determined from data blocks retrieved from the protected area of the memory. When the first data block and its associated authentication code are retrieved from memory, a lookup for the second hash value in the hash value cache is performed, and a verification authentication code is calculated for the memory granule to which that data block belongs. The integrity of the first data block is contingent on the verification authentication code matching the retrieved authentication code.

Abstract: Preparing data for deduplication including: generating, by a storage system for a compressed data block, a padded compressed data block by padding the compressed data block to conform to a fixed block size, wherein the fixed block size is greater than a size of the compressed data block; storing, in the storage system, the padded compressed data block beginning at a block boundary of a storage device in the storage system; and performing block-based deduplication on the storage system, wherein the block-based deduplication determines whether the padded compressed data block matches one or more other padded compressed data blocks stored in the storage system.

Abstract: A packet cache system includes a cache memory allocator for receiving a memory address corresponding to a non-cache memory and allocated to a packet, and associating the memory address with a cache memory address; a hash table for storing the memory address and the cache memory address, with the memory address as a key and the cache memory address as a value; a cache memory for storing the packet at a location indicated by the cache memory address; and an eviction engine for determining one or more cached packets to remove from the cache memory and place in the non-cache memory when occupancy of the cache memory is high.

Abstract: A system to dynamically calculate a root hash value from a plurality of leaf hash values includes a flat associative memory and a hash parser. The flat associative memory stores a plurality of leaf hash values. The hash parser extracts a compressed number of branch nodes from the plurality of leaf hash values, determines branch node relationships from the plurality of leaf hash values, and saves the compressed number of branch nodes, and the branch node relationships.

Abstract: A file management device includes a processor configured to: add specific information to a file to be managed, the specific information specifying the file to be managed which is stored in a file system, the specific information being managed in association with a storage location on the file system; and when the file downloaded to an outside of the file system is re-uploaded from an external device to the file system, acquire the specific information added to the file, and specify the storage location on the file system based on the specific information.

Abstract: Described herein are systems and methods to apply route-map configurations in a computing network. In one implementation, a routing computing system may identify a route for redistribution in a computing network and identify a longest prefix in a radix tree associated with the route. The routing computing system may further identify a highest priority route-map clause associated with the longest prefix match or any parent prefixes of the longest prefix match in the radix tree. Once identified, the computing system may perform an action associated with the highest priority route-map clause.

Abstract: A follower system and a leader system store records for a plurality of users. Each of the follower system and the leader system stores at least a record for a user. Each of the follower system and the leader system stores a private log and a public log. The public log is periodically synchronized across the follower system and the leader system. The private log of each system is maintained independent of the other system. The follower system transmits information stored in the public logs to the leader system for synchronizing the public logs of the follower system and the leader system in response to updating the public logs with information describing the second set of transactions.

Abstract: Embodiments of the present disclosure relate to method, device and computer program product for data backup. The method comprises: in response to receiving from a backup server a data stream to be backed up, dividing the data stream into a plurality of data segments; distributing the plurality of data segments to at least one computing node; in response to receiving an index of a corresponding data segment from a first computing node of the at least one computing node, looking up the index in a global index cache, the index being generated by the first computing node to uniquely identify the data segment, the global index cache storing indexes of data in a backup storage device; in response to the missing index in the global index cache, adding the index into the global index cache; and sending to the first computing node an indication to store the data segment in the backup storage device.

Abstract: Data is ingested from a source system. Ingesting the data includes determining corresponding chunk identifiers for a plurality of data chunks corresponding to the ingested data and for each of the plurality of data chunks, verifying whether the corresponding chunk identifier is included in a data structure tracking identifiers of data chunks that were already stored in a storage of a storage system before the data ingestion started and storing the data chunk in a storage based on the verification. After the ingesting is completed, deduplication of the ingested data chunks stored in the storage having a same chunk identifier is performed and the data structure is updated based on the deduplication.

Abstract: A data storage device includes a memory device and a controller coupled to the memory device. The controller is configured to receive key value (KV) pair data, group a plurality of KV pair data based on a data clustering value, aggregate the grouped plurality of KV pair data, and program the aggregated plurality of KV pair data to the memory device. A length of the KV pair data is less than a size of a flash management unit (FMU). The KV pair data includes a key and a value. Each KV pair data of the plurality of KV pair data has a length less than the size of the FMU. The received KV pair data is stored in a temporary location and grouped together in the temporary location. The grouping is based on a similarity of characteristics of plurality of KV pair data.

Abstract: Disclosed is a method for processing a query related to a plurality of partitions included in a plurality of tables having different partition information, which is performed by a computing device including one or more processors. The method includes acquiring the plurality of partitions for processing the query. The method includes acquiring global partition indexes for encompassing the acquired partitions and acquiring local partition indexes corresponding to the acquired partitions, respectively. The method includes processing the query at least partially based on the global partition indexes and the local partition indexes.

Abstract: A content addressable memory circuit is provided that includes: multiple integrated circuit memory devices that include memory address locations that share common memory addresses; buffer circuits operatively coupled to the memory devices; a hash table that includes a plurality of hash values that each corresponds to one or more key values; one or more processor circuits configured with instructions to perform operations that include: assigning each hash value to a memory address location based upon a first portion of the hash value; storing each key value at a memory address location assigned to a first portion of a hash value that corresponds to the key value; copying a first key value from a first memory address location within a memory device to a buffer circuit operatively coupled to the memory device; copying the first key value from the buffer circuit operatively coupled to the memory device to a second memory address location of the memory device; and assigning a second portion of a hash value that co

Abstract: Aspects described herein relate to securely performing cross-boundary backup operations. A service of a computing resource service provider may enable backup operations between a source account and a destination account of an organization based at least in part on a security policy allowing such operations.

Abstract: The present disclosure provides a hash algorithm circuit, a hash algorithm method, and an electronic device. The hash algorithm circuit is used to reduce fixed-length parallel data, and the reduced identifier can be used as an index reference, an identifier ID, an address extension bit, information summary, and so on. The hash algorithm circuit has the characteristics of low power consumption, low cost, etc., and can be integrated in a digital circuit.

Abstract: An out-of-order and speculative execution microprocessor that mitigates side channel attacks includes a cache memory and fill request generation logic that generates a request to fill the cache memory with a cache line implicated by a memory address that misses in the cache memory. At least one execution pipeline receives first and second load operations, detects a condition in which the first load generates a need for an architectural exception, the second load misses in the cache memory, and the second load is newer in program order than the first load, and prevents state of the cache memory from being affected by the miss of the second load by inhibiting the fill request generation logic from generating a fill request for the second load or by canceling the fill request for the second load if the fill request generation logic has already generated the fill request for the second load.

Abstract: Decentralized deduplication operations in a computer system employ a hash index that is a variant of a B+ tree to support both efficient sequential updates as well as efficient random updates. Sequential update is selected when deduplication is infrequently performed, such as on the order of days, and random update is selected when deduplication is performed more frequently, such as on the order of seconds. More frequent deduplication may be beneficial during periods when large amounts of temporary duplicate data are created, and the system may not have enough storage space to accommodate the temporary spike in demand.

Abstract: A method, a system, and a computer program product for protection and recovery of backup storage systems from ransomware attacks. A request to modify data stored in a storage system is received. The storage system includes at least one component configured to store the deduplicated data. An acknowledgement of the received request is generated. The acknowledgement indicates that the data stored in the at least one component and identified in the received request was modified. Modification of the data stored in the at least one component and identified in the received request for a predetermined period of time is prevented.

Abstract: A seed value assigned to a database table is determined. Numerically ordered invocation numbers are determined. Unordered pseudorandom numbers are generated based on the seed value and the invocation numbers to index temporally ordered data changes to the database table. It is determined whether the total number of yet-to-be-saved pseudorandom numbers reaches a maximum total number threshold. If so, the yet-to-be-saved pseudorandom numbers and a sequence of corresponding invocation numbers are saved in a sync table.

Abstract: A method and apparatus of a device that grows and/or shrinks a table that is shared between a writer and a plurality of readers is described. In an exemplary embodiment, a device receives an entry to be added to the shared table. In response to receiving the entry, the device remaps shared table to add a new storage segment to the shared table. The device further adds the entry to the shared table, where the entry is stored in the new storage segment. In addition, the device updates a shared table characteristic to indicate that the shared table has changed. The device further shrinks the shared table by remapping the table to remove a segment of the table.

Abstract: The present disclosure relates to a firmware security verification method and device, including a processor and a read-only memory for storing instructions executable by the processor. While executing the instructions, the processor implements the following steps: acquiring firmware data and a digital signature; verifying the digital signature with a pre-stored public key; and running the firmware data upon determining that the digital signature passes the verification. With the firmware security verification method and device provided in embodiments of the present disclosure, the security of the firmware data can be acquired before the running of firmware.

Abstract: A method for deduplicating a distributed ledger, a blockchain, and a computer program product. One embodiment may comprise splitting a new block on a distributed ledger into a plurality of partitions, comparing the plurality of partitions to a deduplication (dedup) map, replacing a first partition of the plurality of partitions with a first reference to the dedup map to produce a transformed block, and communicating the transformed block via a network interface to one or more peers.

Abstract: An out-of-order and speculative execution microprocessor that mitigates side channel attacks includes a cache memory and fill request generation logic that generates a request to fill the cache memory with a cache line implicated by a memory address that misses in the cache memory. At least one execution pipeline receives first and second load operations, detects a condition in which the first load generates a need for an architectural exception, the second load misses in the cache memory, and the second load is newer in program order than the first load, and prevents state of the cache memory from being affected by the miss of the second load by inhibiting the fill request generation logic from generating a fill request for the second load or by canceling the fill request for the second load if the fill request generation logic has already generated the fill request for the second load.

Abstract: A method for an in-memory distributed cache includes receiving a write request from a client device to write a block of client data in random access memory (RAM) of a memory host and determining whether to allow the write request by determining whether the client device has permission to write the block of client data at the memory host, determining whether the block of client data is currently saved at the memory host, and determining whether a free block of RAM is available. When the client device has permission to write the block of client data at the memory host, the block of client data is not currently saved at the memory host, and a free block of RAM is available, the write request is allowed and the client is allowed to write the block of client data to the free block of RAM.

Abstract: Exemplary systems, methods, and apparatuses migrate tenants between instances in a cloud based computing environment. The exemplary system assigns a dedicated share on multi-tenant cloud computing services instances. The exemplary system further receives performance characteristics for each of the tenants, analyzes the performance characteristics, detects an anomaly in one of the plurality of tenants responsive to analyzing the performance characteristics, and evicts one of the tenants in which the anomaly was detected from the one or more instances. The exemplary system further re-assigns the evicted tenant to a dedicated share on one or more multi-tenant cloud computing services instances other than the instance to which it was assigned before eviction.

Abstract: Embodiments herein describe computer-implemented methods, computer program products and systems for efficient spatial indexing. In an embodiment, the computer-implemented method may include one or more processors configured for obtaining from a database index data representing one or more assets, wherein each of the one or more assets comprise an asset identifier and a spatial attribute; generating a location hash for each of the one or more assets using the respective asset identifier and the respective spatial attribute; determining one or more sets of location hashes based on the asset identifier and the spatial attribute at one of one or more precision values; generating shadow index data comprising the one or more sets of location hashes at the one of one or more precision values; receiving a query corresponding to the index data; and returning a first set of results corresponding to the query in a first query response time.

Abstract: Some embodiments provide a non-transitory machine-readable medium stores a program. The program receives a query for data that includes an intersection operation on a first set of strings and a second set of strings. The program further generates a plurality of candidate query execution plans based on the query. The program also determines a plurality of execution costs associated with the plurality of candidate query execution plans. The program further selects a query execution plan from the plurality of candidate query execution plans based on the plurality of execution costs. The program also executes the query execution plan to generate a set of query results for the query.

Abstract: Methods and systems for electronic storage are provided. A storage system comprises a plurality of storage system front ends, a plurality of storage system back ends, and a plurality of solid state drive (SSD) agents. Each storage system front end resides on a server of a plurality of servers. Each server of the plurality of servers comprises one or more storage system back ends of the plurality of storage system back ends. Each storage system front end is able to receive I/O requests and relay information associated with the I/O requests to a relevant storage system back end. The relevant storage system back end communicates metadata associated with the I/O request to an SSD via an SSD agent.

Abstract: An apparatus comprising means for: obtaining a value of one or more parameters which vary with actions of a user; accessing an artificial intelligent agent configured to use one or more trained machine learning models selected, from a plurality of differently trained machine learning models, based on the obtained value of one or more parameters, the plurality of differently trained machine learning models being configured to provide respective outputs; providing content composed by the user as an input to the artificial intelligent agent to cause generation of feedback to the user on the content composed by the user, the feedback being dependent on the artificial intelligent agent; controlling a submission based on the content composed by the user; and causing the feedback to be provided to the user.

Abstract: A system includes reception of a database query, the query comprising a first query statement to insert rows of a source table into a target table, generation a second query statement and a third query statement based on the first query statement, the second query statement to insert rows of a first partition of the source table into the target table and the third query statement to insert rows of a second partition of the source table into the target table, generation of a first query operator executable to perform the second query statement, generation of a second query operator executable to perform the third query statement, transmission of the first executable query operator to a second database server node storing the first partition of the source table, and transmission of the second executable query operator to a third database server node storing the second partition of the source table.

Abstract: Methods, systems and computer program products are provided for transaction log validation in a database transaction log service. A transaction log service may perform egress validation to confirm transaction logs match previously served transaction logs and are free of corruption. A transaction log service may determine whether a transaction log (e.g., in the form of a log block) was previously served based on transaction log (e.g., log block) identity indicating a position in a logical stream of transaction logs (e.g., log blocks). Egress validation may improve log service reliability by providing an added layer of defense against corruption of a transaction log payload.

Abstract: In accordance with an embodiment, described herein is a system and method for providing unique identifiers for use with enterprise software application environments. A unique ID server (service) operates to provide calling applications with unique identifiers, for use by the applications in storing, accessing, or using data stored at a database or data warehouse. A database sequence provided by the database can be leveraged for issuing unique ID sequences for use by the applications. A calling application can reserve and/or request, via the unique ID service, sequences of unique IDs, ahead of time, either as a single sequence or bulk sequence. The unique ID can be subsequently used within the enterprise application environment for various purposes.

Abstract: Provided herein are systems, methods and computer readable media for identifying content to represent web pages and creating a representative image from the content. An example method may include retrieving a web document using a uniform resource locator (URL) contained in a dequeued work item, determining, from the web document, candidate images for creation of the representative image including extracting image references, wherein the image references are extracted by identifying image tags with source attributes, values of which are URLs locating images, filtering the URLs using a blacklist of expressions designed to match the URLs of images comprising one or more predefined undesirable characteristics, and retrieving the images which do not match any of the expressions using an HTTP client, and creating the representative image, comprising at least modifying a chosen image selected from among the candidate images.

Abstract: Techniques for processing an access request and updating a storage system are provided. For instance, a method comprises: receiving an access request for an object associated with a storage system, the storage system including a plurality of physical nodes, each of the plurality of physical nodes including at least one set of virtual units, each set of virtual units including at least one virtual unit; determining, from a plurality of sets of virtual units included in the plurality of physical nodes of the storage system, a target set of virtual units associated with the object; and determining, from the target set of virtual units, a target virtual unit corresponding to the object. With the technical solution of the present disclosure, not only a set of virtual units on a physical node may be easily split and merged, but also huge computing resources that need to be allocated may be saved, so better user experience may be brought about at a lower cost.

Abstract: A method for deleting a set of keys from a storage server is provided. The method includes generating a probabilistic data structure for a first set of keys and for each key in a second set of keys, determining whether a key of the second set of keys is found in the probabilistic data structure. The method includes identifying the key as a candidate for deletion if the key is not found in the probabilistic data structure. A system is also provided.

Abstract: Techniques are disclosed relating to creating an index for a database system. In one embodiment, a database system stores data within a plurality of fields in a data table, a subset of the data being associated with a particular one of the plurality of fields. The database system receives a request to index the data table based on the particular field and analyzes the subset of the data. In response to determining, based on the analyzing, that one or more duplicate values are present in the subset of data, the database system sets, in an index table having the particular field, an indication identifying which entries of the index table have a duplicate value for the particular field, and returns a response to the request that specifies the one or more duplicate values. In some embodiments, the response includes a user interface displaying one or more duplicates values.

Abstract: One example method includes receiving clear text data at a storage system, generating, at the storage system, a clear text data encryption key, requesting a key management system to encrypt the clear text data encryption key with a master key to create an encrypted data encryption key, and the requesting is performed by the storage system, receiving, at the storage system, the encrypted data encryption key from the key management system, encrypting, at the storage system, the clear text data with the clear text data encryption key to create encrypted data, and storing, together, the encrypted data and the encrypted data encryption key.

Abstract: A computer storage device having a host interface, a controller, non-volatile storage media, and firmware. The firmware instructs the controller to select a block size for allocating blocks to namespaces based on a storage capacity of the non-volatile storage media. Various requests by a host to create namespaces are received by the controller via the host interface. After each request is received, the controller allocates blocks to the requested namespace using the selected block size. The controller can select the block size at the time of initial manufacture or operation, and/or can dynamically select various block sizes during operation of the storage device. Dynamic selection of the block size can be based on signaling from sensors of the storage device and/or host.

Abstract: Briefly, example methods, apparatuses, devices, and/or articles of manufacture are disclosed that may be implemented, in whole or in part, using one or more processing devices to facilitate and/or support one or more operations and/or techniques to access entries in a hash table. In a particular implementation, a hash operation may be selected from between or among multiple hash operations to map key values to entries in a hash table.

Abstract: Methods, computer systems, and computer readable medium are described. In a particular embodiment, a storage controller is configured to receive, from a host computing device, a request to perform a bulk array task and in response to receiving the request, store an indication relating old keys of a mapping table to new keys, wherein both the old keys and the new keys correspond to the request. The storage controller is also configured to convey a response indicating completing of the request without prior access of user data and update the mapping table to replace the old keys with the new keys.