Authored by a team from Karlsruhe Institute of Technology, the paper “Parallel graph partitioning for complex networks” presents a parallelized and adapting label propagation technique for partitioning graphs:
The graph partitioning problem is NP-complete ,  and there is no approximation algorithm with a constant ratio factor for general graphs . Hence, heuristic algorithms are used in practice.
A successful heuristic for partitioning large graphs is the multilevel graph partitioning (MGP) approach depicted in Figure 1, where the graph is recursively contracted to achieve smaller graphs which should reflect the same basic structure as the input graph.
Words from myNoSQL’s supporters, Aerospike:
Last year, Aerospike published a ‘recipe’ describing how a database can be tuned to deliver 1 million TPS on a $5k server. This year, we simplified the recipe, applied it to Aerospike, and doubled performance using YCSB tests.
Find out how we did it in four easy steps: http://www.aerospike.com/blog/aerospike-doubles-in-memory-nosql-database-performance/
Original title and link: Four Easy Steps to Achieve 1 Million TPS on 1 Server using YCSB Benchmark [sponsor] ( ©myNoSQL)