1 / 14

Distributed Semantic Associations

Distributed Semantic Associations. Matt Perry Maciej Janik Conrad Ibane z. Motivation. Semantic Web, by its web nature is distributed Knowledge will be stored in multiple stores, multiple ontologies Search for semantic paths will have to include many knowledge sources. border nodes.

carney
Download Presentation

Distributed Semantic Associations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Distributed Semantic Associations Matt Perry Maciej Janik Conrad Ibanez

  2. Motivation • Semantic Web, by its web nature is distributed • Knowledge will be stored in multiple stores, multiple ontologies • Search for semantic paths will have to include many knowledge sources

  3. border nodes Distributed ρ-path problem:Find all paths from a start node to an end node over the distributed RDF graphs Knowledge bases - ontologies

  4. Assumptions • K-hop limited ρ-path search • Entity disambiguation across KBs

  5. Problems • Search Efficiency • How to continue a search from one KB to another • When to stop a search in one KB and start it in another • How to piece together path fragments

  6. KB Approach KB Peer Peer Peer KB KB Super-Peer Peer Super-Peer Peer Super-Peer Peer KB Peer Peer KB Peer KB KB KB

  7. Border Nodes KB2 KB1 Border Node

  8. Distance Between Borders KB3 KB1 End Dist(KB1KB2, KB1KB3) = 3 Dist(KB1KB2, KB2KB3) = 1 Dist(Start, KB1KB2) = 1 Dist(End, KB1KB3) = 1 KB2 Start

  9. Query Plan Graph • Basic Idea: • Add start and end node to QPG • Do path search (<= K) through QPG • Convert the paths to a set of queries

  10. Converting Paths To Queries • ρ-path (Start, End, 12) • KB1 – ρ-path (Start, KB1/KB2, 6) • KB2 - ρ-path (KB1/KB2, KB2/KB3, 5) • KB3 - ρ-path (KB2/KB3, End, 7) 3 4 Start 2 KB1/KB2 KB2/KB3 End

  11. Super-Peer Level QPG

  12. Integration of SP graph and Peer Graph

  13. Whole Process • Peer asks SP for Query Plan • SP finds endpoints and adds them to SP QPG • SP finds all Paths through SP QPG • SP converts these Paths in subquery plan requests for each SP • Each SP uses the process recursively on its peer-level QPG to form peer-level query plan • The union of the peer-level query plans is the final query plan • The peer then executes this plan

  14. Test sets Border 1/2/3 Test 3 Test 1 Team 8286 Agent 2054 Athlete 6988 Agent 2054 Athlete 2805 Agent 2457 Athlete 4343 Agent 2054 Agent 566 Athlete 7028 Test 2 Athlete 3108 Agent 2418 Agent 717 Team 8430 Agent 717 Athlete 6041 Agent 2215 Athlete 6778 Agent 1194 Agent 2215 Border 1/2 Agent 1632 Athlete 2951 Team 8405 Agent 1808

More Related