利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

31 条记录 (耗时 0.025 秒)

    Consistent histogram maintenance using query feedback
    1.
    发明申请
    Consistent histogram maintenance using query feedback 失效
    使用查询反馈进行一致的直方图维护

    公开(公告)号：US20070078808A1

    公开(公告)日：2007-04-05

    申请号：US11239044

    申请日：2005-09-30

    申请人： Peter Haas ,  Volker Markl ,  Nimrod Megiddo ,  Utkarsh Srivastava

    发明人： Peter Haas ,  Volker Markl ,  Nimrod Megiddo ,  Utkarsh Srivastava

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30536

    摘要： A novel method is employed for collecting optimizer statistics for optimizing database queries by gathering feedback from the query execution engine about the observed cardinality of predicates and constructing and maintaining multidimensional histograms. This makes use of the correlation between data columns without employing an inefficient data scan. The maximum entropy principle is used to approximate the true data distribution by a histogram distribution that is as “simple” as possible while being consistent with the observed predicate cardinalities. Changes in the underlying data are readily adapted to, automatically detecting and eliminating inconsistent feedback information in an efficient manner. The size of the histogram is controlled by retaining only the most “important” feedback.

    摘要翻译： 采用一种新颖的方法来收集优化器统计数据，以优化数据库查询，方法是从查询执行引擎收集有关观察到的谓词的基数并构建和维护多维直方图的反馈。 这使得利用数据列之间的相关性而不采用低效的数据扫描。 最大熵原理用于通过尽可能“简单”的直方图分布近似真实数据分布，同时与观察到的谓词基数一致。 底层数据的变化很容易适应于以有效的方式自动检测和消除不一致的反馈信息。 通过仅保留最重要的反馈来控制直方图的大小。

    Consistent histogram maintenance using query feedback
    2.
    发明授权
    Consistent histogram maintenance using query feedback 失效
    使用查询反馈进行一致的直方图维护

    公开(公告)号：US07512574B2

    公开(公告)日：2009-03-31

    申请号：US11239044

    申请日：2005-09-30

    申请人： Peter Jay Haas ,  Volker Gerhard Markl ,  Nimrod Megiddo ,  Utkarsh Srivastava

    发明人： Peter Jay Haas ,  Volker Gerhard Markl ,  Nimrod Megiddo ,  Utkarsh Srivastava

    IPC分类号： G06E1/00 ,  G06E3/00 ,  G06F15/18 ,  G06G7/00

    CPC分类号： G06F17/30536

    摘要： A novel method is employed for collecting optimizer statistics for optimizing database queries by gathering feedback from the query execution engine about the observed cardinality of predicates and constructing and maintaining multidimensional histograms. This makes use of the correlation between data columns without employing an inefficient data scan. The maximum entropy principle is used to approximate the true data distribution by a histogram distribution that is as “simple” as possible while being consistent with the observed predicate cardinalities. Changes in the underlying data are readily adapted to, automatically detecting and eliminating inconsistent feedback information in an efficient manner. The size of the histogram is controlled by retaining only the most “important” feedback.

    摘要翻译： 采用一种新颖的方法来收集优化器统计数据，以优化数据库查询，方法是从查询执行引擎收集有关观察到的谓词的基数并构建和维护多维直方图的反馈。 这使得利用数据列之间的相关性而不采用低效的数据扫描。 最大熵原理用于通过尽可能“简单”的直方图分布近似真实数据分布，同时与观察到的谓词基数一致。 底层数据的变化很容易适应于以有效的方式自动检测和消除不一致的反馈信息。 通过仅保留最重要的反馈来控制直方图的大小。

    TRAIL-BASED EXPLORATION OF A REPOSITORY OF DOCUMENTS
    3.
    发明申请
    TRAIL-BASED EXPLORATION OF A REPOSITORY OF DOCUMENTS 有权

    公开(公告)号：US20090265337A1

    公开(公告)日：2009-10-22

    申请号：US12117443

    申请日：2008-05-08

    申请人： Benjamin C. Reed ,  Philip Bohannon ,  Utkarsh Srivastava ,  Daniel Meredith

    发明人： Benjamin C. Reed ,  Philip Bohannon ,  Utkarsh Srivastava ,  Daniel Meredith

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30716

    摘要： Techniques that support trail-based exploration by a user of a repository of documents are described herein. In one embodiment, trail definition data that specifies a trail is received. The trail includes an ordered series of waypoints including a trailhead, intermediate waypoints, and one or more trailends. In some embodiments, deadends may also be defined in the trial. A particular waypoint in the ordered series of waypoints is established as a current waypoint. Search terms can be received from a user to cause a search to be performed. It is then determined whether the search satisfies matching criteria associated with a waypoint that immediately follows the current waypoint in the ordered series of waypoints. If so, the user advances to the next waypoint. Otherwise, the user remains at the current waypoint. Finally, if a trailend is reached, then an action such as rewarding the user in some way may be performed.

    Deriving user intent from a user query
    4.
    发明授权
    Deriving user intent from a user query 有权
    从用户查询中导出用户意图

    公开(公告)号：US07974976B2

    公开(公告)日：2011-07-05

    申请号：US11750512

    申请日：2007-05-18

    申请人： Sihem Amer Yahia ,  Jayavel Shanmugasundaram ,  Utkarsh Srivastava ,  Erik Vee

    发明人： Sihem Amer Yahia ,  Jayavel Shanmugasundaram ,  Utkarsh Srivastava ,  Erik Vee

    IPC分类号： G06F17/30

    CPC分类号： G06Q30/02

    摘要： A system and method for deriving user intent from a query. The system includes a query engine, and an advertisement engine. The query engine receives a query from the user. The query engine analyzes the query to determine a query intent that is matched to a domain. The query may be further analyzed to derive predicate values based on the query and the domain hierarchy. The domain and associated information may then be matched to a list of advertisements. The advertisement may be assigned an ad match score based on a correlation between the query information and various listing information provided in the advertisement.

    摘要翻译： 用于从查询中导出用户意图的系统和方法。 该系统包括查询引擎和广告引擎。 查询引擎从用户接收查询。 查询引擎分析查询以确定与域匹配的查询意图。 可以进一步分析查询以基于查询和域层次结构导出谓词值。 然后可以将域和相关联的信息与广告列表进行匹配。 可以基于查询信息和广告中提供的各种列表信息之间的相关性，向广告分配广告匹配分数。

    EFFICIENT ONLINE COMPUTATION OF DIVERSE QUERY RESULTS
    7.
    发明申请
    EFFICIENT ONLINE COMPUTATION OF DIVERSE QUERY RESULTS 有权
    有效的在线计算多个查询结果

    公开(公告)号：US20080288480A1

    公开(公告)日：2008-11-20

    申请号：US11750871

    申请日：2007-05-18

    申请人： Sihem Amer Yahia ,  Jayavel Shanmugasundaram ,  Utkarsh Srivastava ,  Erik Vee ,  Prashanth Bhat

    发明人： Sihem Amer Yahia ,  Jayavel Shanmugasundaram ,  Utkarsh Srivastava ,  Erik Vee ,  Prashanth Bhat

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30864 ,  G06Q30/02

    摘要： The system includes a query engine and an advertisement engine. The query engine is configured to receive a query from the user. The advertisement engine generates advertisement results corresponding to the query. The advertisement results are selected from entries in an advertisement database, where the entries include predicate values corresponding to a domain. The advertisement engine generates a diverse advertisement result that is a subset of the database entries that match the query. The diversity result varies at least one predicate by selecting entries for the list that include a proportional representation of each available predicate value in the database that matches the query.

    摘要翻译： 该系统包括查询引擎和广告引擎。 查询引擎被配置为从用户接收查询。 广告引擎生成对应于查询的广告结果。 广告结果从广告数据库中的条目中选择，其中条目包括对应于域的谓词值。 广告引擎生成不同的广告结果，该结果是与查询匹配的数据库条目的子集。 多样性结果通过选择列表的条目来改变至少一个谓词，该条目包括与查询匹配的数据库中每个可用谓词值的比例表示。

    METHOD AND SYSTEM FOR GENERATING AN ORDERED LIST
    8.
    发明申请
    METHOD AND SYSTEM FOR GENERATING AN ORDERED LIST 审中-公开
    用于生成订单的方法和系统

    公开(公告)号：US20080256037A1

    公开(公告)日：2008-10-16

    申请号：US11734300

    申请日：2007-04-12

    申请人： Sihem Amer Yahia ,  Lin Guo ,  Raghu Ramakrishnan ,  Jayavel Shanmugasundaram ,  Utkarsh Srivastava ,  Andrew Tomkins ,  Erik Vee

    发明人： Sihem Amer Yahia ,  Lin Guo ,  Raghu Ramakrishnan ,  Jayavel Shanmugasundaram ,  Utkarsh Srivastava ,  Andrew Tomkins ,  Erik Vee

    IPC分类号： G06F17/30

    CPC分类号： G06Q30/02

    摘要： A system for generating an ordered list. The system may include a query engine and an advertisement engine. The query engine receives a query from the user and determines parameters to match with the advertisement. The advertisement engine receives the parameters and generates a list of items based on the parameters. The system may function in a precompute mode to calculate intervals for each available item to minimize the variable processing costs for each item. Further, the number of intervals a crossed item may be selected in a manner to satisfy a given space constraint. By characterizing each item by a minimum price within each interval, the system can quickly query the interval matching the desired quantity for each item and determined if the minimum price for that interval is less than the top-k prices already included in the list.

    摘要翻译： 用于生成有序列表的系统。 该系统可以包括查询引擎和广告引擎。 查询引擎从用户接收查询并确定与广告匹配的参数。 广告引擎接收参数，并根据参数生成项目列表。 系统可以在预计算模式下运行，以计算每个可用项目的间隔，以最小化每个项目的可变处理成本。 此外，可以以满足给定空间约束的方式来选择交叉项目的间隔数。 通过在每个间隔内以最小价格表征每个项目，系统可以快速地查询与每个项目匹配期望数量的间隔，并确定该间隔的最小价格是否小于列表中已包含的顶部k价格。