Patents by Inventor Nicolai Bodd
Nicolai Bodd 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: 11645289Abstract: A graph query is executed against a graph index that connects actors with objects through edges. A graph ranking model is obtained and results of the graph query are ranked, using the graph ranking model, based upon edge data available from edges in the graph that match the query.Type: GrantFiled: June 5, 2014Date of Patent: May 9, 2023Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Torbjorn Helvik, Chen Xing, Oivind Wang, Bard Kvalheim, Nicolai Bodd
-
Patent number: 11615098Abstract: A graph query is executed against a graph index that connects actors with objects through edges. A graph ranking model is obtained and results of the graph query are ranked, using the graph ranking model, based upon edge data available from edges in the graph that match the query.Type: GrantFiled: June 5, 2014Date of Patent: March 28, 2023Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Torbjorn Helvik, Chen Xing, Oivind Wang, Bard Kvalheim, Nicolai Bodd
-
Patent number: 10565273Abstract: This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.Type: GrantFiled: March 9, 2017Date of Patent: February 18, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Dmitriy Meyerzon, Mihai Petriuc, Nicolai Bodd
-
Publication number: 20170177733Abstract: This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.Type: ApplicationFiled: March 9, 2017Publication date: June 22, 2017Applicant: Microsoft Technology Licensing, LLCInventors: Dmitriy Meyerzon, Mihai Petriuc, Nicolai Bodd
-
Patent number: 9626440Abstract: This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.Type: GrantFiled: November 15, 2013Date of Patent: April 18, 2017Assignee: Microsoft Technology Licensing, LLCInventors: Dmitriy Meyerzon, Mihai Petriuc, Nicolai Bodd
-
Patent number: 9542440Abstract: Systems, methods, and software are disclosed herein for implementing enterprise graph search. In at least one implementation, an enterprise search service receives a search request that includes a graph query directed to an enterprise graph. The graph is representative of various objects and actors associated with an enterprise, as well as which of the actors performed which of various actions with respect to each of the various objects. The service searches at least a portion of the enterprise graph to identify a subset of the objects that relate to the actors as defined by the graph query in terms of at least the actors and actions. A reply to the search request may include graph results indicative of the subset of the objects.Type: GrantFiled: November 4, 2013Date of Patent: January 10, 2017Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Øivind Wang, Nicolai Bodd, Chen Xing, Bård Kvalheim, Torbjørn Helvik
-
Patent number: 9495462Abstract: Search results obtained from a ranking model are re-ranked based on user-configured ranking rules. For example, a user may desire to: place certain search results at a top/bottom of a ranking of search results; remove some search results; and/or adjust a ranking of some of the search results. A Graphical User Interface (GUI) allows a user to configure the ranking rules (e.g. enter key/value restrictions and to set a boost value) and to preview an application of one or more of the ranking rules. Query language operators that follow a standard operator syntax are created based on the inputs (e.g. a ranking query operator is created that may include multiple user supplied parameters). The user may also specify a portion of the results from which statistics (e.g. standard deviation, average score) are calculated. For example, a user may specify to calculate statistics for the top N number results.Type: GrantFiled: January 27, 2012Date of Patent: November 15, 2016Assignee: Microsoft Technology Licensing, LLCInventors: Victor Poznanski, Oivind Wang, Fredrik Holm, Nicolai Bodd, Vladimir Tankovich, Dmitriy Meyerzon
-
Publication number: 20150220531Abstract: A graph query is executed against a graph index that connects actors with objects through edges. A graph ranking model is obtained and results of the graph query are ranked, using the graph ranking model, based upon edge data available from edges in the graph that match the query.Type: ApplicationFiled: June 5, 2014Publication date: August 6, 2015Inventors: Torbjorn Helvik, Chen Xing, Oivind Wang, Bard Kvalheim, Nicolai Bodd
-
Publication number: 20150127677Abstract: Systems, methods, and software are disclosed herein for implementing enterprise graph search. In at least one implementation, an enterprise search service receives a search request that includes a graph query directed to an enterprise graph. The graph is representative of a various objects and actors associated with an enterprise, as well as which of the actors performed which of various actions with respect to each of the. The service searches at least a portion of the enterprise graph to identify a subset of the objects that relate to the actors as defined by the graph query in terms of at least the actors and actions. A reply to the search request may include graph results indicative of the subset of the objects.Type: ApplicationFiled: November 4, 2013Publication date: May 7, 2015Applicant: Microsoft CorporationInventors: Øivind Wang, Nicolai Bodd, Chen Xing, Bård Kvalheim, Torbjørn Helvik
-
Patent number: 8694507Abstract: This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.Type: GrantFiled: November 2, 2011Date of Patent: April 8, 2014Assignee: Microsoft CorporationInventors: Dmitriy Meyerzon, Mihai Petriuc, Nicolai Bodd
-
Publication number: 20140074881Abstract: This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.Type: ApplicationFiled: November 15, 2013Publication date: March 13, 2014Applicant: Microsoft CorporationInventors: Dmitriy Meyerzon, Mihai Petriuc, Nicolai Bodd
-
Publication number: 20140074811Abstract: Concepts and technologies are described herein for query ranking models. In accordance with the concepts and technologies disclosed herein, a search engine can be configured to expose a query ranking model object corresponding to a ranking function used by the search engine. A query application can be configured to obtain the query ranking model object and generate a query ranking model based upon the query ranking model object. The query ranking model can include one or more features and respective weights. The query application can generate a query and include data with the query identifying the query ranking model that is to be used to rank search results generated by the search engine. The query application also can be configured to manage query ranking models to allow creation, modification, and/or deletion of query ranking models as well as weights of features of the query ranking models.Type: ApplicationFiled: September 7, 2012Publication date: March 13, 2014Applicant: MICROSOFT CORPORATIONInventors: Øivind Wang, Nicolai Bodd, Rune Djurhuus
-
Publication number: 20130198174Abstract: Search results obtained from a ranking model are re-ranked based on user-configured ranking rules. For example, a user may desire to: place certain search results at a top/bottom of a ranking of search results; remove some search results; and/or adjust a ranking of some of the search results. A Graphical User Interface (GUI) allows a user to configure the ranking rules (e.g. enter key/value restrictions and to set a boost value) and to preview an application of one or more of the ranking rules. Query language operators that follow a standard operator syntax are created based on the inputs (e.g. a ranking query operator is created that may include multiple user supplied parameters). The user may also specify a portion of the results from which statistics (e.g. standard deviation, average score) are calculated. For example, a user may specify to calculate statistics for the top N number results.Type: ApplicationFiled: January 27, 2012Publication date: August 1, 2013Applicant: MICROSOFT CORPORATIONInventors: Victor Poznanski, Oivind Wang, Fredrik Holm, Nicolai Bodd, Vladimir Tankovich, Dmitriy Meyerzon
-
Publication number: 20130179418Abstract: Search ranking features are described that may be used by a search engine to rank items in a search result. Examples of such features include use of multiple linear ranking stages, use of BM25 and a full text index, use of a minimum span on ranking stages, pre-calculation of a plurality of ranking models, use of a dynamic rank, use of more than one BM25 definition per stage, date/time transformations, freshness transformations, raw value transformations, query property rank, social distance, and so on.Type: ApplicationFiled: January 6, 2012Publication date: July 11, 2013Applicant: MICROSOFT CORPORATIONInventors: Øivind Wang, Nicolai Bodd, Rune Djurhuus
-
Publication number: 20130110828Abstract: This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.Type: ApplicationFiled: November 2, 2011Publication date: May 2, 2013Applicant: Microsoft CorporationInventors: Dmitriy Meyerzon, Mihai Petriuc, Nicolai Bodd
-
Publication number: 20130024459Abstract: A method for creating a search index is disclosed. A plurality of words found in one or more documents is identified. For each word of the plurality of words, one or more fields of the one or more documents in which the word can be found is identified. Using a computing device, a search index is created for each word of the plurality of words. The search index for each word of the plurality of words provides a mapping between the word and each occurrence of the word in each field of the one or more documents in which the word is found.Type: ApplicationFiled: July 20, 2011Publication date: January 24, 2013Applicant: MICROSOFT CORPORATIONInventors: Nicolai Bodd, Evan Matthew Roark, Michael Susæg