Patents by Inventor Benjamin A Mickle
Benjamin A Mickle has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9065469Abstract: In embodiments of compression match enumeration, a trie structure can be searched to enumerate data sequence matches after the trie structure is generated. The trie structure can be generated by overwriting a suffix array of data sequences stored in a memory buffer, where the suffix array includes an array of buffer positions sorted alphabetically by a data string that begins a data sequence at a respective buffer position. The trie structure can then be traversed to determine the data sequence matches from nodes in the trie structure. The trie structure can also be updated while being traversed to bypass multiple enumerations of the data sequence matches that have the same match length.Type: GrantFiled: July 19, 2013Date of Patent: June 23, 2015Assignee: Microsoft Technology Licensing, LLCInventor: Benjamin A. Mickle
-
Patent number: 8850148Abstract: Multiple copy sets of data are maintained on one or more storage devices. Each copy set includes at least some of the same data units as other sets. Different sets optionally have data units stored in different orders on the storage device(s). A particular one of the sets of data is selected as the set to be accessed in response to detecting a particular scenario.Type: GrantFiled: April 29, 2013Date of Patent: September 30, 2014Assignee: Microsoft CorporationInventors: Michael R. Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum
-
Publication number: 20130307710Abstract: In embodiments of compression match enumeration, a trie structure can be searched to enumerate data sequence matches after the trie structure is generated. The trie structure can be generated by overwriting a suffix array of data sequences stored in a memory buffer, where the suffix array includes an array of buffer positions sorted alphabetically by a data string that begins a data sequence at a respective buffer position. The trie structure can then be traversed to determine the data sequence matches from nodes in the trie structure. The trie structure can also be updated while being traversed to bypass multiple enumerations of the data sequence matches that have the same match length.Type: ApplicationFiled: July 19, 2013Publication date: November 21, 2013Inventor: Benjamin A. Mickle
-
Patent number: 8516005Abstract: Compressed storage management includes assigning a selection priority and a priority level to multiple data units stored in an uncompressed portion of a storage resource. The management can further include compressing data units and storing the compressed data units in a compressed portion of the storage resource. The data units in the compressed portion are stored in regions, which each store data units having the same selection priority or the same selection priority level.Type: GrantFiled: January 13, 2011Date of Patent: August 20, 2013Assignee: Microsoft CorporationInventors: Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum, Landy Wang
-
Patent number: 8493249Abstract: In embodiments of compression match enumeration, a suffix array can be generated that is representative of data sequences stored in a memory buffer. The suffix array can then be converted into a trie structure that overwrites the suffix array in the memory buffer as the trie structure is generated in-place of the suffix array. The trie structure includes nodes that each represent one or more suffixes of the suffix array, where each consecutive suffix is either grouped with an existing node in the trie structure or added as a new node of the trie structure. Data sequence matches can then be enumerated as determined from the trie structure.Type: GrantFiled: June 3, 2011Date of Patent: July 23, 2013Assignee: Microsoft CorporationInventor: Benjamin A. Mickle
-
Patent number: 8433871Abstract: Multiple copy sets of data are maintained on one or more storage devices. Each copy set includes at least some of the same data units as other sets. Different sets optionally have data units stored in different orders on the storage device(s). A particular one of the sets of data is selected as the set to be accessed in response to detecting a particular scenario.Type: GrantFiled: March 6, 2012Date of Patent: April 30, 2013Assignee: Microsoft CorporationInventors: Michael R. Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum
-
Publication number: 20120306670Abstract: In embodiments of compression match enumeration, a suffix array can be generated that is representative of data sequences stored in a memory buffer. The suffix array can then be converted into a trie structure that overwrites the suffix array in the memory buffer as the trie structure is generated in-place of the suffix array. The trie structure includes nodes that each represent one or more suffixes of the suffix array, where each consecutive suffix is either grouped with an existing node in the trie structure or added as a new node of the trie structure. Data sequence matches can then be enumerated as determined from the trie structure.Type: ApplicationFiled: June 3, 2011Publication date: December 6, 2012Applicant: Microsoft CorporationInventor: Benjamin A. Mickle
-
Publication number: 20120166719Abstract: Multiple copy sets of data are maintained on one or more storage devices. Each copy set includes at least some of the same data units as other sets. Different sets optionally have data units stored in different orders on the storage device(s). A particular one of the sets of data is selected as the set to be accessed in response to detecting a particular scenario.Type: ApplicationFiled: March 6, 2012Publication date: June 28, 2012Applicant: Microsoft CorporationInventors: Michael R. Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum
-
Patent number: 8151068Abstract: Multiple copy sets of data are maintained on one or more storage devices. Each copy set includes at least some of the same data units as other sets. Different sets optionally have data units stored in different orders on the storage device(s). A particular one of the sets of data is selected as the set to be accessed in response to detecting a particular scenario.Type: GrantFiled: February 4, 2008Date of Patent: April 3, 2012Assignee: Microsoft CorporationInventors: Michael R Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A Mickle, Alexander Kirshenbaum
-
Publication number: 20110113432Abstract: Compressed storage management includes assigning a selection priority and a priority level to multiple data units stored in an uncompressed portion of a storage resource. The management can further include compressing data units and storing the compressed data units in a compressed portion of the storage resource. The data units in the compressed portion are stored in regions, which each store data units having the same selection priority or the same selection priority level.Type: ApplicationFiled: January 13, 2011Publication date: May 12, 2011Applicant: Microsoft CorporationInventors: Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum, Landy Wang
-
Patent number: 7895242Abstract: In accordance with one or more aspects, compressed storage management in a system includes determining which of multiple data units stored in an uncompressed portion of the storage resource are to be compressed and stored in a compressed portion of the storage resource. The management can further include returning one or more regions of the compressed portion for use in the uncompressed portion in response to storage resource pressure in the system, as well as compacting regions in the compressed portion to fill empty gaps in the compressed portion.Type: GrantFiled: October 31, 2007Date of Patent: February 22, 2011Assignee: Microsoft CorporationInventors: Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A Mickle, Alexander Kirshenbaum, Landy Wang
-
Publication number: 20090198883Abstract: Multiple copy sets of data are maintained on one or more storage devices. Each copy set includes at least some of the same data units as other sets. Different sets optionally have data units stored in different orders on the storage device(s). A particular one of the sets of data is selected as the set to be accessed in response to detecting a particular scenario.Type: ApplicationFiled: February 4, 2008Publication date: August 6, 2009Applicant: MICROSOFT CORPORATIONInventors: Michael R. Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum
-
Publication number: 20090112949Abstract: In accordance with one or more aspects, compressed storage management in a system includes determining which of multiple data units stored in an uncompressed portion of the storage resource are to be compressed and stored in a compressed portion of the storage resource. The management can further include returning one or more regions of the compressed portion for use in the uncompressed portion in response to storage resource pressure in the system, as well as compacting regions in the compressed portion to fill empty gaps in the compressed portion.Type: ApplicationFiled: October 31, 2007Publication date: April 30, 2009Applicant: MICROSOFT CORPORATIONInventors: Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A Mickle, Alexander Kirshenbaum, Landy Wang