公开(公告)号：US20090210429A1

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

申请号：US12070607

申请日：2008-02-19

申请人： Parag Agrawal ,  Brian Cooper ,  Raghu Ramakrishnan ,  Utkarsh Srivastava ,  Ramana V. Yerneni

发明人： Parag Agrawal ,  Brian Cooper ,  Raghu Ramakrishnan ,  Utkarsh Srivastava ,  Ramana V. Yerneni

IPC分类号： G06F17/30

CPC分类号： G06F16/273

摘要： An improved system and method for asynchronous update of indexes in a distributed database is provided. A database server may receive the request to update the data and may update the data in a primary data table of the distributed database. An asynchronous index update of the indexes may be initiated at the time a record is updated in a data table and then control may be returned to a client to perform another data update. An activity cache may be provided for caching the records updated by a client so that when the client requests a subsequent read, the updated records may be available in the activity cache to support the various guarantees for reading the data. Advantageously, the asynchronous index update scheme may provide increased performance and more scalability while efficiently maintaining indexes over database tables in a large scale, replicated, distributed database.

摘要翻译： 提供了一种用于在分布式数据库中异步更新索引的改进的系统和方法。 数据库服务器可以接收更新数据的请求，并且可以更新分布式数据库的主数据表中的数据。 可以在数据表中更新记录时启动索引的异步索引更新，然后可以将控制返回给客户端以执行另一数据更新。 可以提供活动缓存来缓存由客户端更新的记录，使得当客户端请求后续读取时，更新的记录可以在活动高速缓存中可用以支持读取数据的各种保证。 有利地，异步索引更新方案可以提供增加的性能和更大的可扩展性，同时有效地维护大规模，复制的分布式数据库中的数据库表的索引。

公开(公告)号：US20090216718A1

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

申请号：US12036956

申请日：2008-02-25

申请人： Parag Agrawal ,  Daniel Kifer ,  Chris Olston

发明人： Parag Agrawal ,  Daniel Kifer ,  Chris Olston

IPC分类号： G06F7/06

CPC分类号： G06F17/30442 ,  G06F17/30474

摘要： A system of query scheduling to maximize work sharing. The system schedules queries to account for future queries possessing a sharability component. Included in the system are operations for assigning an incoming query to a query queue based on a sharability characteristic of the incoming query, and evaluating a priority function for each member of a plurality of query queues to identify one highest priority query queue. The priority function accounts for the probability that a future incoming query will contain the sharability characteristic common to a member of the plurality of query queues. The system of query scheduling to maximize work sharing selects a batch of queries from the highest priority query queue, and dispatches the batch to one or more query execution units.

摘要翻译： 一个查询调度系统，最大限度地提高工作共享。 系统调度查询以考虑具有可共享组件的将来查询。 系统中包括用于基于传入查询的可共享性特性将输入查询分配给查询队列的操作，以及评估多个查询队列中的每个成员以识别一个最高优先级查询队列的优先级功能。 优先级功能考虑未来传入查询将包含多个查询队列的成员共有的共享特性的概率。 查询调度系统最大化工作共享，从最高优先级查询队列中选择一批查询，并将批处理分派到一个或多个查询执行单元。

公开(公告)号：US20080028249A1

公开(公告)日：2008-01-31

申请号：US11732495

申请日：2007-04-02

申请人： Parag Agrawal

发明人： Parag Agrawal

IPC分类号： G06F1/06

CPC分类号： G06F1/3203 ,  G06F1/324 ,  Y02D10/126

摘要： A system and method provide adaptive frequency scaling for predicting the load on a processing unit and dynamically changing its clock frequency while keeping the synchronization with other processing units. The amount of data in an input memory waiting to be processed is a good indicator of the current load and thus embodiments of the present invention utilize the same concept for predicting the load on the processing unit. The frequency of operation is thus changed on the basis of the percentage of memory being occupied by its input data. Algorithms according to embodiments of the present invention allow the processing unit to use the maximum possible clock frequency only when it is required and to run at some lower frequencies in low processing power requirements. Operating the circuit at low frequency helps in reducing power consumption.

摘要翻译： 一种系统和方法提供自适应频率缩放以预测处理单元上的负载并动态地改变其时钟频率，同时保持与其它处理单元的同步。 等待处理的输入存储器中的数据量是当前负载的良好指标，因此本发明的实施例利用相同的概念来预测处理单元上的负载。 因此，基于其输入数据占用的存储器的百分比来改变操作频率。 根据本发明的实施例的算法允许处理单元仅在需要时才使用最大可能的时钟频率，并且在低处理能力要求下以某些较低频率运行。 以低频率操作电路有助于降低功耗。

公开(公告)号：US07877380B2

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

申请号：US12036956

申请日：2008-02-25

申请人： Parag Agrawal ,  Daniel Kifer ,  Chris Olston

发明人： Parag Agrawal ,  Daniel Kifer ,  Chris Olston

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30442 ,  G06F17/30474

摘要： A system of query scheduling to maximize work sharing. The system schedules queries to account for future queries possessing a sharability component. Included in the system are operations for assigning an incoming query to a query queue based on a sharability characteristic of the incoming query, and evaluating a priority function for each member of a plurality of query queues to identify one highest priority query queue. The priority function accounts for the probability that a future incoming query will contain the sharability characteristic common to a member of the plurality of query queues. The system of query scheduling to maximize work sharing selects a batch of queries from the highest priority query queue, and dispatches the batch to one or more query execution units.

摘要翻译： 一个查询调度系统，最大限度地提高工作共享。 系统调度查询以考虑具有可共享组件的将来查询。 系统中包括用于基于传入查询的可共享性特性将输入查询分配给查询队列的操作，以及评估多个查询队列中的每个成员以识别一个最高优先级查询队列的优先级功能。 优先级功能考虑未来传入查询将包含多个查询队列的成员共有的共享特性的概率。 查询调度系统最大化工作共享，从最高优先级查询队列中选择一批查询，并将批处理分派到一个或多个查询执行单元。

公开(公告)号：US08606771B2

公开(公告)日：2013-12-10

申请号：US12973909

申请日：2010-12-21

申请人： Arvind Arasu ,  Parag Agrawal ,  Kaushik Shriraghav

发明人： Arvind Arasu ,  Parag Agrawal ,  Kaushik Shriraghav

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30336

摘要： The claimed subject matter provides a method and a system for the efficient indexing of error tolerant set containment. An exemplary method comprises obtaining a frequency threshold and a query set. All tokens or token sets within the query set are determined, and then all minimal infrequent tokens or all minimal infrequent tokens sets of data records are found and used to build an index. The minimal infrequent tokens or minimal infrequent tokensets are processed in a fixed order, and then a collection of signatures for each minimal infrequent token or token set is determined.

摘要翻译： 所要求保护的主题提供了用于有效地索引误差容限集的方法和系统。 一种示例性方法包括获得频率阈值和查询集。 确定查询集中的所有令牌或令牌集，然后找到所有最小的不频繁令牌或所有最小的不频繁令牌数据记录集，并用于构建索引。 以固定的顺序处理最小的不频繁令牌或最小不频繁的令牌，然后确定每个最小不频繁令牌或令牌集的签名集合。

公开(公告)号：US20120158696A1

公开(公告)日：2012-06-21

申请号：US12973909

申请日：2010-12-21

申请人： Arvind Arasu ,  Parag Agrawal ,  Kaushik Shriraghav

发明人： Arvind Arasu ,  Parag Agrawal ,  Kaushik Shriraghav

IPC分类号： G06F17/30

CPC分类号： G06F17/30336

摘要： The claimed subject matter provides a method and a system for the efficient indexing of error tolerant set containment. An exemplary method comprises obtaining a frequency threshold and a query set. All tokens or token sets within the query set are determined, and then all minimal infrequent tokens or all minimal infrequent tokens sets of data records are found and used to build an index. The minimal infrequent tokens or minimal infrequent tokensets are processed in a fixed order, and then a collection of signatures for each minimal infrequent token or token set is determined.

摘要翻译： 所要求保护的主题提供了用于有效地索引误差容限集的方法和系统。 一种示例性方法包括获得频率阈值和查询集。 确定查询集中的所有令牌或令牌集，然后找到所有最小的不频繁令牌或所有最小的不频繁令牌数据记录集，并用于构建索引。 以固定的顺序处理最小的不频繁令牌或最小不频繁的令牌，然后确定每个最小不频繁令牌或令牌集的签名集合。