公开(公告)号：US07714858B2

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

申请号：US10418502

申请日：2003-04-18

Applicant: Michael A. Isard ,  Alan B. Heirich ,  Mark A. Shand

Inventor： Michael A. Isard ,  Alan B. Heirich ,  Mark A. Shand

IPC: G06T15/00

CPC classification number: G06T15/60 ,  G06T15/04 ,  G06T2215/12

Abstract: The disclosed embodiments relate to a rendering cluster that renders an image of a scene object. The rendering cluster may comprise an illumination node that produces illumination output based on lighting properties of the scene object and a material node that produces material output based on material properties of the scene object. The illumination output is combined with the material output to form the image.

Abstract translation: 所公开的实施例涉及呈现场景对象的图像的呈现集群。 渲染集群可以包括基于场景对象的照明属性产生照明输出的照明节点和基于场景对象的材料属性产生材料输出的素材节点。 照明输出与材料输出组合以形成图像。

公开(公告)号：US07680789B2

公开(公告)日：2010-03-16

申请号：US11334302

申请日：2006-01-18

Applicant: Gaurav Sareen ,  Michael A. Isard

Inventor： Gaurav Sareen ,  Michael A. Isard

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30613 ,  G06F17/30864 ,  Y10S707/99936

Abstract: Index entries representing ranges of values are queried with a query value to determine if the query value is in one of the ranges. Numeric ranges are represented in an index and queries are constructed to match index entries. Search terms are constructed from the query value, such that a search term matches an index entry if and only if the queried for valued is in the range represented by the index entry. To facilitate querying the indexes, queries are constructed to contain search terms having a data structure format similar to that of the index entries.

Abstract translation: 使用查询值查询表示值范围的索引条目，以确定查询值是否在其中一个范围内。 数字范围在索引中表示，并且构造查询以匹配索引条目。 搜索项是从查询值构造的，使得当且仅当被查询的值在索引条目表示的范围内时，搜索项与索引条目匹配。 为了便于查询索引，构造查询以包含具有与索引条目类似的数据结构格式的搜索项。

公开(公告)号：US09165035B2

公开(公告)日：2015-10-20

申请号：US13468726

申请日：2012-05-10

Applicant: Frank D. McSherry ,  Rebecca Isaacs ,  Michael A. Isard ,  Derek G. Murray

Inventor： Frank D. McSherry ,  Rebecca Isaacs ,  Michael A. Isard ,  Derek G. Murray

IPC: G06F17/30

CPC classification number: G06F17/30516 ,  G06F17/30554 ,  G06F17/30958

Abstract: The techniques discussed herein efficiently perform data-parallel computations on collections of data by implementing a differential dataflow model that performs computations on differences in the collections of data. The techniques discussed herein describe defined operators for use in a data-parallel program that performs the computations on the determined differences between the collections of data by creating a lattice and indexing the differences in the collection of data according to the lattice.

Abstract translation: 本文讨论的技术通过实现对数据集合中的差异进行计算的差分数据流模型，有效地对数据集合执行数据并行计算。 本文讨论的技术描述了用于数据并行程序中的定义的操作符，其通过创建格子并根据格子索引数据收集的差异来对数据集合之间确定的差异进行计算。

公开(公告)号：US08452106B2

公开(公告)日：2013-05-28

申请号：US12729250

申请日：2010-03-23

Applicant: Qifa Ke ,  Michael A. Isard ,  David Changsoo Lee

Inventor： Qifa Ke ,  Michael A. Isard ,  David Changsoo Lee

IPC: G06K9/66

CPC classification number: G06K9/6202 ,  G06K9/4642

Abstract: Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may submit an image and request that an image that is a partial match for the submitted image be located in the image collection. The submitted image is similarly divided into partitions and min-hash sketches are generated from the partitions. The min-hash sketches are compared with the stored min-hash sketches for matches, and images having partitions whose sketches are matches are returned as partial matching images.

Abstract translation: 数据库或图像集合中的图像被分成多个分区，每个分区对应于图像的区域。 图像中的分区可能会彼此重叠。 为每个分区生成最小散列草图，并与图像一起存储。 用户可以提交图像并请求作为所提交图像的部分匹配的图像位于图像集合中。 提交的图像类似地划分为分区，并且从分区生成最小哈希草图。 将最小哈希草图与存储的最小哈希草图进行比较，并将具有其草图匹配的分区的图像作为部分匹配图像返回。

公开(公告)号：US20110246439A1

公开(公告)日：2011-10-06

申请号：US12754614

申请日：2010-04-06

Applicant: Michael A. Isard ,  Marc A. Najork ,  Sean A. Suchter ,  Eric R. Scheel

Inventor： Michael A. Isard ,  Marc A. Najork ,  Sean A. Suchter ,  Eric R. Scheel

IPC: G06F17/30 ,  G06F21/00

CPC classification number: G06F16/951

Abstract: A query is annotated with a small sketch (e.g. a Bloom filter) that approximates a set of interest that is related to the query. The query and sketch may be forwarded to index servers that each stores a portion of a search engine corpus. Each of the index servers may filter documents using the sketch before returning results for aggregation. The sketch is designed so there may be false positives (results returned by authors not in the set), but no false negatives (all relevant results are returned). The final aggregated results set may be checked against the full set to remove false positives before returning the final results to the user.

Abstract translation: 使用近似于与查询相关的一组兴趣的小草图（例如Bloom过滤器）来注释查询。 查询和草图可以转发到每个存储搜索引擎语料库的一部分的索引服务器。 每个索引服务器都可以使用草图过滤文档，然后返回聚合结果。 草图设计为可能存在误报（作者不在集合中返回的结果），但不存在假阴性（返回所有相关结果）。 最终聚合结果集可以针对完整集进行检查，以在将最终结果返回给用户之前去除误报。

公开(公告)号：US07844959B2

公开(公告)日：2010-11-30

申请号：US11537514

申请日：2006-09-29

Applicant: Michael A. Isard

Inventor： Michael A. Isard

IPC: G06F9/45 ,  G06F9/46 ,  G06F15/76

CPC classification number: G06F9/5066 ,  G06F11/1438

Abstract: A general purpose high-performance distributed execution engine for coarse-grained data-parallel applications is proposed that allows developers to easily create large-scale distributed applications without requiring them to master concurrency techniques beyond being able to draw a graph of the data-dependencies of their algorithms. Based on the graph, a job manager intelligently distributes the work load so that the resources of the execution engine are used efficiently. During runtime, the job manager (or other entity) can automatically modify the graph to improve efficiency. The modifications are based on runtime information, topology of the distributed execution engine, and/or the distributed application represented by the graph.

Abstract translation: 提出了一种用于粗粒度数据并行应用程序的通用高性能分布式执行引擎，允许开发人员轻松创建大规模分布式应用程序，而不需要它们掌握并发技术，除了能够绘制数据依赖关系的图形 他们的算法。 基于该图，作业管理器智能地分配工作负载，以便有效地使用执行引擎的资源。 在运行时，作业管理器（或其他实体）可以自动修改图形以提高效率。 这些修改基于运行时信息，分布式执行引擎的拓扑和/或由图表表示的分布式应用程序。

公开(公告)号：US08473481B2

公开(公告)日：2013-06-25

申请号：US12404358

申请日：2009-03-16

Applicant: Oliver M. C. Williams ,  Michael A. Isard

Inventor： Oliver M. C. Williams ,  Michael A. Isard

IPC: G06F17/30

CPC classification number: G06F17/30011 ,  G06Q10/06

Abstract: An image may be received, a portion of which corresponds to a surface of an object, such as a book, a CD, a DVD, a wine bottle, etc. The portion of the image that corresponds to the surface of the object is located. The portion of the image is compared with previously stored images of surfaces of objects to identify the object. A record of the object is created and added to a library. The record of the object may comprise the image of the object, the portion of the image which corresponds to the surface of the object, and/or the received image itself. The record may comprise an indicator of a location of the object.

Abstract translation: 可以接收图像，其一部分对应于诸如书籍，CD，DVD，酒瓶等的物体的表面。对应于物体表面的图像的部分位于 。 将图像的部分与先前存储的对象的表面的图像进行比较以识别对象。 创建对象的记录并将其添加到库中。 对象的记录可以包括对象的图像，对应于对象的表面的图像的部分和/或接收到的图像本身。 记录可以包括对象的位置的指示符。

公开(公告)号：US20110235908A1

公开(公告)日：2011-09-29

申请号：US12729250

申请日：2010-03-23

Applicant: Qifa Ke ,  Michael A. Isard ,  David Changsoo Lee

Inventor： Qifa Ke ,  Michael A. Isard ,  David Changsoo Lee

IPC: G06K9/34 ,  G06K9/68

CPC classification number: G06K9/6202 ,  G06K9/4642

Abstract: Images in a database or collection of images are each divided into multiple partitions with each partition corresponding to an area of an image. The partitions in an image may overlap with each other. Min-hash sketches are generated for each of the partitions and stored with the images. A user may submit an image and request that an image that is a partial match for the submitted image be located in the image collection. The submitted image is similarly divided into partitions and min-hash sketches are generated from the partitions. The min-hash sketches are compared with the stored min-hash sketches for matches, and images having partitions whose sketches are matches are returned as partial matching images.

Abstract translation: 数据库或图像集合中的图像被分成多个分区，每个分区对应于图像的区域。 图像中的分区可能会彼此重叠。 为每个分区生成最小散列草图，并与图像一起存储。 用户可以提交图像并请求作为所提交图像的部分匹配的图像位于图像集合中。 提交的图像类似地划分为分区，并且从分区生成最小哈希草图。 将最小哈希草图与存储的最小哈希草图进行比较，并将具有其草图匹配的分区的图像作为部分匹配图像返回。

公开(公告)号：US07908265B2

公开(公告)日：2011-03-15

申请号：US12033715

申请日：2008-02-19

Applicant: Martin Abadi ,  Andrew D. Birrell ,  Timothy L. Harris ,  Michael A. Isard ,  Johnson Hsieh

Inventor： Martin Abadi ,  Andrew D. Birrell ,  Timothy L. Harris ,  Michael A. Isard ,  Johnson Hsieh

IPC: G06F17/00

CPC classification number: G06F9/466 ,  G06F8/443

Abstract: Strong semantics are provided to programs that are correctly synchronized in their use of transactions by using dynamic separation of objects that are accessed in transactions from those accessed outside transactions. At run-time, operations are performed to identify transitions between these protected and unprotected modes of access. Dynamic separation permits a range of hardware-based and software-based implementations which allow non-conflicting transactions to execute and commit in parallel. A run-time checking tool, analogous to a data-race detector, may be provided to test dynamic separation of transacted data and non-transacted data. Dynamic separation may be used in an asynchronous I/O library.

Abstract translation: 通过使用在访问外部事务处理的事务中访问的对象的动态分离，为使用事务中正确同步的程序提供了强大的语义。 在运行时，执行操作以识别这些受保护和不受保护的访问模式之间的转换。 动态分离允许一系列基于硬件和基于软件的实现，允许非冲突事务并行执行和提交。 可以提供类似于数据竞争检测器的运行时检查工具来测试事务数据和非事务数据的动态分离。 动态分离可用于异步I / O库。

公开(公告)号：US07730058B2

公开(公告)日：2010-06-01

申请号：US11243924

申请日：2005-10-05

Applicant: Gaurav Sareen ,  Mark Steven Manasse ,  Martin Abadi ,  Michael A. Isard

Inventor： Gaurav Sareen ,  Mark Steven Manasse ,  Martin Abadi ,  Michael A. Isard

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30687

Abstract: A probabilistic detector is utilized to query a database. Utilization of a probabilistic detector provides assurance with 100 per cent probability that a search expression in the query is not in the database index. The probabilistic detector is implemented in the form of a Bloom filter. The probabilistic detector is created by hashing expressions in the database index and mapping the resulting hash values into the probabilistic detector. Upon receiving a query, expressions of the query are hashed. The probabilistic detector is queried using these hash values. If the results of querying the probabilistic detector indicate that searched for information may be in the database, the database is not queried. If the results of querying the probabilistic detector indicate that the information may be in the database, the database is queried for the information using the original query. This technique is advantageous in mitigating detrimental effects of denial of service attacks.

Abstract translation: 利用概率检测器查询数据库。 概率检测器的利用率提供了100％的可能性，即查询中的搜索表达式不在数据库索引中。 概率检测器以Bloom滤波器的形式实现。 概率检测器是通过在数据库索引中散列表达式并将生成的散列值映射到概率检测器中创建的。 在接收到查询后，查询的表达式将被哈希。 使用这些散列值查询概率检测器。 如果查询概率检测器的结果表明搜索到的信息可能在数据库中，则不会查询数据库。 如果查询概率检测器的结果表明信息可能在数据库中，则使用原始查询查询数据库中的信息。 这种技术有利于减轻拒绝服务攻击的有害影响。