Abstract
We address the problem of efficiently ranking the best peers w.r.t. a query with multiple, equally weighted predicates – conjunctive queries – in shortcut overlay networks. This problem occurs when routing queries in unstructured peer-to-peer networks, such as in peer-to-peer information retrieval applications. Requirements for this task include, e.g., full autonomy of peers as well as full control over own resources. Therefore prominent resource location and query routing schemes such as distributed hash tables can not be applied in this setting. In order to tackle these requirements we combine a new resource location and query routing approach that exploits social metaphors of topical experts and experts’ experts with standard IR measures for ranking peers based on collection-wide information. The approach has been fully tested in simulation runs for skewed data distributions and network churn and has been partially implemented in the Bibster system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adar, E., Huberman, B.: Free riding on gnutella. First Monday 5(10) (October 2000)
Aho, A.V., Denning, P.J., Ullman, J.D.: Principles of optimal page replacement. J. ACM 18(1), 80–93 (1971)
Balke, W.-T., Nejdl, W., Siberski, W., Thaden, U.: Progressive distributed top-k retrieval in peer-to-peer networks. In: 21st International Conference on Data Engineering (ICDE), Tokyo, Japan (2005)
Callan, J.P., Lu, Z., Croft, W.B.: Searching distributed collections with inference networks. In: SIGIR 1995: Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 21–28. ACM Press, New York (1995)
Cholvi, V., Felber, P., Biersack, E.: Efficient search in unstructured peer-to-peer networks. European Transactions on Telecommunications: Special Issue on P2P Networking and P2P Services 15(6), 535–548 (2004)
Cooper, B.: Guiding queries to information sources with InfoBeacons. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 59–78. Springer, Heidelberg (2004)
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: International Conference on Distributed Computing Systems (July 2002)
Crespo, A., Garcia-Molina, H.: Semantic Overlay Networks for P2P Systems. Technical report, Computer Science Department, Stanford University (2002)
Cuenca-Acuna, F.M., Peery, C., Martin, R.P., Nguyen, T.D.: PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities. In: Intern. Symp. on High-Performance Distributed Computing, Seattle, USA (2003)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Symposium on Principles of Database Systems (2001)
Güntzer, U., Balke, W.-T., Kießling, W.: Optimizing multi-feature queries for image databases. In: Intern. Conf. on Very Large Databases, Cairo, Egypt (2000)
The gnutella developer forum (2004), http://rfc-gnutella.sourceforge.net
Gravano, L., García-Molina, H.: Generalizing GlOSS to vector-space databases and broker hierarchies. In: International Conference on Very Large Databases, VLDB, pp. 78–89 (1995)
Haase, P., Broekstra, J., Ehrig, M., Menken, M., Mika, P., Plechawski, M., Pyszlak, P., Schnizler, B., Siebes, R., Staab, S., Tempich, C.: Bibster - a semantics-based bibliographic peer-to-peer system. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 122–136. Springer, Heidelberg (2004)
Haase, P., et al.: Bibster - a semantics-based bibliographic peer-to-peer system. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 122–136. Springer, Heidelberg (2004)
Kirkpatrick, S., Gelatt, J.C.D., Vecchi, M.P.: Optimization by simulated annealing, pp. 606–615 (1987)
Kleinberg, J.: Navigation in a small world. Nature 406 (2000)
Li, Y., Bandar, Z.A., McLean, D.: An Approach for messuring semantic similarity between words using semantic multiple information sources. IEEE Transactions on Knowledge and Data Engineering 15 (2003)
Marian, A., Bruno, N., Gravano, L.: Evaluating top-k queries over web-accessible databases. ACM Trans. Database Syst. 29(2), 319–362 (2004)
Milgram, S.: The small world problem. Psychology Today 67(1) (1967)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. Multimedia Systems 9(2) (2003)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient Content Location Using Interest Based Locality in Peer-to-Peer System. In: Infocom. IEEE, Los Alamitos (2003)
Tempich, C., Staab, S., Wranik, A.: REMINDIN:Semantic Query Routing in Peer-to-Peer Networks based on Social Metaphers. In: Proceedings of the 13th WWW Conference. ACM Press, New York (2004)
Tempich, C., Volz, R.: Towards a benchmark for Semantic Web reasoners - an analysis of the DAML ontology library. In: Sure, Y. (ed.) Proceedings of Evaluation of Ontology-based Tools (EON 2003) at 2nd International Semantic Web Conference (ISWC 2003), October 2003, pp. 4–15 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tempich, C., Löser, A., Heizmann, J. (2005). Community Based Ranking in Peer-to-Peer Networks. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE. OTM 2005. Lecture Notes in Computer Science, vol 3761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575801_21
Download citation
DOI: https://doi.org/10.1007/11575801_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29738-3
Online ISBN: 978-3-540-32120-0
eBook Packages: Computer ScienceComputer Science (R0)