Mechanisms for searching enterprise data graphs
    1.
    发明授权
    Mechanisms for searching enterprise data graphs 有权
    搜索企业数据图的机制

    公开(公告)号:US09171065B2

    公开(公告)日:2015-10-27

    申请号:US14222521

    申请日:2014-03-21

    CPC classification number: G06F17/30651 G06F17/30112 G06F17/30958

    Abstract: Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.

    Abstract translation: 从规范化数据有效地识别非结构化查询的高度相关的搜索结果。 服务器显示每个数据对象之间的关系。 对于每个搜索项,服务器识别映射到该术语的候选数据对象集合。 服务器至少部分地基于图形的链接分析中的一个或多个来计算候选数据对象的优先级分数; 或描述对候选数据对象的结构约束的元数据的分析。 基于该图,服务器识别一个或多个搜索结果子图,每个包括来自每个候选集的至少一个数据对象。 服务器按照候选数据对象的优先级得分的顺序查找子图。 服务器可以提前终止其搜索,部分原因是优先级候选数据对象增加了首先接收相关搜索结果的可能性。

    Displaying results of keyword search over enterprise data
    2.
    发明授权
    Displaying results of keyword search over enterprise data 有权
    显示企业数据关键字搜索结果

    公开(公告)号:US09015150B2

    公开(公告)日:2015-04-21

    申请号:US13923072

    申请日:2013-06-20

    CPC classification number: G06F17/30554 G06F17/30941

    Abstract: Techniques are disclosed for presenting semi-structured sets of search results comprising two or more differently-structured subsets of search results. The search results are divided into two or more groups of similarly-structured results. The search results are displayed in their respective groups rather than as a single set. Each group is displayed using a different display structure, in an order determined by a group ranking mechanism. The search results within a group ordered by a result ranking mechanism. Techniques are also disclosed for enhancing a display of similarly structured data by emphasizing highly relevant result fields. The highly relevant result fields may be identified based on metadata ranking mechanisms, uniqueness of their constituent values, historical feedback, keyword location, and/or other mechanisms. The fields are emphasized using, without limitation, highlighting, reordering, and filtering of unemphasized fields from the display.

    Abstract translation: 公开了用于呈现包括搜索结果的两个或多个不同结构的子集的搜索结果的半结构化集合的技术。 搜索结果分为两组或多组相似结构的结果。 搜索结果显示在它们各自的组中而不是单个集合中。 使用不同的显示结构显示每个组,按照组排名机制确定的顺序。 由结果排序机制排序的组内的搜索结果。 还公开了通过强调高度相关的结果字段来增强类似结构化数据的显示的技术。 高度相关的结果字段可以基于元数据排名机制,其组成值的唯一性,历史反馈,关键词位置和/或其他机制来识别。 使用而不是限制从显示中突出显示,重新排序和过滤未强调的字段来强调这些字段。

    MECHANISMS FOR SEARCHING ENTERPRISE DATA GRAPHS
    3.
    发明申请
    MECHANISMS FOR SEARCHING ENTERPRISE DATA GRAPHS 有权
    搜索企业数据图的机制

    公开(公告)号:US20140207802A1

    公开(公告)日:2014-07-24

    申请号:US14222521

    申请日:2014-03-21

    CPC classification number: G06F17/30651 G06F17/30112 G06F17/30958

    Abstract: Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.

    Abstract translation: 从规范化数据有效地识别非结构化查询的高度相关的搜索结果。 服务器显示每个数据对象之间的关系。 对于每个搜索项,服务器识别映射到该术语的候选数据对象集合。 服务器至少部分地基于图形的链接分析中的一个或多个来计算候选数据对象的优先级分数; 或描述对候选数据对象的结构约束的元数据的分析。 基于该图,服务器识别一个或多个搜索结果子图,每个包括来自每个候选集的至少一个数据对象。 服务器按照候选数据对象的优先级得分的顺序查找子图。 服务器可以提前终止其搜索,部分原因是优先级候选数据对象增加了首先接收相关搜索结果的可能性。

    DISPLAYING RESULTS OF KEYWORD SEARCH OVER ENTERPRISE DATA
    4.
    发明申请
    DISPLAYING RESULTS OF KEYWORD SEARCH OVER ENTERPRISE DATA 有权
    显示企业数据中关键字搜索的结果

    公开(公告)号:US20130282710A1

    公开(公告)日:2013-10-24

    申请号:US13923072

    申请日:2013-06-20

    CPC classification number: G06F17/30554 G06F17/30941

    Abstract: Techniques are disclosed for presenting semi-structured sets of search results comprising two or more differently-structured subsets of search results. The search results are divided into two or more groups of similarly-structured results. The search results are displayed in their respective groups rather than as a single set. Each group is displayed using a different display structure, in an order determined by a group ranking mechanism. The search results within a group ordered by a result ranking mechanism. Techniques are also disclosed for enhancing a display of similarly structured data by emphasizing highly relevant result fields. The highly relevant result fields may be identified based on metadata ranking mechanisms, uniqueness of their constituent values, historical feedback, keyword location, and/or other mechanisms. The fields are emphasized using, without limitation, highlighting, reordering, and filtering of unemphasized fields from the display.

    Abstract translation: 公开了用于呈现包括搜索结果的两个或多个不同结构的子集的搜索结果的半结构化集合的技术。 搜索结果分为两组或多组相似结构的结果。 搜索结果显示在它们各自的组中而不是单个集合中。 使用不同的显示结构显示每个组,按照组排名机制确定的顺序。 由结果排序机制排序的组内的搜索结果。 还公开了通过强调高度相关的结果字段来增强类似结构化数据的显示的技术。 高度相关的结果字段可以基于元数据排名机制,其组成值的唯一性,历史反馈,关键词位置和/或其他机制来识别。 使用而不是限制从显示中突出显示,重新排序和过滤未强调的字段来强调这些字段。

Patent Agency Ranking