UPTHERE, INC. Patent applications |
Patent application number | Title | Published |
20150261798 | MAINTAINING AND USING A CACHE OF CHILD-TO-PARENT MAPPINGS IN A CONTENT-ADDRESSABLE STORAGE SYSTEM - Techniques for maintaining and using cached child-to-parent mappings in a content-addressable storage system are provided. A cache of child-to-parent mappings is maintained. Each child-to-parent mapping corresponds to a particular chunk in a hierarchy of chunks stored in a content-addressable chunk store, and maps the particular chunk to a parent chunk in the hierarchy of chunks. The hierarchy of chunks includes a first root chunk associated with a file system volume. In response to a change to the file system volume that causes associating a new root chunk with the file system volume, the cache is updated by adding one or more first child-to-parent mappings based on traversing at least a portion of a current file system hierarchy from the new root chunk, and removing one or more second child-to-parent mappings based on traversing at least a portion of a prior file system hierarchy from the first root chunk. | 09-17-2015 |
20150186393 | REPRESENTING DIRECTORY STRUCTURE IN CONTENT-ADDRESSABLE STORAGE SYSTEMS - Techniques for representing directory structure in content-addressable storage systems are provided. A directory structure of a file system is represented using a plurality of chunks in a content-addressable storage system. The directory structure includes a set of objects arranged in an object hierarchy. The set of objects includes a particular directory that has, within the object hierarchy, a set of child objects. The plurality of chunks includes a directory object chunk for the particular directory. The plurality of chunks further includes a particular set of child object chunks. The particular set of child object chunks are object chunks for each child object in the set of child objects. The plurality of chunks further includes at least one hash set chunk with hash values for object chunks in the particular set of child object chunks. | 07-02-2015 |
20150134638 | NAVIGATING THROUGH MEDIA OBJECT COLLECTION - A method and apparatus are provided for navigating through a media object collection using a mobile device. Users navigate to the target media objects by repeatedly specifying filters. After a user specifies a filter, the filter is applied in combination with all previously specified filters to produce a filtered set of media objects. After a filter is applied, a display level is selected for each hierarchical dimension for which the media objects have metadata. The selection of the display level may be based on the number of distinct values that the media objects in the filtered set have for each level of the hierarchical dimension. Single-action controls are then displayed for each of the values that the media objects in the filtered set have for the selected display level. | 05-14-2015 |
20150026454 | CHUNK-LEVEL CLIENT SIDE ENCRYPTION IN HIERARCHICAL CONTENT ADDRESSABLE STORAGE SYSTEMS - Techniques for chunk-level client side encryption are provided. In a content addressable storage system, a plurality of chunks is used to implement a hierarchical file system. The hierarchical file system supports both encrypted and non-encrypted volumes. A folders and files layer makes calls directly to a chunk system layer for operations involving non-encrypted volumes. The folders and files layer makes calls to a volume encryption layer for operations involving encrypted volumes. The volume encryption layer receives calls from the folders and files layer through an API that matches the API through which the chunk system layer receives calls from the folders and files layer. | 01-22-2015 |
20140188816 | DETECTING DEVIATION BETWEEN REPLICAS USING BLOOM FILTERS - Techniques are provided for using near-full bloom filters for efficiently identifying hash slices in which the deviation between replicas is sufficient to justify remedial measures. Techniques are also described for adjusting the size of slices and the size of the bloom filters, so that the bloom-filter-to-bloom-filter comparison serves as an accurate indicator of the degree to which the contents of the slices of a slice pair have deviated. Slice size may vary from slice pair to slice pair, so that relatively sparsely populated portions of the ring (access key ranges into which fewer chunks fall) are represented by relatively larger slices, while relatively densely populated portions of the ring (access key ranges into which more chunks fall) are represented by relatively smaller slices. | 07-03-2014 |
20130198475 | CONTENT ADDRESSABLE STORES BASED ON SIBLING GROUPS - A content addressable storage (CAS) system is provided in which each storage unit is assigned to one of a plurality of sibling groups. Each sibling group is assigned the entire hash space. Within each sibling group, the hash space is partitioned into hash segments which are assigned to the individual storage units that belong to the sibling group. Chunk retrieval requests are submitted to all sibling groups. Chunk storage requests are submitted to a single sibling group. The sibling group to which a storage request is submitted depends on whether any sibling group already stores the chunk, and which sibling groups are considered full. | 08-01-2013 |