NoSQL: Paper: Efficient Subgraph Matching on Billion Node Graphs

| | bookmark | email

Paper: Efficient Subgraph Matching on Billion Node Graphs

Papers from VLDB 2012 are starting to surface. Authored by a Chinese team, the "Efficient Subgraph Matching on Billion Node Graphs" paper is introducing a new algorithm optimized for large scale graphs:

tags:graphdb,graph processing

via NoSQL databases