×
  • Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
 

PMatch: Probabilistic Subgraph Matching on Huge Social Networks

by Technologist at Aurelius on Jan 24, 2012

  • 2,965 views

Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the data. In this paper, we ...

Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the data. In this paper, we propose “probabilistic subgraph” (PS) queries over a graph/network database, which afford users great flexibility in specifying “approximately” what they are looking for. We formally define the probability that a substitution satisfies a PS-query with respect to a graph database. We then present the PMATCH algorithm to answer such queries and prove its correctness. Our experimental evaluation demonstrates that PMATCH is efficient and scales to massive social networks with over a billion edges.

Statistics

Views

Total Views
2,965
Views on SlideShare
1,097
Embed Views
1,868

Actions

Likes
1
Downloads
6
Comments
0

5 Embeds 1,868

http://www.knowledgefrominformation.com 1857
http://translate.googleusercontent.com 4
http://www.knowledgefrominformation.de 3
http://webcache.googleusercontent.com 2
http://knowledgefrominformation.de 2

Accessibility

Upload Details

Uploaded via SlideShare as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
Post Comment
Edit your comment

PMatch: Probabilistic Subgraph Matching on Huge Social Networks PMatch: Probabilistic Subgraph Matching on Huge Social Networks Presentation Transcript