Abstract: Example systems and methods are disclosed for protection of data servers configured for data replication of a database. An example system includes a processing circuit configured to receive records indicating respective modifications performed on a first version of the database stored in a first data server of the plurality of data servers. The processing circuit determines a risk level of a modification indicated by a record based on a set of factors indicated in a security profile, the set of factors being indicative of anomalous data access activity. The processing circuit performs the modification in a second data server, in response to the risk level being less than a threshold level indicated in the security profile. The processing circuit prevents the modification indicated by the record from being performed in the second data server in response to the risk level being greater than or equal to the threshold level.

Abstract: A quantum file management system is disclosed. A quantum file manager receives, from a requestor, a request to access a quantum file that comprises a plurality of qubits. The quantum file manager determines, for each respective qubit of the plurality of qubits, a qubit identifier of the respective qubit. The quantum file manager sends, to the requestor in response to the request, information that includes the qubit identifier for each respective qubit of the plurality of qubits.

Abstract: A method for creating a tamper-evident digital content. The method includes receiving a portion of the digital content at a computing device. The method further includes encrypting the portion of the digital content by the computing device when the portion of the digital content is selected for proof-of-verification. The method further includes sending the encrypted portion of the digital content from the computing device to a distributed ledger system. The method further includes retrieving, by the computing device, hash identification data associated with the encrypted portion of the digital content from the distributed ledger system. The method further includes creating, by the computing device, an updated portion of the digital content using the retrieved hash identification data. The method further includes storing the updated portion of the digital content in a storage device by the computing device.

Abstract: A method and system for data consistency across failure and recovery of infrastructure. In one embodiment of the method, copies of first data blocks stored in a source memory are sent to a target site via a data link. While sending one or more of the copies of the first data blocks to the target site, source hashes for second data blocks stored in the source memory are calculated, wherein the first data blocks are distinct from the second data blocks. While sending one or more of the copies of the first data blocks to the target site, target hashes of data blocks stored in a target memory of the target site are received. While sending one or more of the copies of the first data blocks to the target site, the source hashes are compared with the target hashes, respectively. After sending the first data blocks to the target site via the data link, copies of only those second data blocks are sent to the target site with source hashes that do not compare equally with respective target hashes.

Abstract: A method for operating a database includes receiving, from a user, data and an instruction to store the data in a key-value based database, determining a context of the data, selecting, according to the determined context, a data write routine, writing the data and its context to the database using the selected data write routine, and writing the data to a cache associated with the database. In addition, indexes may be created in the database and cache separate from the native indexes of the database and cache.

Abstract: Systems, computer program products, and methods are described herein for implementing a data driven channel for query executions using quantum computing. The present invention is configured to receive, from a user input device, a query; parse, using a query processing engine, the query; determine a classical execution plan based on at least parsing the query; convert, using a query optimization engine, the classical execution plan into a quantum execution plan; initiate a query execution engine on the quantum execution plan; determine, using the query execution engine, a quantum circuit design for execution of the quantum execution plan; execute, using the query execution engine, the quantum execution plan; generate a query result based on at least executing the quantum execution plan; and transmit control signals configured to cause the user input device to display the query result.

Abstract: A strongly consistent distributed data storage system comprises an enhanced metadata service that is capable of fully recovering all metadata that goes missing when a metadata-carrying disk, disks, and/or partition fail. An illustrative recovery service runs automatically or on demand to bring the metadata node back into full service. Advantages of the recovery service include guaranteed full recovery of all missing metadata, including metadata still residing in commit logs, without impacting strong consistency guarantees of the metadata. The recovery service is network-traffic efficient. In preferred embodiments, the recovery service avoids metadata service downtime at the metadata node, thereby reducing the impact of metadata disk failure on the availability of the system. The disclosed metadata recovery techniques are said to be “self-healing” as they do not need manual intervention and instead automatically detect failures and automatically recover from the failures in a non-disruptive manner.

Abstract: Systems and methods are provided for determining multiple fragments of data to be imported, the multiple fragments of data corresponding to different instances of data obtained from one or more external data sources, the different instances of data each corresponding to duplicate content. The multiple fragments of data that each correspond to different instances of duplicate content can be ingested. The multiple fragments of data can be de-duplicated to determine one or more corresponding object data source records (DSRs). The one or more object DSRs can be imported within a data platform system.

Abstract: A method and system for workload anomaly detection for standalone hosts based on bare-metal recovery and/or state-system recovery data and metadata. In isolated circumstances, workloads tend to operate as expected, however, their behavior and/or functionality may become unpredictable when said workloads are exposed to other factors outside of isolation. Further, most of these other factors, as well as their influence on workload behavior and/or functionality tend to go unnoticed by administrators. Data and/or metadata, pertinent to bare-metal recovery and/or system-state recovery operations, may capture host-relevant information, including which workload(s) is/are installed on a host, which file-system objects maintained thereon belong to which installed workload, and what is the nature and storage location of each file-system object.

Abstract: The current document is directed to a universal-query adapter that provides, to users and clients, a universal-query-language interface to multiple different management applications and/or services within a cloud-computing facility or distributed cloud-computing facility. In one implementation, the universal-query adapter provides, for input of universal-query-language queries, a universal-query interface and, in turn, interfaces to service adapters, semantic providers, and translators associated with the multiple different management applications and/or services. The modular implementation of the universal-query adapter facilitates both implementation of the universal-query adapter as well as scalability of the universal-query adapter, allowing new and newly discovered management applications and/or services to be easily included in the set of target management applications and/or services for query execution.

Abstract: A system includes a data store and a data management server. The data store stores a plurality of backup snapshots that capture states of a device at different times. The data management server receives a request to restore the device that is potentially malware affected. The data management server retrieves a first backup snapshot of the device. The data management server determines that a first file stored in the first backup snapshot is malware affected. The data management server checks one or more corresponding versions of the first file captured in one or more previous backup snapshots to identify a clean version of the first file. The data management server determines that a second file stored in the first backup snapshot is clean. The data management server restores data in the device.

Abstract: A data storage system and a global deduplication method thereof are provided. The data storage system includes multiple storage devices and one dispatch device. The dispatch device divides an original data corresponding to a data writing request into at least one data chunk. The dispatch device performs a summary calculation on one data chunk, so as to generate a representative value. The dispatch device performs a first distribution calculation on the representative value, so as to determine a destination location corresponding to the representative value. The dispatch device transmits the data chunk and the representative value to at least one destination storage device among the storage devices through a communication network according to the destination location. The at least one destination storage device checks the representative value, so as to determine whether to store the data chunk in a storage space of the at least one destination storage device.

Abstract: A method for use in a computing system, comprising: storing, in a random-access memory, a working copy of a data item, the working copy of the data item being stored in the random-access memory by a first processor; registering, with a second processor, a respective address in the random-access memory where the working copy of the data item is stored; and correcting, by the second processor, any modifications to the working copy of the data item that are made after the working copy of the data item is stored in the random-access memory, the modifications being corrected in parallel with the first processor executing software based on the working copy of the data item.

Abstract: An example operation may include one or more of storing a full-step hash of a data file and a reduced-step hash of the data file within a data block of a hash-linked chain of blocks of a blockchain, receiving a request from a client application to verify the data file, determining whether to provide the full-step hash of the data file or the reduced-step hash of the data file based on the request, and in response to determining to provide the reduced-hash, transmitting the reduced-step hash of the data file to the client application.

Abstract: A system and method for efficiently storing data in a storage system. A data storage subsystem includes multiple data storage locations on multiple storage devices in addition to at least one mapping table. A data storage controller determines whether data to store in the storage subsystem has one or more patterns of data intermingled with non-pattern data within an allocated block. Rather than store the one or more pattern on the storage devices, the controller stores information in a header on the storage devices. The information includes at least an offset for the first instance of a pattern, a pattern length, and an identification of the pattern. The data may be reconstructed for a corresponding read request from the information stored in the header.

Abstract: The present disclosure provides technical solutions related to action undo service based on cloud platform. Related operations dependent on target operations to be undone may be obtained by dependency analysis and the target operations and the related operations may be undone by time sequence so as to reduce the conflict caused by the undo operations.

Abstract: The present disclosure relates to a method for storing data. The method includes: writing an input data to a first memory and a second memory; writing one or more first data slices in the input data stored in the first memory respectively to one or more first nodes in a storage cluster; encoding the input data stored in the second memory to generate one or more second data slices; and writing the one or more second data slices respectively to one or more second nodes in the storage cluster.

Abstract: Systems and methods are provided for determining multiple fragments of data to be imported, the multiple fragments of data corresponding to different instances of data obtained from one or more external data sources, the different instances of data each corresponding to duplicate content. The multiple fragments of data that each correspond to different instances of duplicate content can be ingested. The multiple fragments of data can be de-duplicated to determine one or more corresponding object data source records (DSRs). The one or more object DSRs can be imported within a data platform system.

Abstract: In some examples, a system performs data deduplication using a deduplication fingerprint index in a hash data structure comprising a plurality of blocks, wherein the hash data structure is stored in persistent storage, and a block of the plurality of blocks comprises fingerprints computed based on content of respective data units. The system uses an indirect block in a memory to access a given block of the plurality of blocks in the hash data structure, the indirect block containing references to blocks of the hash data structure containing the deduplication fingerprint index, and the references indicating storage locations of the plurality of blocks in the persistent storage.

Abstract: A request from a user device to register as a secure endpoint device of a secure local area network (LAN) is received by a wireless carrier network. A device type of the user device is identified by the network based on device identification information provided by the user device. A data protection policy that corresponds to the device type of the user device is sent to a secure endpoint application on the user device following a registration of the user device as a secure endpoint device by the network, in which the data protection policy includes an Access Point Name (APN). The user device allocated a network slice of the wireless carrier network that corresponds to the APN to the user device. Subsequently, a data file is transported from the user device to an additional secure endpoint device via the network slice that is allocated to the user device.

Abstract: Techniques for performing hash validation are provided. In one technique, a signature request that includes a first hash and a data identifier is received from a client. In response, the data identifier is identified and sent to a data repository, data that is associated with the data identifier is received from the data repository, a second hash is generated based on the data, and a determination is made whether the second hash matches the first hash. If the two hashes match, then the first hash is sent to a cryptographic device that generates a digital signature, which is eventually transmitted to the client. Alternatively, the digital signature is transmitted to the client prior to the first hash being validated. In a related technique, a server receives the signature request and sends the data identifier to a hash validator, which interacts with the data repository and generates the second hash.

Abstract: Described is a system for a verification microservice engine for generating and deploying a controller module and one or more worker nodes to detect corruption in a deduplicated object storage system accessible by one or more microservices while minimizing costly read operations on objects. A worker node(s) stores slice recipes into worker node memory that correspond to slice recipe names verified by a controller module. For each slice recipe, the worker node(s) detects whether slice recipe corruptions, similarity group corruptions and/or compression region corruptions exist.

Abstract: Disclosed herein are systems and method for multiplexing data of an underlying index. In an exemplary aspect, an index handler may generate a plurality of slots and a plurality of data buckets for a traditional index. The index handler may receive, from a software application, a request to access a data file. The index handler may determine whether any slot of the plurality of slots is attached to a respective data bucket of the plurality of data buckets comprising the data file. In response to determining that a first slot of the plurality of slots is attached to a first data bucket comprising the data file, the index handler may enable, via the first data bucket attached to the first slot, access to the data file to the software application.

Abstract: One or more processors generate a view that identifies the data records of a first database having a back-level version. Instructions are received to migrate the data records from a back-level version to a new version of the data records. Responsive to receiving a query requesting data records of the first database, the version level of the requested data records is determined based on the generated view. Responsive to determining the requested data records are in the back-level version, a migration is performed on the requested data records including changes resulting in the new version of the requested data records. The requested data records are identified as changed to the new version of data records, and the new version of the requested data records are written to a pre-determined storage location and are provided to a requestor submitting the query.

Abstract: A method for processing a request, where the request is of a declaratory-type and is destined from a request source to a distributed database that has a plurality of transaction destination locations (TDLs). The distributed database is part of distributed computer system, and the distributed computer system has a supervisory device. The method is executable by the supervisory device and includes: receiving the request, processing the request to generate a first transaction of a read-type and identifying at least one condition-satisfying TDL, acquiring a lock value for the condition-satisfying TDL, executing the first transaction, processing the request to generate a last transaction of a modification-type for modifying information associated with the at least one TDL, before executing the last transaction, checking a status of the lock, and only executing the last transaction based on a positive outcome. A distributed software system for doing the same is also provided.

Abstract: A system and method for automated caching and tabling for finding and swapping media content is disclosed.

Abstract: A computer-implemented method according to one embodiment includes performing a first process for each chunk of data of each file of a snapshot of a file system. The first process includes reading a given chunk of data of a given file of a first snapshot of the file system, and reading shadow records of a shadow file of the first snapshot. The given chunk of data is compared with the shadow records for determining whether a coherent state exists between the given chunk of data and one or more of the shadow records that were recorded in a snapshot creation window. In response to determining that no coherent state exists, an indication is recorded that the given chunk of data is corrupt. In response to determining that a coherent state exist, an indication is recorded that the given chunk of data is accurate.

Abstract: A first computing system may determine that a first event is represented in first data received from a second computing system. Based at least in part on the first event being represented in the first data, the first computing system may generate a time-ordered schedule of events that includes an indication of the first event, and may send, to a client device, second data representing the time-ordered schedule of events.

Abstract: In an example implementation, a print supply cartridge comprises a microcontroller to receive a timing challenge and enable authentication of the cartridge by providing a challenge response. The challenge response is provided in a challenge response time that falls within an expected time window.

Abstract: Embodiments for providing memory for continuous data protection in a data storage system by storing a first key-value map as a data structure wherein the key is an address of a volume and the value comprises timestamp and hash value pairs for each time the address had data written thereto, and corresponding hash values of the written data, and storing a second key-value map as a data structure wherein the key comprises the hash value and the value comprises the written data. The first key-value map and second key-value map are implemented as a driver component in a server computer of the data storage system. The driver exposes a block device protocol on the server computer and leverages the key-value data structures for use with a deduplication storage system.

Abstract: A method, article of manufacture, and apparatus for processing data. In some embodiments, this includes analyzing a first container at a block level, determining a first level of granularity based on the analysis of the first container, based on the first level of granularity, identifying a first set of data objects, storing metadata of the first set of data objects in a recovery catalog, based on the first set of data objects, identifying a second container, analyzing the second container at a block level, determining a second level of granularity based on the analysis of the second container, based on the second level of granularity, identifying a second set of data objects, storing metadata of the second set of data objects in the recovery catalog, wherein the recovery catalog is stored in a storage device.

Abstract: An execution of a data object is identified by a computing device. In response to identifying the execution of the data object, it is determined that the data object has requested a sensitive action of the computing device before interacting with a user of the computing device. In response to determining that the data object has requested the sensitive action, the data object is classified as a high-risk data object.

Abstract: Techniques for performing hash validation are provided. In one technique, a signature request that includes a first hash and a data identifier is received from a client. In response, the data identifier is identified and sent to a data repository, data that is associated with the data identifier is received from the data repository, a second hash is generated based on the data, and a determination is made whether the second hash matches the first hash. If the two hashes match, then the first hash is sent to a cryptographic device that generates a digital signature, which is eventually transmitted to the client. Alternatively, the digital signature is transmitted to the client prior to the first hash being validated. In a related technique, a server receives the signature request and sends the data identifier to a hash validator, which interacts with the data repository and generates the second hash.

Abstract: A computer-implemented method according to one embodiment includes initiating a file system interface in a kernel space of a system cluster, capturing a data access request sent from a user space of the system cluster, utilizing the file system interface, where the data access request is sent utilizing one or more protocols of a first file system, and redirecting the data access request to a second file system of the system cluster, utilizing the file system interface.

Abstract: Methods for encoding a file and de-duplicating a coded packet of the file are presented. The encoding method includes: identifying a file to be stored; encoding the file to generate a plurality of coded packets; generating a hash code associated with the file; distributing the plurality of coded packets to a plurality of storage nodes; and storing the hash code associated with the file in a hash server. The de-duplicating method includes: receiving a coded packet at a storage node; retrieving a hash code, from the hash server, corresponding to the coded packet; determining whether the coded packet has been stored in the storage node based upon the hash code; in response to determination that the coded packet has being stored, discarding the coded packet; and in response to determination that the coded packet has not being stored, storing the coded packet in the storage node.

Abstract: Implementations provide a flexible schema for efficiently querying chainable event blocks on user-identified data fields. An example method includes receiving at least one query parameter and, responsive to receiving the at least one query parameter, identifying an event access data record that includes a group identifier and a field matching the query parameter. The method also includes locating potential responsive blocks, the potential responsive blocks being event blocks in a chain that include the group identifier, and each of the potential responsive blocks also including content and a hash of a predecessor block. The method also includes identifying a first block of the potential responsive blocks that has content that includes the field matching the query parameter, and providing the first block as a response to the query.

Abstract: Techniques and mechanisms for providing a functionality which is selectable to undo one or more changes to metadata in a computing environment. In an embodiment, one or more source objects, stored by a version control system (VCS), represent one or more previous metadata changes. In response to a detection of the one or more metadata changes, an element of a user interface is configured to be selectable for undoing the one or more metadata changes. In another embodiment, a subsequent selection of the element invokes a retrieval of the one or more source objects from the VCS. Based on the retrieval of the one or more source objects from the VCS, a compilation is performed to generate a program which is executed to undo the one or more metadata changes.

Abstract: A blockchain-based software compliance system includes a computing system with a first computing device associated with first software. A monitoring system detects an update of the first computing device to replace the first software with second software, and generates a blockchain transaction that is directed to a blockchain address and that identifies the replacement of the first software with the second software. The monitoring system broadcasts the blockchain transaction, which is received by a blockchain device that executes a smart contract associated with the blockchain address. The blockchain device then determines that the execution of the smart contract has provided an indication that the updating of the first computing device with the second software does not comply with a computing system software matrix and, in response, causes an update to the first computing device that replaces the second software with third software that complies with the computing system software matrix.

Abstract: A data management device includes a persistent storage and a processor. The persistent storage includes an object storage that stores segments. The processor generates a collision free hash function based on the segments, generates a hash vector using the collision free hash function, deduplicates a portion of the segments associated with to-be-migrated files using the hash vector, and migrates the to-be-migrated files using the deduplicated portion of the segments to a remote storage.

Abstract: Systems and methods are provided for managing asynchronous replication in a distributed database environment, while providing for scaling of the distributed database. A cluster of nodes can be assigned roles for managing partitions of data within the database and processing database requests. In one embodiment, each cluster includes a node with a primary role to process write operations and mange permit asynchronous replication of the operations to at least one secondary node. Each cluster or set of nodes can host one or more partitions of database data, and grouping of the clusters can be implemented a shard cluster that hosts the data of the distributed database. Each shard can be configured to manage the size of any hosted partitions, splitting database partitions, migrated partitions, and managing expansion of shard clusters to encompass new systems.

Abstract: A system, method, and computer-readable medium are disclosed for managing the storage, access and synchronization of offline data. A set of online data, which is available for online access, is persisted as a set of offline data in a local storage associated with a user device and a key-value pair is used to cross-reference the first set of online data and the first set of offline data. An access request for a set of data, corresponding to the first set of online data, is received from a user device application. The access request is then processed to determine whether the first set of online data is available for online access. If it is, then the first set of online data is provided to the user device application for processing. Otherwise, the first set of offline data is provided to the user device application for processing.

Abstract: A computer-implemented method includes receiving a plurality of attribute headings for a product and storing the product and the associated attribute headings as part of a negotiation. A request for products associated with the negotiation is received and in response, a user interface listing at least one of the attribute headings for the product and providing controls for entering an attribute value for the listed at least one attribute heading is generated and transmitted. An attribute value for the listed attribute heading is received as part of a bid during the negotiation and is stored. An indication that the negotiation is complete is received and in response, the attribute value for the listed attribute heading is locked.

Abstract: A method includes receiving a first index of records in a first table and a second index of records in a second table. Each index entry of the indexes includes an aggregate value associated with the data in its respective record. The method further includes determining that the first table is inconsistent with the second table by comparing the aggregate values of a pair of indicator index entries of the indexes. The method further includes identifying a first pair of corresponding index entries from the indexes for which the aggregate values of the corresponding index entries are inconsistent and synchronizing records corresponding to the first pair of corresponding index entries. The method further includes updating the aggregate values of the index entries of the indexes and comparing the updated aggregate values of the pair of indicator index entries to determine whether the first table and the second table are consistent.

Abstract: Methods, systems, apparatus and computer programs for enabling access to data by a requesting party. A plurality of sets of data are generated. A one one-way function is then used to generate a plurality of keys each associated with a respective one of the plurality of sets. Information associated with the data in a given set is used as an input to the one-way function when generating the key for that set. The keys are distributed to requesting parties. Subsequently, a requesting party may make a data access request using the received key. Upon receipt of a key, access may be enabled to the data. The requesting party may then generate validation data from information associated with at least a part of the received data and validating the received data by comparing the validation data to data derived from the received key.

Abstract: Systems, methods, and computer-readable media are disclosed for an improved database. The systems, methods, and computer-readable media described herein may enhance the response time of databases and improve user experiences. In an example method described herein, a database management system may store, at a first database, a first data block. The first data block may be stored in association with one or more identifiers. The one or more identifiers may include an item identifier for an item associated with the first data block and at least one of a first identifier designating at least a portion of the first data block as public data or privileged data and a second identifier designating at least a portion of the first data block as optional data or mandatory data.

Abstract: Systems and methods are disclosed for processing data associated with isolated execution environments. A chunk of data associated with an isolated execution environment can include log data and non-log data. At least a portion of the log data can include log data generated by the isolated execution environment. The system can parse the chunk of data to identify the log data and the non-log data and extract at least a portion of the log data from the chunk of data. The extracted data can be further processed to generate one or more events.

Abstract: Aspects of the disclosure provide a solid state device that includes a non-volatile memory and a controller. The controller includes a processor, a memory, and a direct memory access (DMA) circuitry. The memory comprises a plurality of addresses. The DMA circuitry is configured to receive a first read request for data stored at a first address of the memory; determine whether the first address is an address from the plurality of addresses; when the first address is amongst the plurality of addresses, provide a first response comprising a particular data, without retrieving data stored at the first address; and when the first address is not amongst the plurality of addresses, retrieve the data stored at the first address, and provide a first response comprising the data retrieved from the first address.

Abstract: A determination that a machine learning data set is to be shuffled is made. Tokens corresponding to the individual observation records are generated based on respective identifiers of the records' storage objects and record key values. Respective representative values are derived from the tokens. The observation records are rearranged based on a result of sorting the representative values and provided to a shuffle result destination.

Abstract: A collision resistant blockchain network is disclosed that includes a network formed of a plurality of nodes and a collision resistant blockchain formed of a plurality of blocks redundantly stored across the nodes of the network. Each block of the collision resistant blockchain contains data. Each block also contains a forward blockchain hash digest formed from hashing the data front-to-back and a reverse blockchain hash digest formed from hashing the data back-to-front, whereby collisions that occur when two different sets of data are hashed front-to-back do not reoccur when those two different sets of data are also hashed back-to-front, thereby distinguishing the two different sets of data.

Abstract: Fast string search and matching is critical for many security tasks in particular if these have “gate functionality” for instance as found in access control applications, firewalls, routers, and load balancers. The fast matching of strings is essential to impose and enforce access control policies without creating bottlenecks. Firewalls protect networks by monitoring the traffic crossing the network perimeter. The number of packet matching rules firewalls can effectively handle is limited by the matching time and space complexity of the algorithms employed. A new approach implements matching independent of the number of rules and linear in the length of the rule to be matched. A data structure used in this approach is referred to as a “Bipartite Concatenated Representation” (BCR). The space complexity of the BCR within this application scenario scales as O(N log2 N) where N is the number of rules.