Google Inc.

Ianywhere Solutions, Inc.

Matthew Young-Lai

Pavel Kobyakov

George Jacob Levitte

Ryan Matthew Haggarty

Chris Kirby

Dany Kuminov

Bhavin Vyas

Igor Foox-Rapoport

Jean Semere

Wan Wang

Abdullah Hassan Gharaibeh

Michal Dabrowski

Duncan Geoffrey Hector Wood

Gang Wang

Zoltan Szamonek

Anisoara Nica

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enforcing publisher content item block requests. In one aspect, a method includes receiving a set of declared network locations for a content item and rendering the content item. A request is initiated for a resource that is referenced by the content item, and network locations fetched in response to the request are logged. A composite set of network locations that includes the fetched network locations and declared network locations is generated. The composite set of network locations is used to enforce publisher block requests.

Enforcing publisher content item block requests

A watermark image may be generated that includes a first set of encoded pixels each of which is assigned a first transparency value and a second set of encoded pixels each of which is assigned a second transparency value, the second transparency level being different from the first transparency level. The encoded pixels may be distributed among a set of blank pixels such that each encoded pixel neighbors one or more blank pixels in the watermark image, and in particular at least two blank pixels in the watermark image. Herein, each blank pixel may be assigned the second transparency value. The watermark image may be overlaid and blended over a background source image to create an encoded source image. A decoder system may recover encoded information from the encoded source image.

Semi-transparent embedded watermarks

A computer-implemented method for protecting user identity within online content providing environments uses a security content management system (CMS) including at least one processor and a memory. The method includes identifying a request for an online content item associated with an online device. The online device is associated with actual device data. The method also includes determining a first characteristic value associated with the actual device data of the online device. The method further includes generating, by the processor, substitute device data. The substitute device data represents at least the first characteristic value. The method also includes providing the substitute device data to an online content provider.

Systems and methods for protecting user identity within online content providing environments

Methods, systems, and apparatuses for improving performance of parallel database query plans are described. An exchange operator is positioned in a query tree. A child operator of the exchange operator is parallelized into a plurality of parallel child operators, each of the parallel child operators coupled to the exchange operator in a respective branch of a plurality of parallel branches of the query tree. An output of each of the plurality of parallel child operators may be buffered at the exchange operator. Furthermore, child operators of the plurality of parallel child operators may also be parallelized. Query plans of any form and containing any number of operators may be parallelized in this manner. Any number of parallel branches may be used, independent of the number of operators in the original plan. The parallelized query plans achieve effective load balancing across all branches.

Load balancing for complex database query plans

A database system and methodology for generalized order optimization is described. In one embodiment, for example, in a database system, a method of the present invention is described for optimizing a query requesting data from a database in an ordered form, the method comprises steps of: generating a plurality of partial access plans for obtaining data requested by the query; constructing generalized orders representing requirements of the query for ordering of data, each generalized order representing a set of simple orders; creating generalized orders representing order properties of the partial access plans; intersecting the generalized orders representing requirements of the query for ordering of data with the generalized orders representing order properties of the partial access plans to determine partial access plans having favorable orderings; and building a query execution plan for obtaining and ordering the data requested by the query based, at least in part, on selecting partial access plans having favorable orderings.

Database system and methodology for generalized order optimization

Growing community of inventors

Waterloo, Canada

Matthew Young-Lai