%0 Generic %1 Bonifati2011 %A Bonifati, Angela %A Summa, Gianvito %A Pacitti, Esther %A Draidi, Fady %D 2011 %K db query_language query_reformulation semantic_web %T Semantic Query Reformulation in Social PDMS %U http://arxiv.org/PS_cache/arxiv/pdf/1111/1111.6084v1.pdf %X We consider social peer-to-peer data management systems (PDMS), where each peer maintains both semantic mappings between its schema and some acquaintances, and social links with peer friends. In this context, reformulating a query from a peer's schema into other peer's schemas is a hard problem, as it may generate as many rewritings as the set of mappings from that peer to the outside and transitively on, by eventually traversing the entire network. However, not all the obtained rewritings are relevant to a given query. In this paper, we address this problem by inspecting semantic mappings and social links to find only relevant rewritings. We propose a new notion of 'relevance' of a query with respect to a mapping, and, based on this notion, a new semantic query reformulation approach for social PDMS, which achieves great accuracy and flexibility. To find rapidly the most interesting mappings, we combine several techniques: (i) social links are expressed as FOAF (Friend of a Friend) links to characterize peer's friendship and compact mapping summaries are used to obtain mapping descriptions; (ii) local semantic views are special views that contain information about external mappings; and (iii) gossiping techniques improve the search of relevant mappings. Our experimental evaluation, based on a prototype on top of PeerSim and a simulated network demonstrate that our solution yields greater recall, compared to traditional query translation approaches proposed in the literature.

@misc{Bonifati2011, abstract = { We consider social peer-to-peer data management systems (PDMS), where each peer maintains both semantic mappings between its schema and some acquaintances, and social links with peer friends. In this context, reformulating a query from a peer's schema into other peer's schemas is a hard problem, as it may generate as many rewritings as the set of mappings from that peer to the outside and transitively on, by eventually traversing the entire network. However, not all the obtained rewritings are relevant to a given query. In this paper, we address this problem by inspecting semantic mappings and social links to find only relevant rewritings. We propose a new notion of 'relevance' of a query with respect to a mapping, and, based on this notion, a new semantic query reformulation approach for social PDMS, which achieves great accuracy and flexibility. To find rapidly the most interesting mappings, we combine several techniques: (i) social links are expressed as FOAF (Friend of a Friend) links to characterize peer's friendship and compact mapping summaries are used to obtain mapping descriptions; (ii) local semantic views are special views that contain information about external mappings; and (iii) gossiping techniques improve the search of relevant mappings. Our experimental evaluation, based on a prototype on top of PeerSim and a simulated network demonstrate that our solution yields greater recall, compared to traditional query translation approaches proposed in the literature. }, added-at = {2011-11-28T10:51:49.000+0100}, author = {Bonifati, Angela and Summa, Gianvito and Pacitti, Esther and Draidi, Fady}, biburl = {https://www.bibsonomy.org/bibtex/2b19bd4bc44318c1aaa78a2fcd59ea480/maxirichter}, description = {Semantic Query Reformulation in Social PDMS}, interhash = {35af7dde469c6568829a65b19c0be6c2}, intrahash = {b19bd4bc44318c1aaa78a2fcd59ea480}, keywords = {db query_language query_reformulation semantic_web}, note = {cite arxiv:1111.6084Comment: 29 pages, 8 figures, query rewriting in PDMS}, timestamp = {2012-01-16T12:21:57.000+0100}, title = {Semantic Query Reformulation in Social PDMS}, url = {http://arxiv.org/PS_cache/arxiv/pdf/1111/1111.6084v1.pdf}, year = 2011 }