Patent · US Active

Combinators

US10095725B2 · kind B2 · utility

3Cited by
23References
20Claims
0Family size

Assignee

Inventors

Key dates

Filing dateMar 7, 2016
Grant dateOct 9, 2018
Priority date
Expiry dateSep 30, 2036

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06F16/951
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

A method, according to one embodiment, includes storing programs to be executed by a distributed database system having three or more nodes. At a first node of the distributed database system, an N number of service tasks to add to a value in a row stored in the distributed database system at a write daemon are received from one or more caller nodes. The N number of service tasks are combined to a single row in the distributed database system at the write daemon. A number of service tasks to attend to the N number of requests is reduced by sending the N number of requests to at least two other bucket daemons on at least two other nodes that combine the N number of service tasks and executing the reduced number of service tasks in accordance with an order associated with a time of receipt.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.