A framework for SQL-Based mining of large graphs on relational databases

Authors:
Sriganesh Srihari;Shruti Chandrashekar;Srinivasan Parthasarathy
Affiliations:
School of Computing, National University of Singapore, Singapore;New Jersey Institute of Technology, Newark, NJ;The Ohio State University, Columbus, OH
Venue:
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Year:
2010

Citing 6
Cited 2

Integrating association rule mining with relational database systems: alternatives and implications

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Scalable mining of large disk-based graph databases

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficiently answering reachability queries on very large directed graphs

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
DB-FSG: An SQL-Based Approach for Frequent Subgraph Mining

DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
GConnect: a connectivity index for massive disk-resident graphs

Proceedings of the VLDB Endowment
Performance evaluation and analysis of K-way join variants for association rule mining

BNCOD'03 Proceedings of the 20th British national conference on Databases

Relational approach for shortest path discovery over large graphs

Proceedings of the VLDB Endowment
Probabilistic graph summarization

WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management

Quantified Score

Hi-index	0.00

Visualization

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.