Digital Fountain, Inc.

Facebook, Inc.

Qualcomm Incorporated

Other

Digital Foundation, Inc.

Soren Bogh Lassen

Michael G Luby

M Amin Shokrollahi

Gavin Bernard Horn

Michael Curtiss

Sandhya Kunnatur

Richard Karp

Armin D Haken

Jeffrey J Persch

Spencer G Ahrens

Tudor Bosman

Jens Rasmussen

Matt Doucleff

Pilip Pronin

Avi Wigderson

Amin Shokrollahi

Vivek K Goyal

Guanghao Shen

Barry Dobyns

Per Knudsgaard

Iain Becker

Amin M Shokrollahi

In one embodiment, a method includes receiving an update of activity associated with one or more content objects associated with a search term. The content objects associated with the search term are indexed on a list of one or more index servers or a term server. The list of the term server include identifier information of one or more content object types. The list of the index servers include identifier information of a single content object type. The method also includes determining whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and modifying the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update.

Database sharding with incorporated updates

In one embodiment, a method includes receiving an update of activity associated with one or more content objects associated with a search term. The search term is associated with a number of content objects exceeding a pre-determined threshold number. The content objects associated with the search term are indexed on a list of one or more index servers. The list includes identifier information corresponding to the content objects. The method also includes modifying the list of one or more of the index servers in response to the update.

Database sharding with update layer

In one embodiment, a server receives a search query; determines search terms based on the received search query, each search term including a prefix and a suffix, both of which correspond to elements of a social graph; and sends search results matching the prefix and suffix of a search term.

Short-term hashes

In one embodiment, a method includes receiving, from a user, a search query requesting objects of a first object type. The search query includes an inner query requesting objects of a second object type. The method includes identifying the objects of the second object type requested by the inner query using an inverted index of a second data store corresponding to the second object type; identifying, for each of the identified objects of the second object type, objects of the first object type using an inverted index of a first data store corresponding to the first object type; aggregating a plurality of search results responsive to the search query, each search result corresponding to an identified object of the first object type; and sending, to the user, one or more of the aggregated search results.

Extract operator

In one embodiment, a method includes determining rankings for a plurality of objects of a social-networking system, where the social-networking system includes a social graph that includes a plurality of nodes and a plurality of edges connecting the nodes. Each object corresponds to a node of the social graph, and each ranking for each object is determined based on a number of edges being connected to the node to which the respective object corresponds. The objects are stored in a plurality of partitions of a database, where each partition stores only objects having a particular ranking. The objects are indexed in the partitions by a plurality of search indices that each index only a particular one of the plurality of partitions.

Indexing edge-ranked based partitions

A method includes: determining a maintenance update for a data service tier based on a service condition of a data service of a target host server; selecting a spare host server to perform the maintenance update; performing the maintenance update of the data service tier to the spare host server; activating the data service on the spare host server; and redirecting client request traffic to the spare host server.

Server maintenance system

In one embodiment, a method includes receiving, from a user, a search query requesting objects of a first object type. The search query includes an inner query requesting objects of a second object type. The method includes identifying objects of the second object type requested by the inner query using an inverted index of a data store corresponding to the second object type; identifying objects of the first object type requested by the search query using the identified objects of the second object type and a forward index of the data store corresponding to the second object type; and sending search results to the user responsive to the search query, each search result corresponding to an identified object of the first object type.

In one embodiment, a server receives a search query; the server determines search terms based on the received search query, each search term including a prefix and a suffix; for each of the search term, the server generates a first binary number based on the each search term's prefix and suffix, and accesses and retrieves search results of the each search term from data stores by hashing the first binary number; the server also aggregates search results of the respective search terms.

In one embodiment, a method includes maintaining data stores for objects of a social-networking system, each data store being configured to store objects of a particular one of multiple object types indexed by a search index; receiving an object; identifying an object type of the received object; storing the received object in at least one data store being configured to store objects of the identified object type; and updating the search index of the at least one data store based on the received object.

Indexing based on object type

In one embodiment, a method includes receiving a search query requesting first search results of a first object type. The search query includes an inner query requesting second search results of a second object type. The method includes accessing an inverted index of a data store corresponding to the second object type; retrieving the second search results requested by the inner query using the inverted index of the data store corresponding to the second object type; accessing a forward index of the data store corresponding to the second object type; retrieving the first search results requested by the search query using the second search results and the forward index of the data store corresponding to the second object type.

In a transport system, data is reliably transported from a sender to a receiver by organizing the data to be transported into data blocks, wherein each data block comprises a plurality of encoding units, transmitting encoding units of a first data block from the sender to the receiver, and detecting, at the sender, acknowledgments of receipt of encoding units by the receiver. At the sender, a probability that the receiver received sufficient encoding units of the first data block to recover the first data block at the receiver is detected and the probability is tested against a threshold probability to determine whether a predetermined test is met. Following the step of testing and prior to the sender receiving confirmation of recovery of the first data block at the receiver, when the predetermined test is met, transmitting encoding units of a second data block from the sender. If an indication of failure to recover the first data block is received at the sender, sending further encoding units for the first data block from the sender to the receiver. In some embodiments, the predetermined test is a comparison of the probability against the threshold probability and the predetermined test is met when the probability is greater than the threshold probability.

FEC-based reliability control protocols

Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates.

Scheduling of multiple files for serving on a server

A method of encoding data for transmission from a source to a destination over a communications channel is provided. A plurality of redundant symbols are generated from an ordered set of input symbols to be transmitted. A plurality of output symbols are generated from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number, N, of the output symbols.

Multi-stage code generator and decoder for communication systems

A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.

Growing community of inventors

San Francisco, CA, United States of America

Soren Bogh Lassen