IP Library Granted Patent US 10,915,504
Granted Patent B2
US 10,915,504 · App. 15/831,083 · Granted Feb 9, 2021

Distributed object-based storage system that uses pointers stored as object attributes for object analysis and monitoring

Inventors: Jason Kenneth Small (Pittsburgh, PA); Ben Zion Halevy (Tel-Aviv, IL); Daniel Belov (Pittsburgh, PA)
Assignee: PANASAS, INC.
G06F16/183G06F16/13G06F16/16
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,915,504
App. No.
15/831,083
Granted
Feb 9, 2021
Kind
B2
Abstract

In a distributed object-based storage system that includes a plurality of object storage devices and one or more clients that access distributed, object-based files from the object storage devices, each of the files being comprised of a plurality of object components residing on different object storage device, systems and methods that use pointers stored as object attributes for file analysis and monitoring.

Claims (10)

1. In a distributed object-based storage system that includes a plurality of object storage devices, and one or more clients that access distributed, object-based files from the object storage devices, each of said files being comprised of a plurality of object components residing on different object storage devices, a method for identifying files that are missing components, comprising:

for at least one component of each file, storing on the object storage device storing the component a single pointer having a count value in an attribute field of the component, wherein the count value of the single pointer corresponds to a maximum number of components for the file, and wherein the single pointer points to a further component of the file such that a last single component points back to a first single component to form a ring, and the last single component is different from the first single component, and the single pointer in the last component includes a value of the first component; and

for each file, using at least one network node to retrieve a list of components in the file and attempt to retrieve from an attribute field of at least one component of the file, the count value of the single pointer corresponding to the maximum number of components of the file; and

for each file, if the count value of the single pointer corresponding to the maximum number of components of the file was successfully retrieved from an attribute field of at least one component of the file, using at least one network node to compare the number of components on the list to the count value of the single pointer and determine that the file has the missing components if the file has fewer components than the count value of the single pointer.

2. The method of claim 1 , wherein a file is identified as having a metadata inconsistency if the attempt to retrieve the count value from an attribute field of at least one component of the file is unsuccessful.

3. In a distributed object-based storage system that includes a plurality of object storage devices, and one or more clients that access distributed, object-based files from the object storage devices, each of said files being comprised of a plurality of object components residing on different object storage devices, a system for identifying files that are missing components, comprising:

at least one server that, for at least one component of each file, stores on the object storage device storing the component a single pointer having a count value in an attribute field of the component, wherein the count value of the single pointer corresponds to a maximum number of components for the file, and wherein the single pointer points to a further component of the file such that a last single component points back to a first single component to form a ring, and the last single component is different from the first single component, and the single pointer in the last component includes a value of the first component; and

wherein, for each file, the at least one server retrieves a list of components in the file and attempts to retrieve from an attribute field of at least one component of the file the count value corresponding to the maximum number of components of the file; and

wherein, for each file, the at least one server compares the number of components on the list to the count value of the single pointer and determines that the file has the missing components if the file has fewer components than the count value.

4. The system of claim 3 , wherein the at least one server identifies a file as having at least one missing component if the attempt to retrieve the count value from an attribute field of at least one component of the file is unsuccessful.

Continuity (5)
Continuation 15261588 · Sep 9, 2016
Continuation 13082255 · Apr 7, 2011
Continuation 11825921 · Jul 10, 2007
Continuation 10918202 · Aug 13, 2004
Related Publication 20190129978A1 · May 2, 2019