公开(公告)号：US20190068504A1

公开(公告)日：2019-02-28

申请号：US15685022

申请日：2017-08-24

Applicant: Google Inc.

Inventor： Gautham Thambidorai ,  Matthew Rosencrantz ,  Sanjay Ghemawat ,  Srdjan Petrovic ,  Ivan Posva

IPC: H04L12/803 ,  H04L29/08 ,  H04L12/24

Abstract: A programming model provides a method for executing a program in a distributed architecture. One or more first shards of the distributed architecture execute one or more operations, and sending tuples to at least one second shard, the tuples being part of a stream and being based on the one or more operations. The one or more first shards send a token value to the at least one second shard when the sending of the tuples in the stream is complete. The at least one second shard determines whether a total of the token values matches a number of the one or more first shards, and takes a first action in response to determining that the total of the token values matches the number of the one or more first shards. The first action may include marking the stream as being complete and/or generating a message indicating that the stream is complete.

公开(公告)号：US20190065162A1

公开(公告)日：2019-02-28

申请号：US15685055

申请日：2017-08-24

Applicant: Google Inc.

Inventor： Gautham Thambidorai ,  Matthew Rosencrantz ,  Sanjay Ghemawat ,  Srdjan Petrovic ,  Ivan Posva

IPC: G06F9/45 ,  G01R31/3183

CPC classification number: G06F9/5066 ,  G06F8/443 ,  G06F8/456 ,  G06F8/47 ,  G06F17/504

Abstract: A programming model generates a graph for a program, the graph including a plurality of nodes and edges, wherein each node of the graph represents an operation and edges between the nodes represent streams of data input to and output from the operations represented by the nodes. The model determines where in a distributed architecture to execute the operations represented by the nodes. Such determining may include determining which nodes have location restrictions, assigning locations to each node having a location restriction based on the restriction, and partitioning the graph into a plurality of subgraphs, the partitioning including assigning locations to nodes without location restrictions in accordance with a first set of constraints, wherein each node within a particular subgraph is assigned to the same location. Each of the subgraphs is executed at its assigned location in a respective single thread.

公开(公告)号：US09870371B2

公开(公告)日：2018-01-16

申请号：US13938126

申请日：2013-07-09

Applicant: Google Inc.

Inventor： Jeffrey A. Dean ,  Sanjay Ghemawat ,  Andrew B. Fikes ,  Yasushi Saito

IPC: G06F17/30 ,  G06F9/50

CPC classification number: G06F17/30194 ,  G06F9/5083 ,  G06F17/30212 ,  G06F17/30312

Abstract: A method of accessing data includes storing a table that includes a plurality of tablets corresponding to distinct non-overlapping table portions. Respective pluralities of tablet access objects and application objects are stored in a plurality of servers. A distinct application object and distinct tablet are associated with each tablet access object. Each application object corresponds to a distinct instantiation of an application associated with the table. The tablet access objects and associated application objects are redistributed among the servers in accordance with a first load-balancing criterion. A first request directed to a respective tablet is received from a client. In response, the tablet access object associated with the respective tablet is used to perform a data access operation on the respective tablet, and the application object associated with the respective tablet is used to perform an additional computational operation to produce a result to be returned to the client.

公开(公告)号：US20170351673A1

公开(公告)日：2017-12-07

申请号：US15671968

申请日：2017-08-08

Applicant: Google Inc.

Inventor： Vibhu Mittal ,  Jay M. Ponte ,  Mehran Sahami ,  Sanjay Ghemawat ,  John A. Bauer

IPC: G06F17/30 ,  G06F17/27 ,  G06F17/22 ,  G06F3/023

CPC classification number: G06F16/24522 ,  G06F3/0237 ,  G06F16/2452 ,  G06F16/3332 ,  G06F16/972 ,  G06F17/22 ,  G06F17/27

Abstract: Methods and apparatus consistent with the invention allow a user to submit an ambiguous search query and to receive relevant search results. Queries can be expressed using character sets and/or languages that are different from the character set and/or language of at least some of the data that is to be searched. A translation between these character sets and/or languages can be performed by examining the use of terms in aligned text. Probabilities can be associated with each possible translation. Refinements can be made to these probabilities by examining user interactions with the search results.

公开(公告)号：US09830357B2

公开(公告)日：2017-11-28

申请号：US15226795

申请日：2016-08-02

Applicant: GOOGLE INC.

Inventor： Robert C. Pike ,  Sean Quinlan ,  Sean M. Dorward ,  Jeffrey Dean ,  Sanjay Ghemawat

IPC: G06F17/30 ,  G06F11/14

CPC classification number: G06F17/30501 ,  G06F11/1482 ,  G06F17/30545 ,  G06F17/30598 ,  Y10S707/99933 ,  Y10S707/99937

Abstract: A method processes data records. The method partitions the data records into groups and assigns each group to a respective process of a first plurality of processes, which execute in parallel. For each group, the assigned process extracts information from the data records, applies a script with information processing commands applied sequentially to produce intermediate values, stores the intermediate values in a respective intermediate data structure, and updates the status of the group to indicate completion. When the predefined threshold percentage of the data records are completed, the process assigns each group to a respective second process as a backup. When each of the groups has been completed by at least one process (either the original or the backup), the method executes a second plurality of processes to aggregate intermediate values from the intermediate data structures to produce output data. The aggregation includes intermediate values only once for each group.

公开(公告)号：US09734197B2

公开(公告)日：2017-08-15

申请号：US14199249

申请日：2014-03-06

Applicant: Google Inc.

Inventor： Vibhu Mittal ,  Jay M. Ponte ,  Mehran Sahami ,  Sanjay Ghemawat ,  John A. Bauer

IPC: G06F7/00 ,  G06F17/00 ,  G06F17/30 ,  G06F3/023 ,  G06F17/22 ,  G06F17/27

CPC classification number: G06F17/3043 ,  G06F3/0237 ,  G06F17/22 ,  G06F17/27 ,  G06F17/30427 ,  G06F17/3066 ,  G06F17/30893

Abstract: Methods and apparatus consistent with the invention allow a user to submit an ambiguous search query and to receive relevant search results. Queries can be expressed using character sets and/or languages that are different from the character set and/or language of at least some of the data that is to be searched. A translation between these character sets and/or languages can be performed by examining the use of terms in aligned text. Probabilities can be associated with each possible translation. Refinements can be made to these probabilities by examining user interactions with the search results.

公开(公告)号：US20170124454A1

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

申请号：US15338225

申请日：2016-10-28

Applicant: Google Inc.

Inventor： Vijay Vasudevan ,  Jeffrey Adgate Dean ,  Sanjay Ghemawat

IPC: G06N3/08 ,  G06F17/16 ,  G06N3/04

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for modifying a computational graph to include send and receive nodes. Communication between unique devices performing operations of different subgraphs of the computational graph can be handled efficiently by inserting send and receive nodes into each subgraph. When executed, the operations that these send and receive nodes represent may enable pairs of unique devices to conduct communication with each other in a self-sufficient manner. This shifts the burden of coordinating communication away from the backend, which affords the system that processes this computational graph representation the opportunity to perform one or more other processes while devices are executing subgraphs.

公开(公告)号：US20170011056A1

公开(公告)日：2017-01-12

申请号：US15269788

申请日：2016-09-19

Applicant: GOOGLE INC.

Inventor： Yasushi Saito ,  Sanjay Ghemawat ,  Jeffrey Adgate Dean

IPC: G06F17/30

CPC classification number: G06F17/30117 ,  G06F17/3007 ,  G06F17/30156 ,  G06F17/30194 ,  G06F17/30303

Abstract: A method for deleting obsolete files from a file system is provided. The method includes receiving a request to delete a reference to a first target file of a plurality of target files stored in a file system, the first target file having a first target file name. A first reference file whose file name includes the first target file name is identified. The first reference file is deleted from the file system. The method further includes determining whether the file system includes at least one reference file, distinct from the first reference file, whose file name includes the first target file name. In accordance with a determination that the file system does not include the at least one reference file, the first target file is deleted from the file system.

Abstract translation: 提供了从文件系统中删除过时文件的方法。 所述方法包括接收删除对存储在文件系统中的多个目标文件的第一目标文件的引用的请求，所述第一目标文件具有第一目标文件名。 识别文件名包括第一个目标文件名的第一个引用文件。 第一个参考文件从文件系统中删除。 该方法还包括确定文件系统是否包括与第一参考文件不同的至少一个参考文件，其文件名包括第一目标文件名。 根据文件系统不包括至少一个参考文件的确定，从文件系统中删除第一目标文件。

公开(公告)号：US08856141B1

公开(公告)日：2014-10-07

申请号：US13658570

申请日：2012-10-23

Applicant: Google Inc.

Inventor： Jeffrey Adgate Dean ,  Sanjay Ghemawat ,  Sachin Jain ,  Boris Mazniker

IPC: G06F17/30

CPC classification number: G06F17/3053 ,  G06Q10/101 ,  G06Q10/107 ,  G06Q50/01 ,  H04L12/1813

Abstract: A system includes: an engaging post identifier for identifying and retrieving engaging posts; an extended network post identifier for identifying extended posts from an extended network; a combining module for creating a combined list of added posts from the engaging post and the extended posts, the combining module generating one or more ranked posts by ranking the list of added posts by relevance to a user; and a user interface module for providing the one or more ranked posts. The disclosure also includes a method for finding and providing engaging posts that includes determining engaging posts; determining extended posts from an extended social network using a social graph of the user; adding the engaging posts and the extended posts to create a combined list of added posts; ranking the added posts by relevance to a user; and providing one or more of the ranked posts.

Abstract translation: 系统包括：用于识别和检索接合柱的接合柱标识符; 用于从扩展网络识别扩展帖子的扩展网络帖子标识符; 组合模块，用于从所述参与帖子和所述扩展帖子创建添加的帖子的组合列表，所述组合模块通过与添加的用户的相关性对所添加的帖子的列表进行排名来生成一个或多个排名的帖子; 以及用于提供一个或多个排名的帖子的用户界面模块。 本公开还包括一种用于查找和提供接合柱的方法，其包括确定接合柱; 使用用户的社交图来确定来自扩展社交网络的扩展帖子; 增加招聘岗位和扩展职位，以创建新增岗位的综合列表; 通过与用户的相关性对附加的帖子进行排名; 并提供一个或多个排名的职位。

公开(公告)号：US20140096138A1

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

申请号：US14099806

申请日：2013-12-06

Applicant: Google Inc.

Inventor： Jeffrey Dean ,  Sanjay Ghemawat

IPC: G06F9/54 ,  G06F9/48

CPC classification number: G06F17/30339 ,  G06F9/4881 ,  G06F9/54 ,  G06F17/30377 ,  G06F17/30445

Abstract: A large-scale data processing system and method for processing data in a distributed and parallel processing environment is disclosed. The system comprises a set of interconnected computing systems, each having one or more processors and memory. The set of interconnected computing systems include: a set of application-independent map modules for reading portions of input files containing data, and for producing intermediate data values by applying at least one user-specified, application-specific map operation to the data; a set of intermediate data structures distributed among a plurality of the interconnected computing systems for storing the intermediate data values; and a set of application-independent reduce modules, distinct from the plurality of application-independent map modules, for producing final output data by applying at least one user-specified, application-specific reduce operation to the intermediate data values.

Abstract translation: 公开了一种用于在分布式和并行处理环境中处理数据的大规模数据处理系统和方法。 该系统包括一组互连的计算系统，每个系统具有一个或多个处理器和存储器。 所述互连的计算系统的集合包括：用于读取包含数据的输入文件的部分的用于应用的地图模块的集合，以及通过对所述数据应用至少一个用户指定的特定于应用的地图操作来产生中间数据值的集合; 一组中间数据结构，分布在多个互连的计算系统中，用于存储中间数据值; 以及与多个独立于应用的地图模块不同的一组独立于应用的减少模块，用于通过对中间数据值应用至少一个用户指定的特定于应用的减少操作来产生最终的输出数据。