메뉴 건너뛰기




Volumn 7, Issue 3, 2013, Pages 193-204

From "think like a vertex" to "think like a graph"

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; ITERATIVE METHODS; MACHINERY; MESSAGE PASSING; OPEN SOURCE SOFTWARE; OPEN SYSTEMS; SCHEDULING;

EID: 84887545161     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2732232.2732238     Document Type: Conference Paper
Times cited : (303)

References (25)
  • 1
  • 7
    • 85030321143 scopus 로고    scopus 로고
    • MapReduce: simplified data processing on large clusters
    • J. Dean and S. Ghemawat. MapReduce: simplified data processing on large clusters. In OSDI'04, pages 137-150, 2004.
    • (2004) In OSDI'04, pages , pp. 137-150
    • Dean, J.1    Ghemawat, S.2
  • 11
    • 84887508060 scopus 로고    scopus 로고
    • A coarse-grain parallel formulation of multilevel k-way graph partitioning algorithm
    • G. Karypis and V. Kumar. A coarse-grain parallel formulation of multilevel k-way graph partitioning algorithm. In SIAM PP'97, 1997.
    • (1997) In SIAM PP'97
    • Karypis, G.1    Kumar, V.2
  • 12
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359-392, 1998.
    • (1998) SIAM J. Sci. Comput. , vol.20 , Issue.1 , pp. 359-392
    • Karypis, G.1    Kumar, V.2
  • 13
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, 1999.
    • (1999) J. ACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.M.1
  • 17
    • 0035420724 scopus 로고    scopus 로고
    • Clustering and preferential attachment in growing networks
    • 025102
    • M. E. J. Newman. Clustering and preferential attachment in growing networks. Phys. Rev. E, 64:025102, 2001.
    • (2001) Phys. Rev. E , vol.64
    • Newman, M.E.J.1
  • 21
    • 84866012887 scopus 로고    scopus 로고
    • Streaming graph partitioning for large distributed graphs
    • I. Stanton and G. Kliot. Streaming graph partitioning for large distributed graphs. In KDD'12, pages 1222-1230, 2012.
    • (2012) In KDD'12 , pp. 1222-1230
    • Stanton, I.1    Kliot, G.2
  • 22
    • 57149123533 scopus 로고    scopus 로고
    • Efficient aggregation for graph summarization
    • Y. Tian, R. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In SIGMOD'08, pages 419-432, 2008.
    • (2008) In SIGMOD'08 , pp. 419-432
    • Tian, Y.1    Hankins, R.2    Patel, J.M.3
  • 23
    • 85084012076 scopus 로고    scopus 로고
    • Asynchronous large-scale graph processing made easy
    • G. Wang, W. Xie, A. Demers, and J. Gehrke. Asynchronous large-scale graph processing made easy. In CIDR'13, 2013.
    • (2013) In CIDR'13
    • Wang, G.1    Xie, W.2    Demers, A.3    Gehrke, J.4
  • 24
    • 84862657680 scopus 로고    scopus 로고
    • Towards effective partition management for large graphs
    • S. Yang, X. Yan, B. Zong, and A. Khan. Towards effective partition management for large graphs. In SIGMOD'12, pages 517-528, 2012.
    • (2012) In SIGMOD'12 , pp. 517-528
    • Yang, S.1    Yan, X.2    Zong, B.3    Khan, A.4
  • 25
    • 84863903790 scopus 로고    scopus 로고
    • Accelerate large-scale iterative computation though asynchronous accumulative updates
    • Y. Zhang, Q. Gao, L. Gao, and C. Wang. Accelerate large-scale iterative computation though asynchronous accumulative updates. In ScienceCloud'12, pages 13-22, 2012.
    • (2012) In ScienceCloud'12 , pp. 13-22
    • Zhang, Y.1    Gao, Q.2    Gao, L.3    Wang, C.4


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