公开(公告)号：US20090210428A1

公开(公告)日：2009-08-20

申请号：US12070604

申请日：2008-02-19

Applicant: Brian Cooper ,  Utkarsh Srivastava ,  Ramana V. Yerneni

Inventor： Brian Cooper ,  Utkarsh Srivastava ,  Ramana V. Yerneni

IPC: G06F17/30

CPC classification number: G06F17/30578

Abstract: An improved system and method for writing data dependent upon multiple reads in a distributed database is provided. A client may read several data records and may then send a request to a database server to perform a transaction to write a data record dependent upon multiple data records read. A database server may receive the request specifying a transaction to write a data record dependent upon multiple data records read and may perform the transaction by latching a master data record to be written and validating the data records the write depends upon. The multiple data records upon which the write depends may be validated by verifying the multiple data records are current versions of the data records stored in the distributed database. Data intensive applications may use this transaction type in large scale distributed database systems to provide stronger consistency without significantly degrading performance and scalability.

Abstract translation: 提供了一种根据分布式数据库中的多次读取来写入数据的改进的系统和方法。 客户端可以读取几个数据记录，然后可以向数据库服务器发送一个请求，以便执行一个交易来写数据记录，这取决于读取的多个数据记录。 数据库服务器可以接收指定交易的请求，以依据读取的多个数据记录来写入数据记录，并且可以通过锁存要写入的主数据记录来执行交易，并验证写依赖的数据记录。 可以通过验证多个数据记录来验证写入所依赖的多个数据记录是存储在分布式数据库中的数据记录的当前版本。 数据密集型应用程序可以在大规模分布式数据库系统中使用此事务类型，以提供更强的一致性，而不会显着降低性能和可扩展性。

公开(公告)号：US20090204593A1

公开(公告)日：2009-08-13

申请号：US12069486

申请日：2008-02-11

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

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

IPC: G06F7/06 ,  G06F17/30

CPC classification number: G06F16/27

Abstract: An improved system and method for parallel retrieval of data from a distributed database is provided. A parallel interface may be provided for use by a cluster of client machine for parallel retrieval of partial results from parallel execution of a database query by a cluster of database servers storing a distributed database. A query interface may be augmented for inputting a database query and specifying the number of instances of parallel retrieval of results from query execution. To do so, a commercial query language may be augmented for sending a query request that may include a parameter specifying the database query and an additional parameter specifying the desired retrieval parallelism. The augmented query interface may return a list of retrieval point addresses for retrieving the partial results assigned to each of the retrieval point addresses from parallel execution of the database query.

Abstract translation: 提供了一种用于从分布式数据库并行检索数据的改进的系统和方法。 可以提供并行接口以供由客户机集群使用，以通过存储分布式数据库的数据库服务器的并行执行数据库查询来并行检索部分结果。 可以增加用于输入数据库查询并且从查询执行指定结果并行检索的实例的数量的查询接口。 为此，可以增加商业查询语言以发送可以包括指定数据库查询的参数的查询请求以及指定所需检索并行性的附加参数。 增强查询界面可以返回用于从数据库查询的并行执行中检索分配给每个检索点地址的部分结果的检索点地址的列表。

公开(公告)号：US20090157762A1

公开(公告)日：2009-06-18

申请号：US11957132

申请日：2007-12-14

Applicant: Ramana V. Yerneni ,  Michael Bigby ,  Philip Bohannon ,  Bryan Call ,  Brian Cooper ,  Andrew Feng ,  David Lomax ,  Raghu Ramakrishnan ,  Utkarsh Srivastava ,  Daniel Weaver

Inventor： Ramana V. Yerneni ,  Michael Bigby ,  Philip Bohannon ,  Bryan Call ,  Brian Cooper ,  Andrew Feng ,  David Lomax ,  Raghu Ramakrishnan ,  Utkarsh Srivastava ,  Daniel Weaver

IPC: G06F12/00

CPC classification number: G06F17/30578

Abstract: Methods and apparatuses are provided for dynamically reorganizing the data within a replicated database system. One method, for example, includes performing a split operation across a plurality of replicated databases with regard to an existing partition therein, wherein the existing partition comprises a plurality of data records and the two new partitions each include at least a portion of the plurality of data records, and allowing at least one type of access to the plurality of data records during the split operation.

Abstract translation: 提供了用于在复制的数据库系统内动态重组数据的方法和装置。 一种方法，例如，包括针对其中的现有分区跨多个复制数据库执行分割操作，其中现有分区包括多个数据记录，并且两个新分区各自包括多个数据记录的至少一部分 数据记录，并且允许在拆分操作期间对多个数据记录的至少一种类型的访问。

公开(公告)号：US08893131B2

公开(公告)日：2014-11-18

申请号：US12101443

申请日：2008-04-11

Applicant: Raghu Ramakrishnan ,  Erik Vee ,  Ramana Yerneni ,  Utkarsh Srivastava ,  Brian Frank Cooper ,  Adam Silberstein

Inventor： Raghu Ramakrishnan ,  Erik Vee ,  Ramana Yerneni ,  Utkarsh Srivastava ,  Brian Frank Cooper ,  Adam Silberstein

IPC: G06F9/46 ,  G06F15/16 ,  G06F7/00 ,  G06F17/30 ,  G06F9/50

CPC classification number: G06F17/30339 ,  G06F9/505 ,  G06F9/5083

Abstract: In a large-scale transaction such as the bulk loading of new records into an ordered, distributed database, a transaction limit such as an insert limit may be chosen, partitions on overfull storage servers may be designated to be moved to underfull storage servers, and the move assignments may be based, at least in part on the degree to which a storage server is underfull and the move and insertion costs of the partitions to be moved.

Abstract translation: 在大规模交易中，例如将新记录批量加载到有序的分布式数据库中，可以选择诸如插入限制的交易限制，可以指定过度存储服务器上的分区被移动到不充分的存储服务器，以及 移动分配可以至少部分地基于存储服务器欠充电的程度以及要移动的分区的移动和插入成本。

公开(公告)号：US20100131545A1

公开(公告)日：2010-05-27

申请号：US12324453

申请日：2008-11-26

Applicant: Utkarsh Srivastava ,  Arvind Thiagarajan

Inventor： Utkarsh Srivastava ,  Arvind Thiagarajan

IPC: G06F17/30

CPC classification number: G06F17/30575

Abstract: The subject matter disclosed herein relates to distribution data items within geographically distributed databases.

Abstract translation: 本文公开的主题涉及地理上分布的数据库内的分发数据项。

公开(公告)号：US20090265347A1

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

申请号：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: G06F17/30 ,  G06F3/048

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

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