International Business Machines Corporation

Google Inc.

Yahoo! Inc.

Yahoo! Overture

Marcus Felipe Fontoura

Vanja Josifovski

Eugene Jon Shekita

Jason Yeong Zien

Runping Qi

Ronny Lempel

Andreas Neumann

Sridhar Rajagopalan

John A McPherson, Jr

Andrei Z Broder

Michael Roger Marty

Tushar Deepak Chandra

Nicholas Andrew Kidd

Charles Acknin

Reiner Kraft

Michael Herscovici

Jeremiah Harmsen

Andrei Zary Broder

Andrew Stephen Tomkins

Shanmugasundaram Ravikumar

Beverly Yang

Lance Alan Riedel

Nadav Eiron

Christopher Olston

Denis Baylor

Asim Shankar

Andras Csomai

Douglas Lee Taylor Rohde

Mahesh S Palekar

Daniel N Meredith

Zigmars Rasscevskis

Kevin Scott Beyer

Deepak Agarwal

Bo Pang

Benjamin Clay Reed

Jayavel Shanmugasundaram

Erik Nathan Vee

Peter Altevogt

Evgeniy Gabrilovich

Alexander Shraer

Sergei Vassilvitskii

Tony Leung

Jan Hendrik Pieper

Tony Kai-chi Leung

Yejin Choi

Thomas K Truong

Suhas Sadanandan

Jason Zien

Maxim Gurevich

Jeremiah Joseph Harmsen

Silvio Wiedrich

Mauricio Riguette Mediano

Krishna Tatavarthi

Bjoern Carlin

Hsiang-ling Lin

Joaquin Arturo Delgado Rodriguez

Srihari Venkatesan

Eustus Dwayne Nelson

Pratik Mukhopadhyay

Vanja Josifovsld

Eugene K Shekita

Systems and techniques are disclosed for generating entries for a searchable index based on rules generated by one or more machine-learned models. The index entries can include one or more tokens correlated with an outcome and an outcome probability. A subset of tokens can be identified based on the characteristics of an event. The index may be searched for outcomes and their respective probabilities that correspond to tokens that are similar to or match the subset of tokens based on the event.

Searchable index

Systems and methods include a distributed system that uses a declarative language to separate application logic from the network technology used to communicate. For example, in a system with a plurality of processing nodes, each processing node may include at least one processor, a networking layer for communicating with other processing nodes, and a memory storing instructions that, when executed by the at least one processor, cause the processing node to perform operations. The operations may include receiving a processing plan using the networking layer and analyzing the processing plan to determine a service to perform and a number of inputs anticipated for the service. The operations may also include performing the determined service. The processing plan defines a processing tree comprising a subset of the plurality of processing nodes, the processing tree having unidirectional communication from the root to a final level of the tree.

Network-independent programming model for online processing in distributed systems

A hybrid-sharded index includes document-sharded posting lists and term-sharded posting lists. Implementations include systems and methods for updating a hybrid-sharded index. For example, a method may include receiving updates to the hybrid-sharded index and generating, at a first leaf node, replacement posting lists and change information for a respective second leaf node. The method may also include dividing the replacement posting lists into portions, a portion having associated change information and being associated with a respective one of the second leaf nodes and sending the portions to respective leaf nodes. At a particular leaf node of the second leaf nodes, the method includes merging a received portion into an updated posing list portion, swapping the updated posting list portion into memory. During the swap, the change information and the updated posting list portion are used to respond to a query with an older version of the hybrid-sharded index.

Indexing system

A hybrid-sharded index includes document-sharded posting lists and term-sharded posting lists. Implementations include systems and methods using a distributed hybrid-sharded index. For example, a method may include receiving, at a root node, a query having a first term and a second term and determining, that the first term is term-sharded. The method may also include retrieving a term-sharded posting list for the first term from a first leaf node that stores the term-sharded posting list and determining, at the root node, a second leaf node that stores a document-sharded posting list for the second term. The method may include sending the second term and a sub-set of documents from the term-sharded posting list to the second leaf node, the sub-set being documents assigned to the second leaf node; and generating a search result using a response received from the second leaf node.

Various methods and apparatuses are provided which may be implemented using one or more computing devices within a networked computing environment to employ publish-subscribe techniques to associate subscriber encoded data files with a set of publisher encoded data files.

Publish-subscribe based methods and apparatuses for associating data files

A system and a method are provided for using external sources (e.g., landing pages) for sponsored search ad selection. In one example, the system identifies one or more regions of an external source. The one or more regions are relevant to a query. The external source includes a source that includes relevant data that is usable for augmenting an ad selection process. The system extracts one or more features from the one or more regions. The system determines which of the one or more features are relevant for item indexing. The system then augments an item selection process by using the one or more features that are relevant for item indexing.

Using external sources for sponsored search AD selection

Systems and methods for deleting non-key values from an index distributed over a plurality of computing devices maintains a non-key master list that includes the non-key values that are stored on each of the plurality of computing devices and receives a list of non-key values to delete. The systems and methods further intersect the list of non-key values to delete with the non-key master list, creating a first delete list for a first one of the plurality of computing devices that includes non-key values to be deleted that are stored on the first computing device. The systems and methods further transmit the first delete list to the first computing device and update the non-key master list based on the list of non-key values to delete.

Processing bulk deletions in distributed databases

A system and method to facilitate matching of content to advertising information in a network are described. A request for advertising information is received over a network, the advertising information to be displayed for a user entity in association with content information within a web page requested by the user entity. Advertising information related to one or more themes of the content information on the web page is further determined, the themes representing subject matter contextually related to the content information. Advertisements are further selected from the advertising information based on keywords and metadata stored within the web page and based on a set of predetermined parameters stored within the data storage module. The selected advertisements are further ranked to obtain a ranked list of advertisements. The ranked list of advertisements is subsequently optimized based on feedback data to obtain a list of optimized advertisements to be displayed for the user entity on the requested web page.

System and method to facilitate matching of content to advertising information in a network

A system and method to facilitate classification and storage of events in a network are described. An event and associated content information are received from an entity over a network. The content information is further analyzed to determine one or more themes representing subject matter related to the content information. The event is further classified according to the themes into one or more corresponding categories. Finally, the event is stored into one or more corresponding databases of a data storage module according to the one or more corresponding categories.

System and method to facilitate classification and storage of events in a network

Growing community of inventors

San Jose, CA, United States of America

Marcus Felipe Fontoura