Home > Graph Data Management > Sketch-based Approach for Graphs

Sketch-based Approach for Graphs

We discussed these two papers about sketch-based approach today:

This key of sketch-based approach is finding the landmarks by random sampling for every node in a graph. Some comments:

  • The assumption for sketch-based approach is the nodes are uniformly selected. This assumption is only suitable for random graphs. For scale-free graphs, nodes have distinct priority, so the uniform sampling technique may be not the case;
  • Making whatever incremental computation based on sketch-based approach seems an explored research topic;
  • The combination of sketch-based approach and random walk may generate some very fast algorithms for PageRank/SimRank on large graphs.
Categories: Graph Data Management Tags:
  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: