S. Androutsellis-theotokis and D. Spinellis, A survey of peer-to-peer content distribution technologies, ACM Computing Surveys, vol.36, issue.4, pp.335-371, 2004.
DOI : 10.1145/1041680.1041681

D. Tsoumakos and N. Roussopoulos, Analysis and comparison of P2P search methods, Proceedings of the 1st international conference on Scalable information systems , InfoScale '06, p.25, 2006.
DOI : 10.1145/1146847.1146872

L. Ramaswamy, J. Chen, and P. Parate, CoQUOS: Lightweight Support for Continuous Queries in Unstructured Overlays, 2007 IEEE International Parallel and Distributed Processing Symposium, pp.1-10, 2007.
DOI : 10.1109/IPDPS.2007.370301

S. Schmid and R. Wattenhofer, Structuring Unstructured Peer-to-Peer Networks, Proceedings of IEEE Int. Conf. on High Performance Computing (HiPC), pp.432-442, 2007.
DOI : 10.1007/978-3-540-77220-0_40

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. Akbarinia, E. Pacitti, and P. Valduriez, Reducing network traffic in unstructured P2P systems using Top-k queries, Distributed and Parallel Databases, pp.67-86, 2006.
DOI : 10.1007/s10619-006-8313-5

URL : https://hal.archives-ouvertes.fr/hal-00416447

S. Chaudhuri and L. Gravano, Evaluating top-k selection queries, Proceedings of Int. Conf. on Very Large Databases (VLDB), pp.397-410, 1999.

V. Hristidis, N. Koudas, and Y. Papakonstantinou, Prefer: a system for the efficient execution of multi-parametric ranked queries, Proceedings of ACM. Int Conf. on Management of Data (SIGMOD), pp.259-270, 2001.

W. Balke, W. Nejdl, W. Siberski, and U. Thaden, Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks, 21st International Conference on Data Engineering (ICDE'05), pp.174-185, 2005.
DOI : 10.1109/ICDE.2005.115

K. Hose, M. Karnstedt, K. Sattler, and D. Zinn, Processing top-n queries in p2p-based web integration systems with probabilistic guarantees, Proceedings of International Workshop on web and databases (WebDB), pp.109-114, 2005.

K. Zhao, Y. Tao, and S. Zhou, Efficient top-k processing in large-scaled distributed environments, Data & Knowledge Engineering, vol.63, issue.2, pp.315-335, 2007.
DOI : 10.1016/j.datak.2007.03.012

A. Vlachou, C. Doulkeridis, K. Nørvåg, and M. Vazirgiannis, On efficient top-k query processing in highly distributed environments, Proceedings of the 2008 ACM SIGMOD international conference on Management of data , SIGMOD '08, pp.753-764, 2008.
DOI : 10.1145/1376616.1376692

I. Tatarinov, Z. G. Ives, J. Madhavan, A. Y. Halevy, D. Suciu et al., The Piazza peer data management project, ACM SIGMOD Record, vol.32, issue.3, pp.47-52, 2003.
DOI : 10.1145/945721.945732

B. C. Ooi, Y. Shu, and K. Tan, Relational data sharing in peer-based data management systems, ACM SIGMOD Record, vol.32, issue.3, pp.59-64, 2003.
DOI : 10.1145/945721.945734

R. Akbarinia, V. Martins, E. Pacitti, and P. Valduriez, Global Data Management, 2006.

M. Jelasity, A. Montresor, G. P. Jesi, and S. Voulgaris, The Peersim simulator

P. K. Gummadi, S. Saroiu, and S. D. Gribble, A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems, ACM SIGCOMM Computer Communication Review, vol.32, issue.1, p.82, 2002.
DOI : 10.1145/510726.510756

M. Shmueli-scheuer, C. Li, Y. Mass, H. Roitman, R. Schenkel et al., Best-Effort Top-k Query Processing Under Budgetary Constraints, 2009 IEEE 25th International Conference on Data Engineering, pp.928-939, 2009.
DOI : 10.1109/ICDE.2009.109

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

S. Chaudhuri, L. Gravano, and A. Marian, Optimizing top-k selection queries over multimedia repositories, IEEE Transactions on Knowledge and Data Engineering, vol.16, issue.8, pp.992-1009, 2004.
DOI : 10.1109/TKDE.2004.30

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

U. Güntzer, W. Balke, and W. Kießling, Optimizing multi-feature queries for image databases, Proceedings of Int. Conf. on Very Large DataBases (VLDB), pp.419-428, 2000.

N. Bruno, L. Gravano, and A. Marian, Evaluating top-k queries over webaccessible databases, Proceedings of Int. Conf on Data Engineering (ICDE), pp.369-380, 2002.

R. Akbarinia, E. Pacitti, and P. Valduriez, Best position algorithms for top-k queries, Proceedings of Int. Conf. on Very Large Data Bases (VLDB), pp.495-506, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00378836

R. Fagin, A. Lotem, and M. Naor, Optimal aggregation algorithms for middleware, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '01, pp.102-113, 2001.
DOI : 10.1145/375551.375567

P. Cao and Z. Wan, Efficient top-K query calculation in distributed networks, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.206-215, 2004.
DOI : 10.1145/1011767.1011798

S. Michel, P. Triantafillou, and G. Weikum, Klee: A framework for distributed top-k query algorithms, Proceedings of Int. Conf. on Very Large Data Bases (VLDB), pp.637-648, 2005.

F. M. Cuenca-acuna, C. Peery, R. P. Martin, and T. D. Nguyen, PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on, pp.236-249, 2003.
DOI : 10.1109/HPDC.2003.1210033