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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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 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: 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: A database management system (DBMS) generates a query execution plan including information representing one or more database (DB) operations necessary for executing a query and executes the query based on the query execution plan. In the execution of the query, the DBMS dynamically generates a task for executing a DB operation and executes the dynamically generated task. The DBMS executes a task in a plurality of threads executed by a processor core.

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.

Abstract: Methods, systems, and devices for cache metadata management in a memory subsystem are described. The memory subsystem may include an interface controller coupled with a non-volatile memory and a volatile memory. The interface controller may use metadata, such as validity information and dirty information, to operate the volatile memory as cache. The interface controller may store the dirty information in the volatile memory and may store the validity information in an array in the interface controller.

Abstract: A Key-Value (KV) storage device is disclosed. The KV storage device may include storage for objects, each object including data associated with a key. A host interface layer may receive requests to read data associated with a key from the storage, to write data associated with a key to the storage, and a boot request to get boot data from the storage. A boot request processor may process the boot request using the storage.

Abstract: A deduplication index is generated having multiple entries, each entry storing a digest of a data block that was previously stored in non-volatile data storage together with a pointer to the location in non-volatile storage at which the data block was previously stored. The entries of the disclosed deduplication index are divided into multiple deduplication index segments. A resident subset of the deduplication index segments is stored in memory of the data storage system. A non-resident subset of the deduplication index segments is stored in non-volatile data storage of the data storage system. Data deduplication is performed for each subsequently received data block for which a digest is generated that matches any one of the digests in the entries of the deduplication index segments that are contained in the resident subset of the deduplication index segments.

Abstract: A method may include calculating a cryptographic hash for each of a plurality of data blocks stored on a storage resource, calculating a locality-preserving hash for each of the plurality of data blocks, and performing clustering based on the locality-preserving hashes. The method may also include, for each particular cluster setting a cluster center data block for the particular cluster and for each particular data block of the particular cluster, storing the particular data block as a cluster member data block including a reference to the cluster center data block for the particular cluster, a list of differences of the particular data block from the cluster member data block, the cryptographic hash for the particular data block to identify the particular data block, and the locality-preserving hash for the particular data block for manipulation of the particular data block.

Abstract: Disclosed is a checksum generation and validation system and associated methods for dynamically generating and validating checksums with customizable levels of integrity verification. The system receives a file with data points defined with positional values and non-positional values, and differentiates a first set of the data points from a second set of the data points. The system generates a checksum based on a combination of two or more values from the positional values and the non-positional values of each data point from the first set of data points, and further based on exclusion of the positional values and the non-positional values of the second set of data points from the checksum. The system may use the checksum to verify the integrity of the data associated with the first set of data points.

Abstract: An enterprise organization may operate a central network and one or more remote networks, each comprising a plurality of computing devices. For protection against malicious actors, the central network may be configured to filter network traffic associated with the computing devices based on identified threats. Traffic corresponding to computing devices connected to the remote network may be tunneled to the central network for filtering by the central network. A tunnel gateway device, associated with the remote network, may efficiently identify which communications are associated with Internet threats, and tunnel such identified traffic to the central network, where actions may be taken to protect the enterprise network.

Abstract: Techniques for improving system performance based on data characteristics are disclosed. A system may receive updates to a first data set at a first frequency. The system selects a first storage configuration, from a plurality of storage configurations, for storing the first data set based on the first frequency, and stores the first data set in accordance with the first storage configuration. The system may further receive updates to a second data set at a second frequency. The system selects a second storage configuration, from the plurality of storage configurations, for storing the second data set based on the second frequency, and stores the second data set in accordance with the second storage configuration. The second storage configuration is different than the first storage configuration.

Abstract: The present teaching relates to a method, system and programming for operating a data storage. The data storage comprises of different portions including: a first portion having a plurality of metadata objects stored therein, each of the metadata objects being associated with a filter and corresponding to a range of keys, wherein at least one of the metadata objects is associated with a data structure, and a second portion having a plurality of files stored therein, each of the plurality of files being associated with one of the plurality of metadata objects; The data storage synchronizes a scan request with respect to one or more write requests based on a parameter associated with the scan request and each of the one or more write requests.

Abstract: Cache slots on a storage system may be shared between entities processing write operations for logical storage unit (LSU) tracks and entities performing remote replication for write operations for the LSU tracks. If a new write operation is received on a first storage system (S1) for a track of an LSU (R1) when the cache slot mapped to the R1 track is locked by a process currently transmitting data of the cache slot to a second storage system (S2), a new cache slot may be allocated to the R1 track, the data of the original cache slot copied to the new cache slot, and the new write operation for the R1 track initiated on S1 using the new cache slot; while the data of the original cache slot is independently, and perhaps concurrently, transmitted to S2 to be replicated in R2, the LSU on S2 that is paired with R1.

Abstract: A system and method matches data from a first set of data with that of an other set of data in a manner based on the size of a cache.

Abstract: Systems and methods are disclosed for processing and executing queries in a data intake and query system. The data intake and query system receives a query identifying a set of data to be processed and a manner of processing the set of data. The data intake and query system identifies buckets that are to be searched and stores a copy of buckets in memory associated with one or more search nodes. A search node performs a search on buckets residing in its memory.

Abstract: A centralized database identifier repository may identify databases using a unique identifier, or key tag, for each database. Each identified database may include data relating to one or more specific data elements. The repository may include a variety of data elements. Each data element may be associated with one or more database keys. The repository may be a repository of reference pointers. The repository may facilitate data viewing and data retrieval. A requestor may search for a data element using the centralized repository. The repository may retrieve data relating to a specific data element, from all databases identified by unique identifiers, that include data relating to the data element. The databases' unique identifiers may be encrypted tokens.

Abstract: Systems and methods are disclosed for processing and executing queries in a data intake and query system. The data intake and query system receives a query identifying a set of data to be processed and a manner of processing the set of data. The data intake and query system identifies buckets that are to be searched. The data intake and query system performs a hash on bucket identifiers of the identified buckets to identify search nodes to search the buckets.

Abstract: A particular voxel is identified within a volume and a hash table is used to obtain volumetric data describing the particular voxel within the volume. Values of x-, y- and z-coordinates in the volume associated with the particular voxel are determined an index value associated with the particular voxel is determined according to a hashing algorithm, where the index value is determined from summing weighted values of the x-, y- and z-coordinates, and the weighted values are based on a variable value corresponding to a dimension of the volume. A particular entry is identified in the hash table based on the index value, where the particular entry includes volumetric data, and the volumetric data identifies, for the particular voxel, whether the particular voxel is occupied.

Abstract: The present invention provides a control method of a server, wherein the server includes a write buffer for temporarily storing data from an electronic device, the write buffer has a plurality of sectors, and the write buffer has a write pointer and a flush pointer; and the control method comprises: setting each sector to have one of a plurality of states comprising an empty state, a merging state, a need-flush state and a flushing state; and referring to a state of a specific sector indicted by the write pointer to determine if ignoring the specific sector to directly process a sector after the specific sector.