Skip to main content
SpringerLink
Log in

A Framework for SQL-Based Mining of Large Graphs on Relational Databases

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6119))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, C., Yan, X., Yu, P.S.: GConnect: A connectivity index for massive disk-resident graphs. In: Very Large Databases (VLDB), vol. 2, pp. 862–873 (2009)

    Google Scholar 

  2. Chen, W., et al.: Scalable mining of large disk-based graph databases. In: ACM Knowledge Discovery and Data Mining (SIGKDD), pp. 316–325 (2004)

    Google Scholar 

  3. Chakravarthy, S., Beera, R., Balachandran, R.: DB-Subdue: Database approach to graph mining. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 341–350. Springer, Heidelberg (2004)

    Google Scholar 

  4. Chakravarthy, S., Pradhan, S.: DB-FSG: An SQL-based approach for frequent subgraph mining. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds.) DEXA 2008. LNCS, vol. 5181, pp. 684–692. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Jin, R., et al.: Efficiently answering reachability queries on very large directed graphs. In: ACM Management of Data (SIGMOD), pp. 595–608 (2008)

    Google Scholar 

  6. Mishra, P., Chakravarthy, S.: Performance evaluation and analysis of k-way join variants for association rule mining. In: James, A., Younas, M., Lings, B. (eds.) BNCOD 2003. LNCS, vol. 2712, pp. 95–114. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Network datasets, http://snap.stanford.edu/data/index.html

  8. Oracle PL/SQL, http://www.oracle.com/technology/tech/pl_sql/index.html

  9. Sarawagi, S., Thomas, S., Agarwal, R.: Integrating mining with relational database systems: Alternatives and implications. In: ACM Management of Data (SIGMOD), pp. 343–354 (1998)

    Google Scholar 

  10. Srihari, S., Ng, H.K., Ning, K., Leong, H.W.: Detecting hubs and quasi cliques in scale-free networks. In: IEEE Pattern Recognition (ICPR), pp. 1–4 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, National University of Singapore, Singapore, 117590

    Sriganesh Srihari

  2. New Jersey Institute of Technology, Newark, NJ, 07102

    Shruti Chandrashekar

  3. The Ohio State University, Columbus, OH, 43210

    Srinivasan Parthasarathy

Authors
  1. Sriganesh Srihari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shruti Chandrashekar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Srinivasan Parthasarathy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Rensselaer Polytechnic Institute, USA

    Mohammed J. Zaki

  2. The Chinese University of Hong Kong, China

    Jeffrey Xu Yu

  3. IIT Madras, Chennai, India

    B. Ravindran

  4. IIIT, Hyderabad, India

    Vikram Pudi

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srihari, S., Chandrashekar, S., Parthasarathy, S. (2010). A Framework for SQL-Based Mining of Large Graphs on Relational Databases. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2010. Lecture Notes in Computer Science(), vol 6119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13672-6_16

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13671-9

  • Online ISBN: 978-3-642-13672-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation