Abstract: The methods and systems for transferring structural data over a network are provided. An example method includes providing storage operable to store a plurality of objects. The objects of the plurality of objects are immutable and include a data object or a metadata object including a list of references to further objects. The plurality of objects includes at least one root associated with a creation or an addition to the plurality of objects. The method also includes providing a further storage communicatively coupled with the storage via a network and configured to store a copy of the plurality of objects. The method includes determining a presence of a difference between the plurality of the objects and the copy. In response to the determination, the method transfers at least one object associated with the difference from the storage to the further storage.

Abstract: Provided are systems and methods for garbage collection of objects in storage. An example method may include providing a monotonically increasing logical clock. Each object is associated with a first number and a second number. The second number is a minimum of the first numbers of objects in a subtree to which the object refers. When the logical clock increases, objects with the first number less than the logical clock from the storage are deleted. When a new object is added to the storage, the first number of the new object is set to a new first number. The new first number is equal to or greater than the logical clock. The first number of each object in a subtree to which the new object is referring is updated. The updated first number is a function of a previous first number and a previous logical clock.

Abstract: Provided are systems and methods for garbage collection of objects in storage. An example method may include providing a monotonically increasing logical clock. Each object is associated with a first number and a second number. The second number is a minimum of the first numbers of objects in a subtree to which the object refers. When the logical clock increases, objects with the first number less than the logical clock from the storage are deleted. When a new object is added to the storage, the first number of the new object is set to a new first number. The new first number is equal to or greater than the logical clock. The first number of each object in a subtree to which the new object is referring is updated. The updated first number is a function of a previous first number and a previous logical clock.

Abstract: Provided are systems and methods for organizing data. An example method includes providing a content-addressable object store to keep data objects representing pieces of the data. The method further includes associating with the data objects. Each node of the directed graph is immutable and associated with either a data object or a metadata object storing list of references to data objects or further metadata objects. When the data objects are modified, a further directed graph is associated with the data objects. The further directed graph is a modification to and shares nodes with the directed graph. Roots of the directed graphs are published in a consensus store. The method includes managing roots associated with the directed graphs and provides access to snapshots associated with the modification of the data objects.

Abstract: Methods and systems for organizing data are provided. An example method includes providing an object store to store objects. Each of the objects represents fragments of the data is are associated with an address. The method further allows associating a B-tree with the object store. The B-tree includes nodes, wherein each of the nodes includes keys, and wherein each of the keys is associated with at least one object from the object store. Values for each of the keys are generated based at least partially on objects from the object store. If the size of an object from the object store is less than a pre-determined size, a value of the object is stored in a particular node of the B-tree, with the particular nodes including a particular key associated with the object. Otherwise, the method includes storing the address associated with the object in the particular node of the B-tree.

Abstract: The methods and systems for transferring structural data over a network are provided. An example method includes providing storage operable to store a plurality of objects. The objects of the plurality of objects are immutable and include a data object or a metadata object including a list of references to further objects. The plurality of objects includes at least one root associated with a creation or an addition to the plurality of objects. The method also includes providing a further storage communicatively coupled with the storage via a network and configured to store a copy of the plurality of objects. The method includes determining a presence of a difference between the plurality of the objects and the copy. In response to the determination, the method transfers at least one object associated with the difference from the storage to the further storage.

Abstract: A method is described comprising: receiving a broadcast signal containing a plurality of encrypted multimedia channels; storing the encrypted multimedia channels in a first hard drive partition; and decrypting one or more of the encrypted multimedia channels to generate one or more decrypted multimedia channels; and storing the decrypted multimedia channels to a second hard drive partition.

Abstract: A method is described comprising: receiving a broadcast signal containing a plurality of encrypted multimedia channels; storing the encrypted multimedia channels in a first hard drive partition; and decrypting one or more of the encrypted multimedia channels to generate one or more decrypted multimedia channels; and storing the decrypted multimedia channels to a second hard drive partition.