Vmware, Inc.

Lior Hipsh

Yoel Calderon

Or Lupovitz

Dima Golbert

Chen Doar

Rami Stern

A system is described for downloading server-based content to peers in a P2P network. The server-based content can be partitioned and different peers can be given priority for downloading the different parts. A client on each peer can view what content is available on each of the other peers as well as what content is available on a virtual peer, which represents content on the server and only makes content that exists on the server and not on any peers available for download. Consequently, a client on a peer requesting to download the content can download the content from the peers and the virtual peer based on a file sharing protocol, such as BitTorrent.

Downloading of server-based content through peer-to-peer networks

In an example, method of data protection in a document database system includes grouping documents input to the document database system into super documents, each of the super documents including a plurality of chunks, each of the plurality of chunks including one of the documents. The method further includes operating an object storage system according to a storage policy that implements parity processing, where the parity processing includes computing parity chunks for the super documents and storing the parity chunks in an object store, where a plurality of the parity chunks are computed for each of the super documents. The method further includes sending each of the super documents to the object storage system for parity processing according to the storage policy.

Data protection for a document database system

Prefetching techniques for a hybrid cloud system are described. The techniques include maintaining a graph in a graph database, the graph including nodes associated with data items to be accessed and links between the nodes, each link including an associated link weight. Conceptually, the link weights are indicative of how likely it is for a data item to which the link points to be accessed after the data item associated with the node from which the link extends is accessed. The link weights are updated as items are accessed and the graph is traversed. The graph structure and associated techniques help to reduce latency in a hybrid cloud system by providing for prefetch of items anticipated to be used at a later time.

Growing community of inventors

Hod Hasharon, Israel

Lior Hipsh