Abstract
Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional “resource selection” problem. The decision-theoretic framework for resource selection aims, in contrast to other approaches, at minimising overall costs including e.g. monetary costs, time and retrieval quality. A variant of this framework has been successfully applied to hierarchical peer-to-peer networks (where peers are partitioned into DL peers and hubs), but that approach considers retrieval quality only. This paper proposes a new model which is capable of considering also the time costs of hubs (i.e., the number of hops in subsequent steps). The evaluation on a large test-bed shows that this approach dramatically reduces the overall retrieval costs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Callan, J.P., Lu, Z., Croft, W.B.: Searching distributed collections with inference networks. In: Fox, E.A., Ingwersen, P., Fidel, R. (eds.) Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 21–29. ACM Press, New York (1995)
French, J., et al.: Comparing the performance of database selection algorithms. In: Proceedings of the 22nd International Conference on Research and Development in Information Retrieval, pp. 238–245. ACM Press, New York (1999)
Fuhr, N.: A decision-theoretic approach to database selection in networked IR. ACM Transactions on Information Systems 17(3), 229–249 (1999)
Gravano, L., Garcia-Molina, H.: Generalizing GIOSS to vector-space databases and broker hierarchies. In: Dayal, U., Gray, P.M.D., Nishio, S. (eds.) VLDB’95, Proceedings of 21th International Conference on Very Large Data Bases, Los Altos, California, pp. 78–89. Morgan Kaufmann, San Francisco (1995)
Lu, J., Callan, J.: Content-based retrieval in hybrid peer-to-peer networks. In: Kraft, D., et al. (eds.) Proceedings of the 12th International Conference on Information and Knowledge Management, ACM Press, New York (2003)
Lu, J., Callan, J.: Federated search of text-based digital libraries in hierarchical peer-to-peer networks. In: Callan, J., Fuhr, N., Nejdl, W. (eds.) SIGIR Workshop on Peer-to-Peer Information Retrieval (2004)
Nottelmann, H., Fuhr, N.: Evaluating different methods of estimating retrieval quality for resource selection. In: Callan, J., et al. (eds.) Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM Press, New York (2003)
Nottelmann, H., Fuhr, N.: Comparing different architectures for query routing in peer-to-peer networks. In: Lalmas, M., et al. (eds.) ECIR 2006. LNCS, vol. 3936, pp. 253–264. Springer, Heidelberg (2006)
Ritter, J.: Why Gnutella can’t scale. No, really (2001), http://www.darkridge.com/~jpr5/doc/gnutella.html
Robertson, S.E., et al.: Okapi at TREC. In: Text REtrieval Conference, pp. 21–30 (1992)
Schlosser, M., et al.: Digital libraries. In: 1st Workshop on Agents and P2P Computing (2005)
Si, L., Callan, J.: A semi-supervised learning method to merge search engine results. ACM Transactions on Information Systems 24, 457–491 (2003)
Si, L., et al.: Language modeling framework for resource selection and results merging. In: Nicholas, C., et al. (eds.) Proceedings of the 11th International Conference on Information and Knowledge Management, ACM Press, New York (2002), http://www-2.cs.cmu.edu/~callan/Papers/cikm02-lsi.pdf
Stoica, I., et al.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM, ACM Press, New York (2001), http://www.acm.org/sigcomm/sigcomm2001/p12-stoica.pdf
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Nottelmann, H., Fuhr, N. (2007). A Decision-Theoretic Model for Decentralised Query Routing in Hierarchical Peer-to-Peer Networks. In: Amati, G., Carpineto, C., Romano, G. (eds) Advances in Information Retrieval. ECIR 2007. Lecture Notes in Computer Science, vol 4425. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71496-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-71496-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71494-1
Online ISBN: 978-3-540-71496-5
eBook Packages: Computer ScienceComputer Science (R0)