利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

20 条记录 (耗时 0.019 秒)

    Ontology-based graph query optimization
    4.
    发明授权
    Ontology-based graph query optimization 有权

    公开(公告)号：US11461318B2

    公开(公告)日：2022-10-04

    申请号：US15445228

    申请日：2017-02-28

    申请人： Microsoft Technology Licensing, LLC

    发明人： Tor Kreutzer ,  Amund Kronen Johansen ,  Steffen Viken Valvåg ,  Åge Kvalnes ,  Dag Eidesen ,  Peter Dahle Heen ,  Jan-Ove Karlberg ,  Daniele Vettorel

    IPC分类号： G06F16/2453 ,  G06F16/22 ,  G06F16/901 ,  G06F16/36

    摘要： Examples of the present disclosure describe systems and methods for ontology-based graph query optimization. In an example, ontology data relating to a graph or isolated collection may be collected. The ontology data may comprise uniqueness and topology information and may be used to reformulate a query in order to yield a query that is more performant than the original query when retrieving target information from a graph. In an example, reformulating a query may comprise reordering one or more parameters of the query relating to resources, relationships, and/or properties based on uniqueness information. In another example, the query may be reformulated by modifying the resource type to which the query is anchored based on the topology information. The reformulated query may then be executed to identify target information in the isolated collection, thereby identifying the same target information as the original query, but in a manner that is more performant.

    Query execution across multiple graphs
    9.
    发明授权
    Query execution across multiple graphs 有权

    公开(公告)号：US11874829B2

    公开(公告)日：2024-01-16

    申请号：US17532395

    申请日：2021-11-22

    申请人： Microsoft Technology Licensing, LLC

    发明人： Tor Kreutzer ,  Amund Kronen Johansen ,  Steffen Viken Valvåg ,  Åge Kvalnes ,  Jan-Ove Karlberg

    IPC分类号： G06F16/2453 ,  G06F16/901 ,  G06F16/2458

    CPC分类号： G06F16/24542 ,  G06F16/2471 ,  G06F16/9024

    摘要： Examples of the present disclosure describe systems and methods for query execution across multiple graphs. In an example, a graph or isolated collection may be split into multiple subparts, such that each subpart may store information of the isolated collection. Cross-collection reference resources may be used to reference resources that are stored by other isolated collection subparts. A breadth-first search of an isolated collection subpart may be performed in order to identify matches or potential matches in an isolated collection subpart. In an example, a potential match may comprise a cross-collection reference resource, which may reference a resource in another isolated collection subpart. Once query execution has completed in the isolated collection subpart, query execution may be paused and transferred to another isolated collection subpart that comprises a resource referenced by a cross-collection resource reference. Accordingly, query execution may resume in the subsequent isolated collection subpart.

    Recommendation of shared connections for display
    10.
    发明授权
    Recommendation of shared connections for display 有权

    公开(公告)号：US10572845B2

    公开(公告)日：2020-02-25

    申请号：US15631745

    申请日：2017-06-23

    申请人： Microsoft Technology Licensing, LLC

    发明人： Amund Kronen Johansen ,  Åge Kvalnes ,  Dag Eidesen ,  Tor Kreutzer ,  Steffen Viken Valvåg ,  Jan-Ove Karlberg

    IPC分类号： H04L29/06 ,  G06Q10/06 ,  H04L12/58 ,  G06Q50/10 ,  G06Q30/02 ,  G06F15/16 ,  G06F16/9537 ,  G06Q50/00

    摘要： In non-limiting examples of the present disclosure, systems, methods and devices for recommending a shared connection are presented. A set of shared connections between a first application user and a second application user may be identified. A determination may be made that a communication value between the first and second application users is below a recommendation surfacing threshold. A communication value between each application user of the set of shared connections and the first user may be calculated. A communication value between each application user of the set of shared connections and the second user may be calculated. One or both of the calculated communication values may be utilized to rank the shared connections based on importance to the first user, importance to the second user, and/or importance to the first user and the second user. One or more top ranked candidate user profiles may be promoted on a graphical user interface.