Semantic Link Based Top-K Join Queries in P2P Networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizing the number of objects that have to be accessed. This paper resolves this issue by organizing peers in a Semantic Link Network Overlay, where semantic links are established to denote the semantic relationship between peers's data schemas. A query request will be routed to appropriate peers according to the semantic link type and a lower bound of rank function. Optimization strategies are proposed to reduce the total amount of data transmitted.
Liu, J., Feng, L., and He, C. 2006. Semantic link based top-K join queries in P2P networks. In Proceedings of the 15th International Conference on World Wide Web (Edinburgh, Scotland, May 23 - 26, 2006). WWW '06. ACM Press, New York, NY, 1005-1006.
Other items being presented by these speakers
in association with
Sponsor of The CIO Dinner
Become a sponsor or exhibitor
| Skip to main content | Skip to navigation |