Microsoft Technology Licensing, LLC

Oivind Wang

Nicolai Bodd

Dmitriy Meyerzon

Victor Poznanski

Vladimir Tankovich

Fredrik Holm

Torbjorn Helvik

Chen Xing

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.

Ranking enterprise graph queries

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.

Re-ranking search results

Growing community of inventors

Oslo, Norway

Oivind Wang