Technical Reports

The ICICS/CS Reading Room

UBC CS TR-2007-18 Summary

Optimizing Acquaintance Selection in a PDMS, September 28, 2007 Rachel Pottinger Jian Xu, 16 pages

In a Peer Data Management System (PDMS), autonomous peers share semantically rich data. For queries to be translated across peers, a peer must provide a mapping to other peers in the PDMS; peers connected by such mappings are called acquaintances. To maximize query answering ability, a peer needs to optimize its choice of acquaintances. This paper introduces a novel framework for performing acquaintance selection. Our framework includes two selection schemes that effectively and efficiently estimate mapping quality. The "one-shot" scheme clusters peers and estimates the improvement in query answering based on cluster properties. The "two-hop" scheme, estimates using locally available information at multiple rounds. Our empirical study shows that both schemes effectively help acquaintance selection and scale to PDMSs with large number of peers.

If you have any questions or comments regarding this page please send mail to