Abstract: Example implementations relate to optimizing operation of microservice clusters comprising multiple nodes, each executing a common self-sufficient microservice instance. The method includes, at a first node having a database instance comprising a plurality of rows and a plurality of columns, calculating a distinct hash per row to create a hash list, each hash identifying data contained in the respective row; publishing a distinct hash and/or the hash list to one or more of the plurality of nodes, each node having respective database instances and respective hash lists; at a second node, comparing the distinct hash and/the hash list published by the first node to the hash list of the second node to identify any missing rows of data; and, in response to identifying, based on the comparison, a missing row(s) in the second node's database instance, updating the second node's database instance to include the missing row(s) of data.