Patents by Inventor Brian S. Aust
Brian S. Aust 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: 9275146Abstract: Semantic queries are expressed and executed within a relational database. This can be done by defining semantic rules applied to execute the semantic queries using table valued functions and common table expressions, and then simply calling the defined table valued functions to execute the queries.Type: GrantFiled: May 15, 2012Date of Patent: March 1, 2016Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Stuart M. Bowers, Thomas E. Jackson, Chris Demetrios Karkanias, Allen L. Brown, David G. Campbell, Brian S. Aust
-
Patent number: 8751433Abstract: A semantic reasoning engine is described for performing probabilistic reasoning over a semantic graph in a time-efficient and viable manner. The semantic reasoning engine includes a data store that provides the semantic graph, where the semantic graph is formed by a plurality of concepts connected together via probabilistic assertions. The semantic reasoning engine operates by providing an answer to a query by recursively collapsing the semantic graph based on at least one collapsing rule.Type: GrantFiled: December 15, 2010Date of Patent: June 10, 2014Assignee: Microsoft CorporationInventors: Stuart M. Bowers, Thomas E. Jackson, Silvia C. Vega, Chris D. Karkanias, Allen L. Brown, Jr., David G. Campbell, Brian S. Aust
-
Patent number: 8695005Abstract: The described method/system/apparatus uses intelligence to better allocate tasks/work items among the processors and computers in the cloud. A priority score may be calculated for each task/work unit for each specific processor. The priority score may indicate how well suited a task/work item is for a processor. The result is that tasks/work items may be more efficiently executed by being assigned to processors in the cloud that are better prepared to execute the tasks/work items.Type: GrantFiled: December 22, 2010Date of Patent: April 8, 2014Assignee: Microsoft CorporationInventors: Stuart M. Bowers, Brandon T. Hunt, Thomas E. Jackson, Chris Demetrios Karkanias, Brian S. Aust
-
Patent number: 8484233Abstract: Described is a technology for composing queries by user interaction with objects and facets. A facet-based user interface allows users to select facets for use as filtering criteria, and a logic-based user interface allows users to logically combine object data. Query logic that processes the filtering criteria and/or logically combines the object data into a query. The facet-based user interface and logic-based user interface may be accessed via a unified user interface. The unified user interface may also provide a text editor for composing a text-based query.Type: GrantFiled: June 13, 2009Date of Patent: July 9, 2013Assignee: Microsoft CorporationInventors: Yin Xie, Sonia Patricia Carlson, Brian S. Aust, Oscar G. Naim, Chris D. Karkanias, George G. Robertson
-
Patent number: 8335836Abstract: Implementing a consistent user name-space on networked computing devices includes various components and methods. When a network connection between a local or host computing device and one or more remote computing devices is present, remote items are represented using the same methodology as items located on the host computing device. To the user, remote and local items are indistinguishable. When the network connection is lost or items located on a remote computer are otherwise unavailable, the unavailable items remain represented on the host computing device. Unavailable items are represented in a way that informs the user that the items may not be fully accessed.Type: GrantFiled: January 30, 2012Date of Patent: December 18, 2012Assignee: Microsoft CorporationInventors: Brian S Aust, David G. De Vorchik, Yun Lin, Timothy P McKee, Jason F. Moore, Shishir Pardikar, Mohammed Samji, David C Steere, Navjot Virk
-
Publication number: 20120226710Abstract: Semantic queries are expressed and executed within a relational database. This can be done by defining semantic rules applied to execute the semantic queries using table valued functions and common table expressions, and then simply calling the defined table valued functions to execute the queries.Type: ApplicationFiled: May 15, 2012Publication date: September 6, 2012Applicant: MICROSOFT CORPORATIONInventors: Stuart M. Bowers, Thomas E. Jackson, Chris Demetrios Karkanias, Allen L. Brown, David G. Campbell, Brian S. Aust
-
Publication number: 20120167108Abstract: The described method/system/apparatus uses intelligence to better allocate tasks/work items among the processors and computers in the cloud. A priority score may be calculated for each task/work unit for each specific processor. The priority score may indicate how well suited a task/work item is for a processor. The result is that tasks/work items may be more efficiently executed by being assigned to processors in the cloud that are better prepared to execute the tasks/work items.Type: ApplicationFiled: December 22, 2010Publication date: June 28, 2012Applicant: MICROSOFT CORPORATIONInventors: Stuart M. Bowers, Brandon T. Hunt, Thomas E. Jackson, Chris Demetrios Karkanias, Brian S. Aust
-
Publication number: 20120166378Abstract: A method and system of using a forward chaining application on a computing device to monitor a semantic storage system and invoke computations on scientific data according to declarative rules, while capturing operational provenance data stored alongside the scientific data where all data is stored in a semantic graph is disclosed and described. As the provenance data is stored with the data as nodes in the semantic graph, it will stay with the data and may be searched and queried using the same methods as searching the underlying data.Type: ApplicationFiled: December 28, 2010Publication date: June 28, 2012Applicant: Microsoft CorporationInventors: Matthew David Valerio, Stuart M. Bowers, Thomas E. Jackson, Chris Demetrios Karkanias, Allen L. Brown, JR., Brian S. Aust
-
Publication number: 20120158636Abstract: A semantic reasoning engine is described for performing probabilistic reasoning over a semantic graph in a time-efficient and viable manner. The semantic reasoning engine includes a data store that provides the semantic graph, where the semantic graph is formed by a plurality of concepts connected together via probabilistic assertions. The semantic reasoning engine operates by providing an answer to a query by recursively collapsing the semantic graph based on at least one collapsing rule.Type: ApplicationFiled: December 15, 2010Publication date: June 21, 2012Applicant: MICROSOFT CORPORATIONInventors: Stuart M. Bowers, Thomas E. Jackson, Silvia C. Vega, Chris D. Karkanias, Allen L. Brown, JR., David G. Campbell, Brian S. Aust
-
Patent number: 8204903Abstract: Semantic queries are expressed and executed within a relational database. This can be done by defining semantic rules applied to execute the semantic queries using table valued functions and common table expressions, and then simply calling the defined table valued functions to execute the queries.Type: GrantFiled: February 16, 2010Date of Patent: June 19, 2012Assignee: Microsoft CorporationInventors: Stuart M. Bowers, Thomas E. Jackson, Chris Demetrios Karkanias, Allen L. Brown, David G. Campbell, Brian S. Aust
-
Publication number: 20120131128Abstract: Implementing a consistent user name-space on networked computing devices includes various components and methods. When a network connection between a local or host computing device and one or more remote computing devices is present, remote items are represented using the same methodology as items located on the host computing device. To the user, remote and local items are indistinguishable. When the network connection is lost or items located on a remote computer are otherwise unavailable, the unavailable items remain represented on the host computing device. Unavailable items are represented in a way that informs the user that the items may not be fully accessed.Type: ApplicationFiled: January 30, 2012Publication date: May 24, 2012Applicant: MICROSOFT CORPORATIONInventors: BRIAN S. AUST, DAVID G. DE VORCHIK, YUN LIN, TIMOTHY P. MCKEE, JASON F. MOORE, SHISHIR PARDIKAR, MOHAMMED SAMJI, DAVID C. STEERE, NAVJOT VIRK
-
Patent number: 8108483Abstract: A system and method for implementing a consistent user name-space on networked computing devices is provided. When a network connection between a local or host computing device and one or more remote computing devices is present, remote items are represented using the same methodology as items located on the host computing device. To the user, remote and local items are indistinguishable. When the network connection is lost or items located on a remote computer are otherwise unavailable, the unavailable items remain represented on the host computing device. Unavailable items are represented in a way that informs the user that the items may not be fully accessed.Type: GrantFiled: January 30, 2004Date of Patent: January 31, 2012Assignee: Microsoft CorporationInventors: Brian S. Aust, David G. De Vorchik, Yun Lin, Timothy P. McKee, Jason F. Moore, Shishir Pardikar, Mohammed Samji, David C. Steere, Navjot Virk
-
Publication number: 20110320431Abstract: Described herein is using type information with a graph of nodes and predicates, in which the type information may be used to determine validity of (type check) a query to be executed against the graph. In one aspect, each node has a type, and each predicate indicates a valid relationship between two types of nodes. A type checking mechanism uses the type information to determine whether a query is valid, which may be the entire query prior to query processing/compilation time, or as the query is being composed by a user. One or more valid predicates for a given node may be discovered based upon the node type, such as discovered to assist the user during query composition. Also described is using the type information to optimize the query.Type: ApplicationFiled: June 25, 2010Publication date: December 29, 2011Applicant: MICROSOFT CORPORATIONInventors: Thomas E. Jackson, Stuart M. Bowers, Brian S. Aust, Chris D. Karkanias, Allen L. Brown, JR., David G. Campbell
-
Publication number: 20110202560Abstract: Semantic queries are expressed and executed within a relational database. This can be done by defining semantic rules applied to execute the semantic queries using table valued functions and common table expressions, and then simply calling the defined table valued functions to execute the queries.Type: ApplicationFiled: February 16, 2010Publication date: August 18, 2011Applicant: Microsoft CorporationInventors: Stuart M. Bowers, Thomas E. Jackson, Chris Demetrios Karkanias, Allen L. Brown, David G. Campbell, Brian S. Aust
-
Publication number: 20100287220Abstract: Described is a technology, such as for representing scientific data and information, in which a database table contains rows of type data representing types, and term data representing terms that inhabit the types. Types include composite types (e.g., that represent entities), and instances of relation types that express relationships between types, between a type and a term, or between terms. Types and/or terms may have multiple relationships with one another, and a relationship may span database tables. A new relationship may be established by adding a new row to the database table to represent a new relation term, along with one or more similar rows to represent the relation role terms associated with that relation term; relationships may be removed by removing rows. As a result, the database table may change its state rapidly, without needing to change the database schema.Type: ApplicationFiled: May 5, 2009Publication date: November 11, 2010Applicant: Microsoft CorporationInventors: Brian S. Aust, Allen L. Brown, JR., Chris D. Karkanias, David G. Campbell
-
Publication number: 20100114931Abstract: Described is a technology for composing queries by user interaction with objects and facets. A facet-based user interface allows users to select facets for use as filtering criteria, and a logic-based user interface allows users to logically combine object data. Query logic that processes the filtering criteria and/or logically combines the object data into a query. The facet-based user interface and logic-based user interface may be accessed via a unified user interface. The unified user interface may also provide a text editor for composing a text-based query.Type: ApplicationFiled: June 13, 2009Publication date: May 6, 2010Applicant: Microsoft CorporationInventors: Yin Xie, Sonia Patricia Carlson, Brian S. Aust, Oscar G. Naim, Chris D. Karkanias, George G. Robertson
-
Patent number: 7702745Abstract: The present invention provides a novel client side caching (CSC) infrastructure that supports transition states at the directory level to facilitate a seamless operation across connectivity states between client and remote server. More specifically, persistent caching is performed to safeguard the user (e.g., client) and/or the client applications across connectivity interruptions and/or bandwidth changes. This is accomplished in part by caching to a client data store the desirable file(s) together with the appropriate file access parameters. Moreover, the client maintains access to cached files during periods of disconnect. Furthermore, portions of a path can be offline while other portions upstream can remain online. CSC operates on the logical path which cooperates with DFS which operates on the physical path to keep track of files cached, accessed and changes in the directories. In addition, truth on the client is facilitated whether or not a conflict of file copies exists.Type: GrantFiled: February 22, 2005Date of Patent: April 20, 2010Inventors: Yun Lin, Navjot Virk, Brian S. Aust, Shishir P. Pardikar, David C. Steere, Mohammed A. Samji
-
Patent number: 7698376Abstract: The present invention provides a novel client side caching (CSC) infrastructure that supports transition states at the directory level to facilitate a seamless operation across connectivity states between client and remote server. More specifically, persistent caching is performed to safeguard the user (e.g., client) and/or the client applications across connectivity interruptions and/or bandwidth changes. This is accomplished in part by caching to a client data store the desirable file(s) together with the appropriate file access parameters. Moreover, the client maintains access to cached files during periods of disconnect. Furthermore, portions of a path can be offline while other portions upstream can remain online. CSC operates on the logical path which cooperates with DFS which operates on the physical path to keep track of files cached, accessed and changes in the directories. In addition, truth on the client is facilitated whether or not a conflict of file copies exists.Type: GrantFiled: February 22, 2005Date of Patent: April 13, 2010Assignee: Microsoft CorporationInventors: Yun Lin, Navjot Virk, Brian S. Aust, Shishir P. Pardikar, David C. Steere, Mohammed A. Samji
-
Patent number: 7664788Abstract: Described is a system and method that synchronizes cached files and directories with a server's files and directories via a layered architecture, by collapsing state information into an index into a fixed set of known states, and looking up the action that synchronizes that state. The actions are then taken to synchronize the content. Any of fifty possible synchronization states are thus handled. A synchronization controller requests a subsystem to evaluate a local cache and remote file system to generate state flags for each item considered for synchronization. The synchronization controller processes the state information to identify a selected table from among a plurality of tables that contain the fifty values, and uses other flags to compute an index into the table. The selected table contains values that index into an action table containing actions that specify an operation set that is requested to synchronize the particular state scenario.Type: GrantFiled: January 10, 2005Date of Patent: February 16, 2010Assignee: Microsoft CorporationInventor: Brian S. Aust
-
Patent number: 7634514Abstract: Described is a system and method that facilitates fast and reliable synchronization of computer/file system directories. A synchronization (FastSync) subsystem operates in a discovery/enumeration phase to provide a calling client with a set of the differences between directories, and then operates in an action phase to perform operations as directed by the client to synchronize the different directories. The discovery/enumeration and action phases use parallel operation and I/O (input/output) pipelining. Multiple threads are used during enumeration to enumerate each directory's children, and enqueues each sub-directory to be handled by a new thread. During the action phase, when an operation is requested, the FastSync subsystem packages up the operation, item pointer, and context information into an internal context block and queues that packet as a work item for a process thread pool to handle.Type: GrantFiled: May 9, 2005Date of Patent: December 15, 2009Assignee: Microsoft CorporationInventors: Thomas A. Langan, Brian S. Aust, Navjot Virk