Packet routers route data packets based on existing topology files. The packet routers hash the existing topology files into content-addressed objects and exchange the content-addressed objects. One of the routers modifies its topology file into a new topology file, hashes the new topology file into a new content-addressed object, and transfers the new content-addressed object to the other packet routers. The packet routers exchange the content-addressed objects, and in response, exchange the topology files. The routers establish a consensus on the new topology file based on the existing topology files. The one packet router routes additional data packets based on the new topology file in response to the consensus. In some examples, the content-addressed objects comprise Inter-Planetary File System (IPFS) objects.

Implementations are provided herein for systems, methods, and a non-transitory computer product configured to use predictive analysis of quantifiable parameters associated with individual files stored on a distributed file storage system. In some embodiments, parameters are analyzed by machine learning so that scheduled antivirus scanning can be intelligently conducted. We teach creating a sequential order for scheduled antivirus scanning such that the files most likely to be accessed or needed by users in the future will be scanned for viruses before those files less likely to be accessed. Our teachings encompass the use of heuristic data compiled and analyzed on a per-file basis. We enable system administrators to determine which parameters to prioritize and to set thresholds for antivirus scanning such as time limits.

Implementations are provided herein for systems, methods, and a non-transitory computer product configured to use predictive analysis of quantifiable parameters associated with individual files stored on a distributed file storage system. In some embodiments, parameters are analyzed by machine learning so that scheduled antivirus scanning can be intelligently conducted. We teach creating a sequential order for scheduled antivirus scanning such that the files most likely to be accessed or needed by users in the future will be scanned for viruses before those files less likely to be accessed. Our teachings encompass the use of heuristic data compiled and analyzed on a per-file basis. We enable system administrators to determine which parameters to prioritize and to set thresholds for antivirus scanning such as time limits.

Various systems and methods are provided in which a replication process is initiated between a primary site and a recovery site, each having plurality of gateway appliances. Replication loads are evaluated for each given gateway appliance of the plurality of gateway appliances. If a determination is made that at least one gateway appliance of the plurality of gateway appliances is not overloaded, the plurality of gateway appliances are sorted based on replication loads respectively associated with each gateway appliance, and a determination is made as to whether a relative difference in replication loads between a gateway appliance having a highest replication load and a gateway appliance having a lowest replication load exceeds a difference threshold to determine whether the replication workloads between the gateway appliances should be rebalanced.

A REST-based event distribution system is described, with particular applicability to the distribution of distributed filesystem notifications over a high-latency best-effort network such as the Internet. In one embodiment, event channels are mapped to URL spaces and created and distributed through the use of HTTP POST and GET requests. The system is optimized for short polling by clients; an event history is maintained to buffer messages and maintain the idempotence of requests. In another embodiment, the events are registered as a SIP event pack allowing for the distribution of filesystem events.

A method and system for executing database queries in parallel using a shared metadata store. The metadata store may reside on a master node, where the master node is the root node in a tree. The master node may distribute query plans and query metadata to other nodes in the cluster. These additional nodes may request additional metadata from each other or the master nodes as necessary.

As disclosed herein a computer system for secure database backup and recovery in a secure database network has N distributed data nodes. The computer system includes program instructions that include instructions to receive a database backup file, fragment the file using a fragment engine, and associate each fragment with one node, where the fragment is not stored on the associated node. The program instructions further include instructions to encrypt each fragment using a first encryption key, and store, randomly, encrypted fragments on the distributed data nodes. The program instructions further include instructions to retrieve the encrypted fragments, decrypt the encrypted fragments using the first encryption key, re-encrypt the decrypted fragments using a different encryption key, and store, randomly, the re-encrypted fragments on the distributed data nodes. A computer program product and method corresponding to the above computer system are also disclosed herein.

A file server apparatus includes a second file system volume including cache data of a first file system volume stored in a shared file storage apparatus. The file server apparatus determines the operation type indicated by an access request to the first file system volume from a client. When the operation type is directory operation, the file server sends an instruction of directory operation to the shared file storage apparatus, and then transmits a completion response to the client. When the operation type is file operation, the file server apparatus executes a file operation in the second file system volume, transmits a completion response to the client, and then transmits a file operation instruction to the shared file storage apparatus.

A method, an apparatus, and an electronic device for processing a data transaction are disclosed. The method includes receiving an application request from a client to perform a data operation in a target data partition; creating a corresponding data transaction according to the application request, and assigning a transaction identifier to the data transaction; returning the transaction identifier that is assigned to the data transaction to the client; performing the data operation based on the target data partition according to the data operation carrying the transaction identifier and sent by the client; and processing the data transaction according to a transaction instruction sent by the client. The method enables a data operation to implement transactional attributes, and to satisfy a transactional nature of the data operation. Moreover, the service logic of data transactions implemented by the method is relatively simple, thus ensuring that data services have a good transactional nature.

A method, an apparatus, and an electronic device for processing a data transaction are disclosed. The method includes receiving an application request from a client to perform a data operation in a target data partition; creating a corresponding data transaction according to the application request, and assigning a transaction identifier to the data transaction; returning the transaction identifier that is assigned to the data transaction to the client; performing the data operation based on the target data partition according to the data operation carrying the transaction identifier and sent by the client; and processing the data transaction according to a transaction instruction sent by the client. The method enables a data operation to implement transactional attributes, and to satisfy a transactional nature of the data operation. Moreover, the service logic of data transactions implemented by the method is relatively simple, thus ensuring that data services have a good transactional nature.