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: 9065469
    Abstract: 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: Grant
    Filed: July 19, 2013
    Date of Patent: June 23, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventor: Benjamin A. Mickle
  • Patent number: 8850148
    Abstract: 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: Grant
    Filed: April 29, 2013
    Date of Patent: September 30, 2014
    Assignee: Microsoft Corporation
    Inventors: Michael R. Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum
  • Publication number: 20130307710
    Abstract: 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: Application
    Filed: July 19, 2013
    Publication date: November 21, 2013
    Inventor: Benjamin A. Mickle
  • Patent number: 8516005
    Abstract: 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: Grant
    Filed: January 13, 2011
    Date of Patent: August 20, 2013
    Assignee: Microsoft Corporation
    Inventors: Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum, Landy Wang
  • Patent number: 8493249
    Abstract: 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: Grant
    Filed: June 3, 2011
    Date of Patent: July 23, 2013
    Assignee: Microsoft Corporation
    Inventor: Benjamin A. Mickle
  • Patent number: 8433871
    Abstract: 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: Grant
    Filed: March 6, 2012
    Date of Patent: April 30, 2013
    Assignee: Microsoft Corporation
    Inventors: Michael R. Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum
  • Publication number: 20120306670
    Abstract: 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: Application
    Filed: June 3, 2011
    Publication date: December 6, 2012
    Applicant: Microsoft Corporation
    Inventor: Benjamin A. Mickle
  • Publication number: 20120166719
    Abstract: 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: Application
    Filed: March 6, 2012
    Publication date: June 28, 2012
    Applicant: Microsoft Corporation
    Inventors: Michael R. Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum
  • Patent number: 8151068
    Abstract: 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: Grant
    Filed: February 4, 2008
    Date of Patent: April 3, 2012
    Assignee: Microsoft Corporation
    Inventors: Michael R Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A Mickle, Alexander Kirshenbaum
  • Publication number: 20110113432
    Abstract: 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: Application
    Filed: January 13, 2011
    Publication date: May 12, 2011
    Applicant: Microsoft Corporation
    Inventors: Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum, Landy Wang
  • Patent number: 7895242
    Abstract: 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: Grant
    Filed: October 31, 2007
    Date of Patent: February 22, 2011
    Assignee: Microsoft Corporation
    Inventors: Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A Mickle, Alexander Kirshenbaum, Landy Wang
  • Publication number: 20090198883
    Abstract: 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: Application
    Filed: February 4, 2008
    Publication date: August 6, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: Michael R. Fortin, Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A. Mickle, Alexander Kirshenbaum
  • Publication number: 20090112949
    Abstract: 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: Application
    Filed: October 31, 2007
    Publication date: April 30, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: Cenk Ergan, Mehmet Iyigun, Yevgeniy Bak, Benjamin A Mickle, Alexander Kirshenbaum, Landy Wang