Michael D Bigby

US Patent:

7958088, Jun 7, 2011

Filed:

Dec 14, 2007

Appl. No.:

11/957132

Inventors:

Ramana V. Yerneni - Cupertino CA, US
Michael Bigby - San Jose CA, US
Philip Bohannon - Cupertino CA, US
Bryan Call - San Jose CA, US
Brian Cooper - San Jose CA, US
Andrew Feng - Cupertino CA, US
David Lomax - San Jose CA, US
Raghu Ramakrishnan - Santa Clara CA, US
Utkarsh Srivastava - Fremont CA, US
Daniel Weaver - Redwood City CA, US

Assignee:

Yahoo! Inc. - Sunnyvale CA

International Classification:

G06F 7/00

US Classification:

707610

Abstract:

Methods and apparatuses are provided for dynamically reorganizing the data within a replicated database system. One method, for example, includes performing a split operation across a plurality of replicated databases with regard to an existing partition therein, wherein the existing partition comprises a plurality of data records and the two new partitions each include at least a portion of the plurality of data records, and allowing at least one type of access to the plurality of data records during the split operation.

US Patent:

8380572, Feb 19, 2013

Filed:

Aug 25, 2003

Appl. No.:

10/648599

Inventors:

Bhavesh Mehta - Cupertino CA, US
Michael D. Bigby - San Jose CA, US

Assignee:

Yahoo! Inc. - Sunnyvale CA

International Classification:

G06Q 30/00

US Classification:

705 1449, 705 1473

Abstract:

Techniques are provided for selecting among the advertisements that are competing for a slot based, at least in part, on an “schedule sequence” that is established for the advertisements. The schedule sequence may, for example, reflect the relative times at which a content provider incurred the delivery obligations associated with the advertisements. For the purpose of establishing the sequence, the date on which an advertisement order is placed may be considered to be the date on which the corresponding delivery obligations are incurred. After the sequence has been established, the position of competing advertisements within the schedule sequence is used as one of the factors for determining which competing ad to place in a slot, where ads nearer the beginning of the sequence (ads with earlier-incurred delivery obligations) are favored over ads that are nearer the end of the sequence (ads with later-incurred delivery obligations).

US Patent:

8527346, Sep 3, 2013

Filed:

Jun 28, 2004

Appl. No.:

10/880183

Inventors:

Michael Bigby - San Jose CA, US
Britton Glasser - San Francisco CA, US
Adam Taisch - San Francisco CA, US
Andy Atherton - San Francisco CA, US
Harry Fung - Milpitas CA, US

Assignee:

Yahoo! Inc. - Sunnyvale CA

International Classification:

G06Q 30/00

US Classification:

705 1461, 705 144, 705 1448, 705 1449, 705 1452, 705 1468

Abstract:

A method for scheduling advertising comprises the steps of: estimating a respective fraction of delivered advertisement impressions that result in a response from a user for each of a plurality of advertising contracts, estimating a value per impression for each of the advertising contracts, and scheduling an advertising line under the contract having the highest value per impression at a next available advertising window.

US Patent:

20030056213, Mar 20, 2003

Filed:

Feb 14, 2002

Appl. No.:

10/077282

Inventors:

James McFaddin - Dallas TX, US
Justin Madison - Garland TX, US
Michael Bigby - San Jose CA, US

International Classification:

H04N007/10
H04N007/025
G06F017/60
G06F015/16

US Classification:

725/032000, 705/014000, 709/219000

Abstract:

A system and method for delivering a composite information stream over a computer network includes a flow control system that is connected to multiple information sources. The flow control system receives data from two or more of these sources and from a data control manager. The system selectively controls the flow of data that is received from the data sources in response to commands from the data control manager to create the composite information stream. The composite information stream is passed to the encoder, which forwards it to the media player for display at end user processors. In accordance with the invention, commercial advertisements may be inserted into a television broadcast, and transmitted over the Internet to be displayed on a video monitor.

US Patent:

20090089313, Apr 2, 2009

Filed:

Sep 28, 2007

Appl. No.:

11/863902

Inventors:

Brian Cooper - San Jose CA, US
Daniel Weaver - Redwood City CA, US
Michael Bigby - San Jose CA, US
Utkarsh Srivastava - Fremont CA, US
Philip L. Bohannon - Cupertino CA, US
Ramana Yerneni - Cupertino CA, US

Assignee:

YAHOO! INC. - Sunnyvale CA

International Classification:

G06F 17/30

US Classification:

707102, 707E17002

Abstract:

A technique is described that reduces the complexity and resource consumption associated with performing record expiry in a distributed database system. In accordance with the technique, a record is checked to see if it has expired only when it has been accessed for a read or a write. If at the time of a read a record is determined to have expired, then it is not served. If at the time of a write a record is determined to have expired, then the write is treated as an insertion of a new record, and steps are taken to treat the insertion consistently with regard to the previous expired version. A background process is used to delete records that have not been written to or actively deleted by a client after expiration.

US Patent:

20090144220, Jun 4, 2009

Filed:

Nov 30, 2007

Appl. No.:

11/948236

Inventors:

Andrew A. Feng - Cupertino CA, US
Michael Bigby - San Jose CA, US
Bryan Call - San Jose CA, US
Brian F. Cooper - San Jose CA, US
Daniel Weaver - Redwood City CA, US

Assignee:

YAHOO! INC. - Sunnyvale CA

International Classification:

G06F 17/30

US Classification:

707 1, 707E17052

Abstract:

A system for storing a distributed hash table. The system includes a storage unit, a tablet controller, a router, and a transaction bank. The storage unit has a plurality of tablets forming a hash table and each of the tablets includes multiple records. The tablet controller maintains a relationship between each tablet and the storage unit. The router hashes a record's key to determine the tablet associated with each record. Further, the router distributes messages from clients to the storage units based on the tablet-storage unit relationship thereby serving as a layer of indirection. The transaction bank propagates updates made in one record to all other replicas of the record.

US Patent:

20090144333, Jun 4, 2009

Filed:

Nov 30, 2007

Appl. No.:

11/948262

Inventors:

Andrew A. Feng - Cupertino CA, US
Michael Bigby - San Jose CA, US
Bryan Call - San Jose CA, US
Brian F. Cooper - San Jose CA, US
Daniel Weaver - Redwood City CA, US

Assignee:

YAHOO! INC. - Sunnyvale CA

International Classification:

G06F 17/30

US Classification:

707200, 707E17005

Abstract:

A system for maintaining a database. The system includes a storage unit for storing many tablets each tablet including multiple records. The tablet controller is configured to maintain the relationship between the tablet and the storage unit. The tablet controller tracks failures to access the storage unit and designates a new storage unit for each tablet based on a storage unit failure. A router is in communication with the tablet controller and configured to distribute messages from clients to the storage units thereby serving as a layer of indirection.

US Patent:

20090144338, Jun 4, 2009

Filed:

Nov 30, 2007

Appl. No.:

11/948221

Inventors:

Andrew A. Feng - Cupertino CA, US
Michael Bigby - San Jose CA, US
Bryan Call - San Jose CA, US
Brian F. Cooper - San Jose CA, US
Daniel Weaver - Redwood City CA, US

Assignee:

YAHOO! INC. - Sunnyvale CA

International Classification:

G06F 17/30
G06F 12/06

US Classification:

707201, 711 5, 707E17001, 711E12028

Abstract:

A system for a distributed database implementing a dynamic mastership strategy. The system includes a multiple data centers, each having a storage unit to store a set of records. Each data center stores its own replica of the set of records and each record includes a field that indicates which data center is assigned to be the master for that record. Since each of the data centers can he geographically distributed, one record may be more efficiently edited with the master being one geographic region while another record, possibly belonging to a different user, may be more efficiently edited with the master being located in another geographic region.