Google Assigned Two Patents

Adaptive and prioritized replication scheduling in storage clusters
Google Inc., Mountain View, CA, has been assigned a patent (8,918,555), developed by Drobychev Alexandre, San Mateo, CA, and O’Reilly Michael, Pyrmont, Australia, for a “adaptive and prioritized replication scheduling in storage clusters.”

The abstract of the patent published by the U.S. Patent and Trademark Office states: “In one implementation, groups of objects may be maintained, each group including one or more objects that are to be replicated at one or more of the storage clusters. The objects may be assigned to the groups based on replication choices where at least some of the objects are assigned to multiple ones of the groups. A priority value may be determined and associated with each of the groups, the priority value of a particular group being determined based on priority values associated with objects within the particular group. The objects may be selected, for replication, in a replication order based on the priority value of the groups and replication of the selected objects may be initiated.“

The patent application was filed on November 6, 2012 (13/669,596)

Classifying queries
Google Inc., Mountain View, CA, has been assigned a patent (8,918,416), developed by Gross Erik, Palo Alto, CA, and Sussman Myles, San Francisco, CA, for a “classifying queries.”

The abstract of the patent published by the U.S. Patent and Trademark Office states: “Methods, systems, and apparatus, including computer programs encoded on computer storage media, for classifying queries. One of the methods includes the actions of obtaining a collection of search queries for each query in the collection of search queries, determining whether other queries in the collection of search queries are refinements of the query, wherein the refinements of each query include the query terms and one or more additional terms not found in the query determining a similarity between query pairs from the collection, wherein the similarity between a query pair is determined using the additional query terms from the refinements of the respective search queries of the query pair obtaining a classified sample group of search queries using a plurality of category labels and classifying each other search query of the collection of search queries having one or more refinements.“

The patent application was filed on September 19, 2012 (13/622,985).