Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, Balanced Allocations, SIAM Journal on Computing, vol.29, issue.1, pp.180-200, 1999.
DOI : 10.1137/S0097539795288490

J. A. Cain, P. Sanders, and N. C. Wormald, The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation, SODA, pp.469-476, 2007.

B. Dsk-+-13-]-elif-dede, P. Sendir, J. Kuzlu, M. Hartog, and . Govindaraju, An evaluation of cassandra for hadoop, 2013 IEEE Sixth International Conference on Cloud Computing, pp.494-501, 2013.

M. Farach-colton and M. Tsai, Computing the Degeneracy of Large Graphs, LATIN 2014: Theoretical Informatics -11th Latin American Symposium Proceedings, pp.250-260, 2014.
DOI : 10.1007/978-3-642-54423-1_22

J. Kuhlenkamp, M. Klems, and O. Röss, Benchmarking scalability and elasticity of distributed database systems, Proceedings of the VLDB Endowment, vol.7, issue.12, pp.1219-1230, 2014.
DOI : 10.14778/2732977.2732995
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.434.4030

A. Lakshman and P. Malik, Cassandra, ACM SIGOPS Operating Systems Review, vol.44, issue.2, pp.35-40, 2010.
DOI : 10.1145/1773912.1773922

A. Metwally, D. Agrawal, and . Abbadi, Efficient Computation of Frequent and Top-k Elements in Data Streams, ICDT, pp.398-412, 2005.
DOI : 10.1007/978-3-540-30570-5_27

E. Schurman and J. Brutlag, Performance related changes and their user impact, 2009.