메뉴 건너뛰기




Volumn , Issue , 2013, Pages

GPS: A graph processing system

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY LISTS; COMPLEX ALGORITHMS; DOMAIN-SPECIFIC PROGRAMMING LANGUAGES; FAULT-TOLERANT; GRAPH PARTITIONING; GRAPH PROCESSING; IMPROVE PERFORMANCE; PERFORMANCE EFFECT;

EID: 84883033292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2484838.2484843     Document Type: Conference Paper
Times cited : (165)

References (39)
  • 2
    • 84870452716 scopus 로고    scopus 로고
    • Apache Hadoop. http://hadoop.apache.org/.
    • Apache Hadoop
  • 3
    • 84870749286 scopus 로고    scopus 로고
    • Apache Mahout. http://mahout.apache.org/.
    • Apache Mahout
  • 4
    • 84882977640 scopus 로고    scopus 로고
    • Apache MINA. http://mina.apache.org/.
    • Apache MINA
  • 6
    • 84856239167 scopus 로고    scopus 로고
    • Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks
    • P. Boldi, M. Rosa, M. Santini, and S. Vigna. Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In WWW, 2011.
    • (2011) WWW
    • Boldi, P.1    Rosa, M.2    Santini, M.3    Vigna, S.4
  • 7
    • 19944376183 scopus 로고    scopus 로고
    • The webgraph framework I: Compression techniques
    • P. Boldi and S. Vigna. The WebGraph framework I: Compression techniques. In WWW, 2004.
    • (2004) WWW
    • Boldi, P.1    Vigna, S.2
  • 8
    • 0035648637 scopus 로고    scopus 로고
    • A faster algorithm for betweenness centrality
    • U. Brandes. A faster algorithm for betweenness centrality. The Journal of Mathematical Sociology, 25(2):163-177, 2001.
    • (2001) The Journal of Mathematical Sociology , vol.25 , Issue.2 , pp. 163-177
    • Brandes, U.1
  • 9
    • 0002505172 scopus 로고    scopus 로고
    • The anatomy of large-scale hypertextual web search engine
    • S. Brin and L. Page. The Anatomy of Large-Scale Hypertextual Web Search Engine. In WWW, 1998.
    • (1998) WWW
    • Brin, S.1    Page, L.2
  • 10
    • 79956351190 scopus 로고    scopus 로고
    • HaLoop: Efficient iterative data processing on large clusters
    • Y. Bu, B. Howe, M. Balazinska, and M. D. Ernst. HaLoop: Efficient Iterative Data Processing on Large Clusters. In VLDB, 2010.
    • (2010) VLDB
    • Bu, Y.1    Howe, B.2    Balazinska, M.3    Ernst, M.D.4
  • 13
    • 77954738940 scopus 로고    scopus 로고
    • Large graph processing in the cloud
    • R. Chen, X. Weng, B. He, and M. Yang. Large Graph Processing in the Cloud. In SIGMOD, 2010.
    • (2010) SIGMOD
    • Chen, R.1    Weng, X.2    He, B.3    Yang, M.4
  • 14
    • 85030321143 scopus 로고    scopus 로고
    • MapReduce: Simplified data processing on large clusters
    • J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI, 2004.
    • (2004) OSDI
    • Dean, J.1    Ghemawat, S.2
  • 16
    • 84883048882 scopus 로고    scopus 로고
    • GoldenOrb. http://www.raveldata.com/goldenorb/.
    • GoldenOrb
  • 17
    • 78149260479 scopus 로고    scopus 로고
    • The parallel BGL: A generic library for distributed graph computations
    • D. Gregor and A. Lumsdaine. The Parallel BGL: A Generic Library for Distributed Graph Computations. In POOSC, 2005.
    • (2005) POOSC
    • Gregor, D.1    Lumsdaine, A.2
  • 19
    • 84858785554 scopus 로고    scopus 로고
    • Green-marl: A DSL for easy and efficient graph analysis
    • S. Hong, H. Chafi, E. Sedlar, and K. Olukotun. Green-Marl: A DSL for Easy and Efficient Graph Analysis. In ASPLOS, 2012.
    • (2012) ASPLOS
    • Hong, S.1    Chafi, H.2    Sedlar, E.3    Olukotun, K.4
  • 21
    • 84862700181 scopus 로고    scopus 로고
    • Scalable SPARQL querying of large RDF graphs
    • J. Huang, D. J. Abadi, and K. Ren. Scalable SPARQL Querying of Large RDF Graphs. In VLDB, 2011.
    • (2011) VLDB
    • Huang, J.1    Abadi, D.J.2    Ren, K.3
  • 22
    • 77951152705 scopus 로고    scopus 로고
    • PEGASUS: A peta-scale graph mining system - implementation and observations
    • U. Kang, C. E. Tsourakakis, and C. Faloutsos. PEGASUS: A peta-scale graph mining system - Implementation and Observations. In ICDM, 2009.
    • (2009) ICDM
    • Kang, U.1    Tsourakakis, C.E.2    Faloutsos, C.3
  • 28
    • 84882942199 scopus 로고    scopus 로고
    • MPICH2. http://www.mcs.anl.gov/research/projects/mpich2/.
    • MPICH2
  • 29
    • 84882955390 scopus 로고    scopus 로고
    • Open MPI. http://www.open-mpi.org/.
    • Open MPI
  • 30
    • 84882995201 scopus 로고    scopus 로고
    • Phoebus. https://github.com/xslogic/phoebus.
    • Phoebus
  • 31
    • 33645964737 scopus 로고    scopus 로고
    • RDF Primer
    • RDF Primer. W3C Recommendation. http://www.w3.org/TR/rdf-primer.
    • W3C Recommendation
  • 33
    • 84980380932 scopus 로고    scopus 로고
    • Streaming graph partitioning for large distributed graphs
    • I. Stanton and G. Kliot. Streaming Graph Partitioning for Large Distributed Graphs. In KDD, 2011.
    • (2011) KDD
    • Stanton, I.1    Kliot, G.2
  • 34
    • 84880554282 scopus 로고    scopus 로고
    • Signal/collect: Graph algorithms for the (semantic) web
    • P. Stutz, A. Bernstein, and W. W. Cohen. Signal/Collect: Graph Algorithms for the (Semantic) Web. In ISWC, 2010.
    • (2010) ISWC
    • Stutz, P.1    Bernstein, A.2    Cohen, W.W.3
  • 35
    • 84883031043 scopus 로고    scopus 로고
    • Trinity. http://http://research.microsoft.com/en-us/projects/trinity/ default.aspx.
    • Trinity
  • 36
    • 0025467711 scopus 로고
    • A bridging model for parallel computation
    • L. G. Valiant. "A Bridging Model for Parallel Computation". Communications of the ACM, 33(8):103-111, 1990.
    • (1990) Communications of the ACM , vol.33 , Issue.8 , pp. 103-111
    • Valiant, L.G.1
  • 37
    • 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, 2012.
    • (2012) SIGMOD
    • Yang, S.1    Yan, X.2    Zong, B.3    Khan, A.4


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