Patents by Inventor Michael Craig Champion

Michael Craig Champion 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).

  • Memory efficient data processing
    Patent number: 8037096
    Abstract: Memory efficient data processing is provided in a computer environment. A data representation or description is utilized to reduce memory footprint. A data structure can be serialized iteratively utilizing the representation rather than first loading the entire data structure to memory. Portions of the data structure can be materialized to and removed from memory as function of operational need.
    Type: Grant
    Filed: June 29, 2007
    Date of Patent: October 11, 2011
    Assignee: Microsoft Corporation
    Inventors: Michael Craig Champion, Anders Hejlsberg, Andrew Eyring Kimball, Ralf Lammel, Henricus Johannes Maria Meijer, Ion Vasilian
  • Streamlined declarative parsing
    Patent number: 8005848
    Abstract: Programming mechanisms for data parsing facilitate both clear code specification and efficient execution. Declarative style code can be employed to enable clear and concise specification of data parsing. Further, an efficient parsing approach can be utilized that enables processing of a data structure without first materializing the entire structure to memory. More specifically, streaming and/or selective materialization of portions of data to memory can be employed.
    Type: Grant
    Filed: June 28, 2007
    Date of Patent: August 23, 2011
    Assignee: Microsoft Corporation
    Inventors: Michael Craig Champion, Anders Hejlsberg, Andrew Eyring Kimball, Ralf Lammel, Henricus Johannes Maria Meijer, David L. Remy, Ion Vasilian
  • MEMORY EFFICIENT DATA PROCESSING
    Publication number: 20090006450
    Abstract: Memory efficient data processing is provided in a computer environment. A data representation or description is utilized to reduce memory footprint. A data structure can be serialized iteratively utilizing the representation rather than first loading the entire data structure to memory. Portions of the data structure can be materialized to and removed from memory as function of operational need.
    Type: Application
    Filed: June 29, 2007
    Publication date: January 1, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: Michael Craig Champion, Anders Hejlsberg, Andrew Eyring Kimball, Ralf Lammel, Henricus Johannes Maria Meijer, Ion Vasilian
  • STREAMLINED DECLARATIVE PARSING
    Publication number: 20090006429
    Abstract: Programming mechanisms for data parsing facilitate both clear code specification and efficient execution. Declarative style code can be employed to enable clear and concise specification of data parsing. Further, an efficient parsing approach can be utilized that enables processing of a data structure without first materializing the entire structure to memory. More specifically, streaming and/or selective materialization of portions of data to memory can be employed.
    Type: Application
    Filed: June 28, 2007
    Publication date: January 1, 2009
    Applicant: MICROSOFT CORPORATION
    Inventors: Michael Craig Champion, Anders Hejlsberg, Andrew Eyring Kimball, Ralf Lammel, Henricus Johannes Maria Meijer, David L. Remy, Ion Vasilian