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

Document Type

Conference Proceeding

Publication Date

12-1-2010

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 - readth-first search and quasi clique detection - reveal that SQL implementations offer an attractive option in terms of productivity and performance. © 2010 Springer-Verlag Berlin Heidelberg.

Identifier

79956323050 (Scopus)

ISBN

[3642136710, 9783642136719]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/978-3-642-13672-6_16

e-ISSN

16113349

ISSN

03029743

First Page

160

Last Page

167

Issue

PART 2

Volume

6119 LNAI

This document is currently not available here.

Share

COinS