Abstract
Knowledge sharing in a virtual organization requires a knowledge life cycle including knowledge provisioning, terminology alignment, determination of resource location, query routing, and query answering. In this talk we focus on the issue of determining a relevant resource in a completely decentralized setting such as necessitated by peer-to-peer knowledge management in virtual organizations. Requirements for this task include, e.g., full autonomy of peers as well as full control over own resources and therefore preclude prominent resource location and query routing schemes such as distributed hash tables. In order to tackle given requirements we use a resource location and query routing approach that exploits social metaphors of topical experts and experts’ experts as well as semantic similarity of queries and information sources. The approach has been fully tested in simulation runs and partially implemented in the system Bibster (http://bibster.semanticweb.org).
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
Aho, A.V., Denning, P.J., Ullman, J.D.: Principles of optimal page replacement. J. ACM 18(1), 80–93 (1971)
Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. ACM Comput. Surv. 36(4), 335–371 (2004)
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: International Conference on Distributed Computing Systems (July 2002)
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., 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)
Iamnitchi, A., Ripeanu, M., Foster, I.: Small-World File-Sharing Communities. In: 23th. IEEE InfoCom HongKong (2004)
Keleher, P.J., Bhattacharjee, B., Silaghi, B.D.: Are virtualized overlay networks too much of a good thing? In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 225–231. Springer, Heidelberg (2002)
Kleinberg, J.: Navigation in a small world. Nature 406 (2000)
Li, Y., Bandar, Z., McLean, D.: An Approach for messuring semantic similarity between words using semantic multiple information sources. IEEE Transactions on Knowledge and Data Engineering 15 (2003)
Löser, A., Tempich, C., Quilitz, B., Balke, W.-T., Staab, S., Nejdl, W.: Searching dynamic communities with personal indexes. Technical report, University of Karlsruhe, Institute AIFB (2005)
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, New York (2004)
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
Löser, A., Staab, S., Tempich, C. (2005). Semantic Methods for P2P Query Routing. In: Eymann, T., Klügl, F., Lamersdorf, W., Klusch, M., Huhns, M.N. (eds) Multiagent System Technologies. MATES 2005. Lecture Notes in Computer Science(), vol 3550. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550648_2
Download citation
DOI: https://doi.org/10.1007/11550648_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28740-7
Online ISBN: 978-3-540-28741-4
eBook Packages: Computer ScienceComputer Science (R0)