Patents by Inventor Joel Pothering

Joel Pothering 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: 9183267
    Abstract: Several local databases may be linked together to form a large database. Each database may share a common type definition, but may contain only a portion of the large database. When a local database queries information from another database, the result may be stored locally using the type system. Across the entire database, items may be identified as their local or home database along with an identifier provided by that database. Cached information may be stored locally and may refer to the source for that information through the identifier. Once the cached information is present, queries that reference the record may be satisfied by the cached information. The cached information may be refreshed from the source database or may expire to avoid stale or changed data in the cache.
    Type: Grant
    Filed: May 24, 2010
    Date of Patent: November 10, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Joel Pothering, Sandeep Phadke, Mark Sterin
  • Patent number: 8838655
    Abstract: Technologies are described herein for applying type projection queries to instance space graphs. Through the utilization of the technologies and concepts presented herein, a type projection may be used to describe the hierarchy of instance types connected by relationships within an instance space graph. A type projection query based on the type projection may be dynamically generated to query instances and relationships within the instance store. Filter criteria for the query can be expressed using a path notation. Results from of the type projection query may be provided as graphs of instances and relationships which are subgraphs of the queried instance space graph. Programmatic traversal of the resultant subgraph can navigate to each instance node within the result space.
    Type: Grant
    Filed: February 12, 2013
    Date of Patent: September 16, 2014
    Assignee: Microsoft Corporation
    Inventors: Joel Pothering, Jakub Oleksy, Ashvinkumar J. Sanghvi, Pratibha Mallya, Murat Ersan, Bogdan Berce
  • Patent number: 8380759
    Abstract: Technologies are described herein for applying type projection queries to instance space graphs. Through the utilization of the technologies and concepts presented herein, a type projection may be used to describe the hierarchy of instance types connected by relationships within an instance space graph. A type projection query based on the type projection may be dynamically generated to query instances and relationships within the instance store. Filter criteria for the query can be expressed using a path notation. Results from of the type projection query may be provided as graphs of instances and relationships which are subgraphs of the queried instance space graph. Programmatic traversal of the resultant subgraph can navigate to each instance node within the result space.
    Type: Grant
    Filed: November 21, 2009
    Date of Patent: February 19, 2013
    Assignee: Microsoft Corporation
    Inventors: Joel Pothering, Jakub Oleksy, Ashvinkumar J. Sanghvi, Pratibha Mallya, Murat Ersan, Bogdan Berce
  • Publication number: 20110289055
    Abstract: Several local databases may be linked together to form a large database. Each database may share a common type definition, but may contain only a portion of the large database. When a local database queries information from another database, the result may be stored locally using the type system. Across the entire database, items may be identified as their local or home database along with an identifier provided by that database. Cached information may be stored locally and may refer to the source for that information through the identifier. Once the cached information is present, queries that reference the record may be satisfied by the cached information. The cached information may be refreshed from the source database or may expire to avoid stale or changed data in the cache.
    Type: Application
    Filed: May 24, 2010
    Publication date: November 24, 2011
    Applicant: MICROSOFT CORPORATION
    Inventors: Joel POTHERING, Sandeep PHADKE, Mark STERIN
  • Publication number: 20110125737
    Abstract: Technologies are described herein for applying type projection queries to instance space graphs. Through the utilization of the technologies and concepts presented herein, a type projection may be used to describe the hierarchy of instance types connected by relationships within an instance space graph. A type projection query based on the type projection may be dynamically generated to query instances and relationships within the instance store. Filter criteria for the query can be expressed using a path notation. Results from of the type projection query may be provided as graphs of instances and relationships which are subgraphs of the queried instance space graph. Programmatic traversal of the resultant subgraph can navigate to each instance node within the result space.
    Type: Application
    Filed: November 21, 2009
    Publication date: May 26, 2011
    Applicant: MICROSOFT CORPORATION
    Inventors: Joel Pothering, Jakub Oleksy, Ashvinkumar J. Sanghvi, Pratibha Mallya, Murat Ersan, Bogdan Berce
  • Publication number: 20080201465
    Abstract: A remote server managing multiple client computers at a customer site communicates with a server at a service provider site. A proxy gateway at the remote server allows communications through a network to the server at the service provider site. Remote monitoring of the multiple client computers may be performed at the server at the service provider site through a central monitoring console.
    Type: Application
    Filed: February 16, 2007
    Publication date: August 21, 2008
    Applicant: Microsoft Corporation
    Inventors: Dustin Jones, Tom Keane, Lorenzo Rizzi, Ian Jirka, Ferit Findik, Murat Ersan, Jakub Oleksy, Lee H. Chang, Vitaly Voloshin, Nadir Ahmed, Sandy Phadke, Anandha Ganesan, Joel Pothering