A Framework for SQL-Based Mining of Large Graphs on Relational Databases Authors: Sriganesh Srihari, Shruti Chandrashekar, Srinivasan Parthasarathy Keywords: Graph mining, SQL-based approach, Relational databases
Abstract:
We design and develop an SQL-based approach for querying and mining large graphs within a relational database management system (RDBMS). We propose a simple lightweight framework to integrate graph applications with the RDBMS through a tightly-coupled network layer, thereby leveraging efficient features of modern databases. Comparisons with straight-up main memory implementations of two kernels – breadth-first search and quasi clique detection – reveal that SQL implementations offer an attractive option in terms of productivity and performance.
Something for those with SQL backends for topic maps.
Implemented using PL/SQL so it isn’t clear how much work it would take to implement this framework on MySQL or Postgres.
If your topic map won’t fit into memory, might be worth a look.