Google Inc.

Brian Patton

Nicolas Fortescue

Yossi Matias

Eyal Segalis

Michael Fink

Michal Levin

Debashish Chatterjee

Niv Efron

Maximilian Ruppaner

Nir Bar-Lev

Riccardo Govoni

Nimrod Tamir

Piotr Krzysztof Swigon

John Ayres

Michal Neufeld

Elizabeth Ireland Powers

Eva-Lotta Lamm

Alan Michael Stokes

Yair Shimshoni

An application and system are provided that prevent an application repository from accepting a new installation package if the new application installation package would not be successfully installed on devices to which it is directed. The version number and constraints provided with the new application installation package may be compared to that of installation packages already existing or published within the repository to determine whether or not the new installation package will be unreachable by a device group to which it is directed. An indication may be provided if that new installation package is unreachable by at least one device group to which it is directed.

Preventing application downgrade in an application store

Implementations of the disclosed subject matter provide systems and methods for providing one or more versions of an application to one or more subsets of users based on measured performance of the one or more versions of the application. A method may include providing a first version of an application to a first subset of users of the application. Next, performance of the first version of the application may be measured and a second subset of users of the application may be selected based on the performance of the first version of the application. As a result, a second version of the application may be provided to the second subset of users of the application.

Application version release management

Techniques for providing interactive visualizations for an entity or group of entities based on search interest data are provided. The search interest data may be derived from Internet or online search data related to the entities and relevant attributes of the entities. Each of the entities and attributes may be represented in a structured search market using a predefined list of relevant search terms or keywords. The search interest of each entity and attribute may be determined based on probabilities representing a likelihood of a search for an entity co-occurring with a search for a relevant attribute within a predetermined time proximity.

Campaign and competitive analysis and data visualization based on search interest data

Growing community of inventors

London, United Kingdom

Brian Patton