메뉴 건너뛰기




Volumn 6119 LNAI, Issue PART 2, 2010, Pages 160-167

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

Author keywords

Graph mining; Relational databases; SQL based approach

Indexed keywords

GRAPH MINING; LARGE GRAPHS; MAIN MEMORY; RELATIONAL DATABASE; RELATIONAL DATABASE MANAGEMENT SYSTEMS; SQL-BASED APPROACH; TIGHTLY-COUPLED;

EID: 79956323050     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13672-6_16     Document Type: Conference Paper
Times cited : (7)

References (10)
  • 1
    • 77956260197 scopus 로고    scopus 로고
    • GConnect: A connectivity index for massive diskresident graphs
    • Aggarwal, C., Yan, X., Yu, P.S.: GConnect: A connectivity index for massive diskresident graphs. In: Very Large Databases (VLDB), vol. 2, pp. 862-873 (2009)
    • (2009) Very Large Databases (VLDB) , vol.2 , pp. 862-873
    • Aggarwal, C.1    Yan, X.2    Yu, P.S.3
  • 2
    • 12244251830 scopus 로고    scopus 로고
    • Scalable mining of large disk-based graph databases
    • Chen, W., et al.: Scalable mining of large disk-based graph databases. In: ACM Knowledge Discovery and Data Mining (SIGKDD), pp. 316-325 (2004)
    • (2004) ACM Knowledge Discovery and Data Mining (SIGKDD , pp. 316-325
    • Chen, W.1
  • 3
    • 7444254104 scopus 로고    scopus 로고
    • DB-subdue: Database approach to graph mining
    • Advances in Knowledge Discovery and Data Mining
    • 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) (Pubitemid 38824917)
    • (2004) Lecture Notes in Computer Science , Issue.3056 , pp. 341-350
    • Chakravarthy, S.1    Beera, R.2    Balachandran, R.3
  • 4
    • 52949121451 scopus 로고    scopus 로고
    • DB-FSG: An SQL-based approach for frequent subgraph mining
    • Bhowmick, S.S., Küng, J., Wagner, R. (eds.) DEXA 2008. Springer, Heidelberg
    • 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)
    • (2008) LNCS , vol.5181 , pp. 684-692
    • Chakravarthy, S.1    Pradhan, S.2
  • 5
    • 57149132520 scopus 로고    scopus 로고
    • Efficiently answering reachability queries on very large directed graphs
    • Jin, R., et al.: Efficiently answering reachability queries on very large directed graphs. In: ACM Management of Data (SIGMOD), pp. 595-608 (2008)
    • (2008) ACM Management of Data (SIGMOD) , pp. 595-608
    • Jin, R.1
  • 7
    • 79956300437 scopus 로고    scopus 로고
    • Network datasets, http://snap.stanford.edu/data/index.html
    • Network Datasets
  • 8
    • 79956298621 scopus 로고    scopus 로고
    • Oracle PL/SQL, http://www.oracle.com/technology/tech/pl-sql/index.html
  • 9
    • 0032094477 scopus 로고    scopus 로고
    • Integrating association rule mining with relational database systems: Alternatives and implications
    • 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) (Pubitemid 128655981)
    • (1998) SIGMOD Record , vol.27 , Issue.2 , pp. 343-354
    • Sarawagi, S.1    Thomas, S.2    Agrawal, R.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.