Patents by Inventor Amit Kumar Manjhi

Amit Kumar Manjhi has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9690842
    Abstract: Methods, systems, and computer program products for determining frequently occurring data items are disclosed. These include, counting distinct categories of a plurality of data items using an ordered set of counters, wherein each of the counters is associated with one of the distinct categories and represents a quantity of the data items in the associated one of the distinct categories, and wherein the counting includes updating counters in the ordered set and a global decrement counter when one of the data items fails to match at least one of the distinct categories associated with the counters of the ordered set and when the ordered set is full. These further include, reporting, for each of the counters in the ordered set, a lower bound for the associated one of the distinct categories, wherein the lower bound is based upon a value of the counter and the global decrement counter.
    Type: Grant
    Filed: November 9, 2015
    Date of Patent: June 27, 2017
    Assignee: Google Inc.
    Inventors: John Plevyak, Amit Kumar Manjhi
  • Publication number: 20160063090
    Abstract: Methods, systems, and computer program products for determining frequently occurring data items are disclosed. These include, counting distinct categories of a plurality of data items using an ordered set of counters, wherein each of the counters is associated with one of the distinct categories and represents a quantity of the data items in the associated one of the distinct categories, and wherein the counting includes updating counters in the ordered set and a global decrement counter when one of the data items fails to match at least one of the distinct categories associated with the counters of the ordered set and when the ordered set is full. These further include, reporting, for each of the counters in the ordered set, a lower bound for the associated one of the distinct categories, wherein the lower bound is based upon a value of the counter and the global decrement counter.
    Type: Application
    Filed: November 9, 2015
    Publication date: March 3, 2016
    Inventors: John Plevyak, Amit Kumar Manjhi
  • Patent number: 9183242
    Abstract: Methods, systems, and computer program products for determining frequently occurring data items are disclosed. These include, counting distinct categories of a plurality of data items using an ordered set of counters, wherein each of the counters is associated with one of the distinct categories and represents a quantity of the data items in the associated one of the distinct categories, and wherein the counting includes updating counters in the ordered set and a global decrement counter when one of the data items fails to match at least one of the distinct categories associated with the counters of the ordered set and when the ordered set is full. These further include, reporting, for each of the counters in the ordered set, a lower bound for the associated one of the distinct categories, wherein the lower bound is based upon a value of the counter and the global decrement counter.
    Type: Grant
    Filed: March 21, 2014
    Date of Patent: November 10, 2015
    Assignee: Google Inc.
    Inventors: John Plevyak, Amit Kumar Manjhi
  • Patent number: 8682864
    Abstract: Methods, systems, and computer program products for determining frequently occurring data items are disclosed. These include, counting distinct categories of a plurality of data items using an ordered set of counters, wherein each of the counters is associated with one of the distinct categories and represents a quantity of the data items in the associated one of the distinct categories, and wherein the counting includes updating counters in the ordered set and a global decrement counter when one of the data items fails to match at least one of the distinct categories associated with the counters of the ordered set and when the ordered set is full. These further include, reporting, for each of the counters in the ordered set, a lower bound for the associated one of the distinct categories, wherein the lower bound is based upon a value of the counter and the global decrement counter.
    Type: Grant
    Filed: June 20, 2012
    Date of Patent: March 25, 2014
    Assignee: Google Inc.
    Inventors: John Plevyak, Amit Kumar Manjhi