公开(公告)号：US20090182706A1

公开(公告)日：2009-07-16

申请号：US12015392

申请日：2008-01-16

Applicant: Christopher Olston ,  Utkarsh Srivastava

Inventor： Christopher Olston ,  Utkarsh Srivastava

IPC: G06F17/30

CPC classification number: G06F17/30442

Abstract: Computer-implemented methods, modules and clients relate to expanded, pruned sample table for testing database queries against a base table. The expanded, pruned sample table is formed from the base table by a process of initial sampling, synthesis, and pruning.

Abstract translation: 计算机实现的方法，模块和客户端与扩展的，已修剪的示例表相关，用于根据基表测试数据库查询。 通过初始采样，合成和修剪的过程，从基表形成扩展的修剪的样本表。

公开(公告)号：US20090089313A1

公开(公告)日：2009-04-02

申请号：US11863902

申请日：2007-09-28

Applicant: Brian Cooper ,  Daniel Weaver ,  Michael Bigby ,  Utkarsh Srivastava ,  Philip L. Bohannon ,  Ramana Yerneni

Inventor： Brian Cooper ,  Daniel Weaver ,  Michael Bigby ,  Utkarsh Srivastava ,  Philip L. Bohannon ,  Ramana Yerneni

IPC: G06F17/30

CPC classification number: G06F17/30306

Abstract: A technique is described that reduces the complexity and resource consumption associated with performing record expiry in a distributed database system. In accordance with the technique, a record is checked to see if it has expired only when it has been accessed for a read or a write. If at the time of a read a record is determined to have expired, then it is not served. If at the time of a write a record is determined to have expired, then the write is treated as an insertion of a new record, and steps are taken to treat the insertion consistently with regard to the previous expired version. A background process is used to delete records that have not been written to or actively deleted by a client after expiration.

Abstract translation: 描述了一种降低与在分布式数据库系统中执行记录到期相关联的复杂性和资源消耗的技术。 根据该技术，检查记录以查看它是否仅在已被访问以进行读取或写入时才过期。 如果在阅读时确定记录已经过期，则不会提供记录。 如果在写入时确定记录已经过期，则写入被视为新记录的插入，并且采取步骤以一致的方式对先前的过期版本进行处理。 使用后台进程来删除客户端到期后尚未写入或主动删除的记录。

公开(公告)号：US07512574B2

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

申请号：US11239044

申请日：2005-09-30

Applicant: Peter Jay Haas ,  Volker Gerhard Markl ,  Nimrod Megiddo ,  Utkarsh Srivastava

Inventor： Peter Jay Haas ,  Volker Gerhard Markl ,  Nimrod Megiddo ,  Utkarsh Srivastava

IPC: G06E1/00 ,  G06E3/00 ,  G06F15/18 ,  G06G7/00

CPC classification number: G06F17/30536

Abstract: 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.

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

公开(公告)号：US20080114759A1

公开(公告)日：2008-05-15

申请号：US11750512

申请日：2007-05-18

Applicant: Sihem Amer Yahia ,  Jayavel Shanmugasundaram ,  Utkarsh Srivastava ,  Erik Vee

Inventor： Sihem Amer Yahia ,  Jayavel Shanmugasundaram ,  Utkarsh Srivastava ,  Erik Vee

IPC: G06F17/30

CPC classification number: G06Q30/02

Abstract: 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.

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

公开(公告)号：US20070078808A1

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

申请号：US11239044

申请日：2005-09-30

Applicant: Peter Haas ,  Volker Markl ,  Nimrod Megiddo ,  Utkarsh Srivastava

Inventor： Peter Haas ,  Volker Markl ,  Nimrod Megiddo ,  Utkarsh Srivastava

IPC: G06F17/30

CPC classification number: G06F17/30536

Abstract: 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.

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

公开(公告)号：US20170127318A1

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

申请号：US14926800

申请日：2015-10-29

Applicant: Anupam Kumar Goel ,  Utkarsh Srivastava

Inventor： Anupam Kumar Goel ,  Utkarsh Srivastava

IPC: H04W28/12 ,  H04W28/20

CPC classification number: H04W28/0273 ,  H04L47/245 ,  H04W28/0226 ,  H04W28/0278

Abstract: A method, an apparatus, a computer-program product, and a system for determining bandwidth for transmission of data packets are disclosed. A data packet in a plurality of data packets is received. An amount of bandwidth required for transmission of the received data packet is determined. The amount of bandwidth is a portion of a total available bandwidth for a radio link. At least one condition associated with the radio link for transmitting the received data packet to a user device is determined. Based on the determined amount of bandwidth and the determined condition, the received data packet is transmitted to the user device. Another data packet in the plurality of data packets is transmitted using another portion of the total available bandwidth.

公开(公告)号：US08682895B1

公开(公告)日：2014-03-25

申请号：US13433217

申请日：2012-03-28

Applicant: Ashish Goel ,  Srinivasan Rajgopal ,  Utkarsh Srivastava ,  Anamitra Banerji

Inventor： Ashish Goel ,  Srinivasan Rajgopal ,  Utkarsh Srivastava ,  Anamitra Banerji

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30598 ,  G06F17/30309 ,  G06F17/30345 ,  G06F17/30353 ,  G06F17/30433 ,  G06F17/30469 ,  G06F17/3053 ,  G06F17/30705 ,  G06Q10/10 ,  H04L51/04 ,  H04L51/12

Abstract: A real-time messaging platform and method is disclosed which classifies messages in accordance with a combination of user engagement events as modified to reflect the temporal structure of the user engagement events. A message can be assigned a metric based, for example, on a weighted combination of user engagement rates, decayed with time to reflect an intuition that recent interactions by one or more users with the message will have a greater impact than older interactions with the message. Different types of interaction by one or more users with the message can be assigned different weights when the different engagement events are combined and, also, can be assigned different temporal characteristics.

Abstract translation: 公开了一种实时消息平台和方法，其根据经修改的用户参与事件的组合对消息进行分类以反映用户参与事件的时间结构。 消息可以被分配一个度量，例如，基于用户参与率的加权组合，随着时间的推移而衰减，以反映一个直觉，一个或多个使用该消息的一个或多个用户的最近交互将具有比与该消息的老的交互更大的影响 。 具有消息的一个或多个用户的不同类型的交互可以在组合不同的参与事件时分配不同的权重，并且还可以被分配不同的时间特征。

公开(公告)号：US08051068B2

公开(公告)日：2011-11-01

申请号：US12106986

申请日：2008-04-21

Applicant: Benjamin C. Reed ,  Philip Bohannon ,  Utkarsh Srivastava ,  Daniel Meredith

Inventor： Benjamin C. Reed ,  Philip Bohannon ,  Utkarsh Srivastava ,  Daniel Meredith

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30716

Abstract: 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.

Abstract translation: 本文描述了支持文档存储库的用户基于路径探索的技术。 在一个实施例中，接收指定跟踪的跟踪定义数据。 路线包括一系列航路点，包括路口，中途航点和一个或多个后方。 在一些实施方案中，也可以在试验中限定死液。 一系列航路点的一个特定航点被确定为目前的航点。 可以从用户接收搜索项以使搜索被执行。 然后，确定搜索是否满足与在有序路段中的当前航路点紧密相关的航路点相关联的匹配准则。 如果是这样，用户进入下一个航点。 否则，用户将保持当前的航点。 最后，如果达到了一个尾迹，那么可以执行诸如以某种方式奖励用户的动作。

公开(公告)号：US07783607B2

公开(公告)日：2010-08-24

申请号：US11863902

申请日：2007-09-28

Applicant: Brian Cooper ,  Daniel Weaver ,  Michael Bigby ,  Utkarsh Srivastava ,  Philip L. Bohannon ,  Ramana Yerneni

Inventor： Brian Cooper ,  Daniel Weaver ,  Michael Bigby ,  Utkarsh Srivastava ,  Philip L. Bohannon ,  Ramana Yerneni

IPC: G06F17/30

CPC classification number: G06F17/30306

Abstract: A technique is described that reduces the complexity and resource consumption associated with performing record expiry in a distributed database system. In accordance with the technique, a record is checked to see if it has expired only when it has been accessed for a read or a write. If at the time of a read a record is determined to have expired, then it is not served. If at the time of a write a record is determined to have expired, then the write is treated as an insertion of a new record, and steps are taken to treat the insertion consistently with regard to the previous expired version. A background process is used to delete records that have not been written to or actively deleted by a client after expiration.

Abstract translation: 描述了一种降低与在分布式数据库系统中执行记录到期相关联的复杂性和资源消耗的技术。 根据该技术，检查记录以查看它是否仅在已被访问以进行读取或写入时才过期。 如果在阅读时确定记录已经过期，则不会提供记录。 如果在写入时确定记录已经过期，则写入被视为新记录的插入，并且采取步骤以一致的方式对先前的过期版本进行处理。 使用后台进程来删除客户端到期后尚未写入或主动删除的记录。

公开(公告)号：US20100174863A1

公开(公告)日：2010-07-08

申请号：US12724260

申请日：2010-03-15

Applicant: Brian F. Cooper ,  Adam Silberstein ,  Utkarsh Srivastava ,  Raghu Ramakrishnan ,  Rodrigo Fonseca

Inventor： Brian F. Cooper ,  Adam Silberstein ,  Utkarsh Srivastava ,  Raghu Ramakrishnan ,  Rodrigo Fonseca

IPC: G06F12/08 ,  G06F17/30

CPC classification number: G06F16/27

Abstract: A system is described for providing scalable in-memory caching for a distributed database. The system may include a cache, an interface, a non-volatile memory and a processor. The cache may store a cached copy of data items stored in the non-volatile memory. The interface may communicate with devices and a replication server. The non-volatile memory may store the data items. The processor may receive an update to a data item from a device to be applied to the non-volatile memory. The processor may apply the update to the cache. The processor may generate an acknowledgement indicating that the update was applied to the non-volatile memory and may communicate the acknowledgment to the device. The processor may then communicate the update to a replication server. The processor may apply the update to the non-volatile memory upon receiving an indication that the update was stored by the replication server.

Abstract translation: 描述了一种用于为分布式数据库提供可扩展的内存中缓存的系统。 该系统可以包括高速缓存，接口，非易失性存储器和处理器。 高速缓存可以存储存储在非易失性存储器中的数据项的缓存副本。 该接口可以与设备和复制服务器进行通信。 非易失性存储器可以存储数据项。 处理器可以从要应用于非易失性存储器的设备接收对数据项的更新。 处理器可以将更新应用于高速缓存。 处理器可以产生指示更新被应用于非易失性存储器并且可以将确认传送到设备的确认。 处理器然后可以将该更新传送到复制服务器。 当接收到由复制服务器存储更新的指示时，处理器可以将更新应用于非易失性存储器。