1. A method of managing a distributed database system comprising: at the distributed database system having three or more nodes each with processors and memory, storing programs to be executed by the processors; at a first node, atomically receiving an N number of add requests to add to a value in a row stored in the distributed database system at a write daemon from one or more caller nodes of the distributed database system; time recording the receipt of the N number of add requests; atomically combining the N number of add requests to the same row in the distributed database system at the write daemon before initiating operations to attend to the N number of add requests; delaying at the write daemon to wait for more add requests to the same row; atomically reducing the number of operations to attend to the N number of requests by sending the N number of requests to at least two bucket daemons on at least two other nodes, wherein each of the at least two other nodes contains at least one of the at least two bucket daemon; receiving the N number of requests at the at least two bucket daemons on the at least two other nodes; combining the N number of add requests at the at least two bucket daemons on the at least two other nodes delaying at the at least two bucket daemons until a set amount of data has been received; and executing the reduced number of add operations in accordance with the time record order.