ADAM BARRETT GRAY
Social Work in Chicago, IL
License number
Illinois 149012560
Issued Date
Jul 3, 2007
Expiration Date
Nov 30, 2017
Type
Licensed Clinical Social Worker
License number
Illinois 150009652
Issued Date
Jun 26, 2004
Expiration Date
Nov 30, 2007
Type
Licensed Social Worker
Address
Address
Chicago, IL 60613
Personal information
See more information about ADAM BARRETT GRAY at radaris.comName
Address
Phone
3660 N Lake Shore Dr APT 2309, Chicago, IL 60613
58 Timberhill Dr, Crystal Lake, IL 60014
58 Timberhill Dr, Crystal Lake, IL 60014
Professional information
Software Developer
Position:
Software Developer at Cleversafe
Location:
Chicago, Illinois
Industry:
Computer Software
Work:
Cleversafe
- Chicago, IL since Jul 2011
-
Software Developer
Education:
Indiana University 2006 - 2011
Bachelor of Science (BSc), Informatics - Computer Science Cognate Purdue University 2004 - 2005
Bachelor of Science (BSc), Informatics - Computer Science Cognate Purdue University 2004 - 2005
Skills:
Java, Python, MySQL, C++, Ruby, C, SQL, Lisp, CouchDB, OpenMP, Linux, JSON, Git, Object Oriented Design, Agile Methodologies, Eclipse, Distributed Systems, Open Source, Mercurial, MPI, Scrum, Agile Testing, Continuous Improvement, File Systems, Indexing, MapReduce, Hadoop, Object Storage, Asynchronous, Design Patterns
Interests:
Reading, Culinary Arts, Sculpture, Digital Rights, Programming, homebrew electronics, Lego, Mid-century Modern Design, Linux, Comic Books, Open Source Software
Languages:
English, German
Retrieving Indexed Data From A Dispersed Storage Network
US Patent:
2013030, Nov 14, 2013
Filed:
Jul 16, 2013
Appl. No.:
13/943352
Inventors:
Ilya Volvovski - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Andrew Baptist - Mt. Pleasant WI, US
Adam Michael Gray - Chicago IL, US
Andrew Baptist - Mt. Pleasant WI, US
Assignee:
CLEVERSAFE, INC. - CHICAGO IL
International Classification:
G06F 17/30
US Classification:
707743
Abstract:
A method begins by a dispersed storage (DS) processing module traversing multiple index structures based on search criteria to identify an object retrieval structure. The method continues with the DS processing module retrieving a set of encoded data slices corresponding to the object retrieval structure from a dispersed storage network (DSN) and decoding the set of encoded data slices in accordance with a dispersed storage error coding function to recover the object retrieval structure. The method continues with the DS processing module identifying one of one or more data version records of the recovered object retrieval structure based on the search criteria to produce an identified data version record and determining DSN addressing information for at least a portion of data based on information of the identified data version record.
Storing Indexed Data To A Dispersed Storage Network
US Patent:
2013030, Nov 14, 2013
Filed:
Jul 16, 2013
Appl. No.:
13/943456
Inventors:
Ilya Volvovski - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Andrew Baptist - Mt. Pleasant WI, US
Adam Michael Gray - Chicago IL, US
Andrew Baptist - Mt. Pleasant WI, US
Assignee:
CLEVERSAFE, INC. - CHICAGO IL
International Classification:
G06F 17/30
US Classification:
707741
Abstract:
A method begins by a dispersed storage (DS) processing module storing a data portion in a dispersed storage network (DSN), where the data portion is associated with a set of data index keys, a version index key, and with a set of portion index keys. The method continues with the DS processing module traversing, based on the set of data index keys, a plurality of index structures to determine whether an object retrieval structure exists for the data portion. When the object retrieval structure exists, the method continues with the DS processing module updating the object retrieval structure by determining whether a version record exists that corresponds to the version index key and when the version record exists, creating, within the version record, a new data portion record for the data portion to include an identifier of the data portion and the set of portion index keys.
Listing Data Objects Using A Hierarchical Dispersed Storage Index
US Patent:
2013023, Sep 5, 2013
Filed:
Feb 25, 2013
Appl. No.:
13/775491
Inventors:
Wesley Leggette - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Assignee:
Cleversafe, Inc. - Chicago IL
International Classification:
G06F 17/30
US Classification:
707741
Abstract:
A method begins by a dispersed storage (DS) processing module receiving a request for a data index list that identifies data objects having one or more common attributes, searching a hierarchical ordered index structure to identify a data object level index node corresponding to a first data object boundary match, and determining whether the data object level index node corresponds to a second data object boundary match. When the data object level index node does not correspond to the second data object boundary match, the method continues with the DS processing module searching an adjacent data object level index node to determine whether the adjacent data object level index node corresponds to the second data object boundary match. When the adjacent data object level index node corresponds to the second data object boundary match, the method continues with the DS processing module generating the data index list.
Modifying An Index Node Of A Hierarchical Dispersed Storage Index
US Patent:
2013023, Sep 5, 2013
Filed:
Feb 25, 2013
Appl. No.:
13/775555
Inventors:
Wesley Leggette - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Jason K. Resch - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Jason K. Resch - Chicago IL, US
Assignee:
Cleversafe, Inc. - Chicago IL
International Classification:
G06F 17/30
US Classification:
707741
Abstract:
A method begins by a dispersed storage (DS) processing module determining to create or modify a data object index key of a data object regarding an attribute of a plurality of attribute categories. The method continues with the DS processing module entering a process to update a data object level index node by retrieving the data object level index node from a set of dispersed storage (DS) units. The method continues with the DS processing module updating and encoding the data object level index node to produce a set of slices. The method continues with the DS processing module generating a set of write commands to write the set of slices to the set of DS units. When less than a threshold number of the set of write commands are successfully executed by the set of DS units, repeating the process to update the data object level index node.
Expanding A Hierarchical Dispersed Storage Index
US Patent:
2013027, Oct 17, 2013
Filed:
Feb 25, 2013
Appl. No.:
13/775769
Inventors:
Wesley Leggette - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Jason K. Resch - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Jason K. Resch - Chicago IL, US
Assignee:
CLEVERSAFE, INC. - Chicago IL
International Classification:
G06F 17/30
US Classification:
707829
Abstract:
A method begins by a dispersed storage (DS) processing module determining to expand a hierarchical ordered index structure and retrieving a root index node. The method continues with the DS processing module identifying immediate children index nodes, dividing the immediate children index nodes into sets of children index nodes, creating, for each of the sets of children index nodes, a sub-root index node to produce a set of sub-root index nodes, creating a new root index node to include entries for each of the sub-root index nodes of the set of sub-root index nodes, and temporarily storing the new root index node and the set of sub-root index nodes in a dispersed storage network (DSN). When the root index node has not changed, the method continues with the DS processing module updating the hierarchical ordered index structure with the new root index node and the set of sub-root index nodes.
Splitting An Index Node Of A Hierarchical Dispersed Storage Index
US Patent:
2013023, Sep 12, 2013
Filed:
Feb 25, 2013
Appl. No.:
13/775734
Inventors:
Wesley Leggette - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Jason K. Resch - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Jason K. Resch - Chicago IL, US
Assignee:
CLEVERSAFE, INC. - Chicago IL
International Classification:
G06F 17/30
US Classification:
707741
Abstract:
A method begins by a dispersed storage (DS) processing module determining to remove data object index entries from a data object level index node, identifying data object index entries to extract, and creating a temporary sibling data object level index node to include the identified data object index entries. The method continues with the DS processing module initiating updating of an hierarchical ordered index structure by identifying an address for storing the temporary sibling data object level index node, setting up linking the temporary sibling data object level index node to a next level node and to an adjacent data object level index node, and determining whether a change has occurred. When the change has not occurred, the method continues with the DS processing module removing the data object index entries from the data object level index node and commencing the updating of the hierarchical ordered index structure.
Merging Index Nodes Of A Hierarchical Dispersed Storage Index
US Patent:
2013023, Sep 5, 2013
Filed:
Feb 25, 2013
Appl. No.:
13/775701
Inventors:
Wesley Leggette - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Jason K. Resch - Chicago IL, US
Adam Michael Gray - Chicago IL, US
Ilya Volvovski - Chicago IL, US
Andrew Baptist - Chicago IL, US
Jason K. Resch - Chicago IL, US
Assignee:
CLEVERSAFE, INC. - Chicago IL
International Classification:
G06F 3/06
US Classification:
711154
Abstract:
A method begins by a dispersed storage (DS) processing module determining to merge two data object level index nodes and merging the two nodes into a temporarily merged data object level index node. The method continues with the DS processing module initiating updating of a hierarchical ordered index structure by identifying an address for storing the temporarily merged data object level index node, setting up deletion of the two data object level index nodes, setting up linking the temporarily merged data object level index node to a next level node of the hierarchical ordered index structure, and determining whether a change has occurred to at least one of one or more of the two data object level index nodes and the next level node. When the change has not occurred, the method continues with the DS processing module commencing the updating of the hierarchical ordered index structure.
Retrieving Data Utilizing A Distributed Index
US Patent:
2013019, Aug 1, 2013
Filed:
Dec 18, 2012
Appl. No.:
13/718961
Inventors:
GREG DHUSE - CHICAGO IL, US
WESLEY LEGGETTE - CHICAGO IL, US
ADAM MICHAEL GRAY - CHICAGO IL, US
ILYA VOLVOVSKI - CHICAGO IL, US
ANDREW BAPTIST - CHICAGO IL, US
WESLEY LEGGETTE - CHICAGO IL, US
ADAM MICHAEL GRAY - CHICAGO IL, US
ILYA VOLVOVSKI - CHICAGO IL, US
ANDREW BAPTIST - CHICAGO IL, US
Assignee:
CLEVERSAFE, INC. - CHICAGO IL
International Classification:
G06F 17/30
US Classification:
707769
Abstract:
A method begins by a dispersed storage (DS) processing module receiving a request to retrieve a data object based on a search attribute. The method continues with the DS processing module retrieving and decoding a set of encoded index data slices to reconstruct an index file. The method continues with the DS processing module identifying a child index file, retrieving and decoding a set of encoded child index data slices to reconstruct the child index file, and determining whether the child index file includes a dispersed storage network (DSN) address for the data object. When the child index file includes the DSN address for the data object, the method continues with the DS processing module retrieving a plurality of sets of encoded data slices based on the DSN address and decoding the plurality of sets of encoded data slices to recapture the data object.