Patents by Inventor Marcus Jon Jager

Marcus Jon Jager 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).

  • Publication number: 20220414070
    Abstract: A graph tracks the lineage of customer data, including when it was originally extracted from a customer computing system, and any transformation results indicating transformations that were performed on the customer data. The graph is traversed to identify nodes in the graph that have expired based upon data removal policies. The customer data represented by the expired nodes in the graph is deleted and the graph is modified to delete the expired nodes. The modified graph is then stored in persistent memory until data removal is next triggered.
    Type: Application
    Filed: June 23, 2021
    Publication date: December 29, 2022
    Inventors: Arpan Jugalkishor Asawa, Brian Douglas Remick, Marcus Vinicius Silva Gois, Ritesh Kumar Sinha, Sidi Lin, Sejal Kiran Shinde, Ryan Lee Jobse, Rong Guo, Sharanya Chinnusamy, Marc Andrew Power, Marcus Jon Jager
  • Patent number: 7836458
    Abstract: A configuration system is described. In an implementation, a method includes determining through execution of a configuration system whether an application qualifies as a member of one or more of a plurality of groups. Each of the groups defines one or more criteria for membership and has at least one corresponding block having configuration data. The determining is performed based on whether the application satisfies the one or more criteria. For each of the groups, of which, the application qualifies as a member, the configuration data of the at least one corresponding block is loaded.
    Type: Grant
    Filed: July 15, 2004
    Date of Patent: November 16, 2010
    Assignee: Microsoft Corporation
    Inventors: Kazimierz K. Gwozdz, Marcus Jon Jager, Durgesh Srivastava
  • Patent number: 7600126
    Abstract: Efficient processing of time-bound messages is described herein. In an implementation, messages are classified either time-bounded messages or non-time-bounded messages. The time-bounded messages are then processed separately from the non-time-bound messages. Examples of time-bounded messages can include spam e-mails or other types or classes of e-mails subject to a retention policy, such that the are retained only for some set period of time. Metadata relating to the time-bound messages are compiled and stored separately from the messages, thereby enabling optimization of the metadata storage and processing apart from the messages. The time-bounded messages are accumulated before they are processed in bulk, thereby reducing the number if I/O operations consumed by the time-bound messages, and reducing the amount and cost of resources supporting the process of the time-bounded messages.
    Type: Grant
    Filed: May 27, 2005
    Date of Patent: October 6, 2009
    Assignee: Microsoft Corporation
    Inventors: William J. Bolosky, Atul Adya, Ronnie I Chaiken, Marcus Jon Jager