| Document Date: 2014-05-16 18:11:48
Open Document File Size: 388,43 KBShare Result on Facebook
Company Vertex / Google / / Currency USD / / / IndustryTerm graph processing systems / asynchronous graph systems / it challenging to write algorithms / distributed and highly-parallel shared-nothing systems / approximate betweenness-centrality algorithm / graph algorithm / graph systems / subgraph finding algorithms / telecommunications / detail several graph algorithms / maximal independent set algorithm / graph processing / minimum spanning tree algorithm / breadth-first search / synchronous graph processing engines / web-pages / social networks / tree algorithm / approximate maximum weight matching algorithm / partial solutions / synchronous graph processing systems / large-scale data processing / graph algorithms / bipartite matching algorithm / higher-level graph processing primitives / computation using algorithm / / Organization UC Berkeley / Stanford University / nbrValue.authority / / Person Jennifer Widom / / Position vP takes / vP / pushing predicate vP / vP Description / given vP / predicate vP / vertex predicate vP / vP / the aggregation / vP predicate / Spark interpreter / programmer / / Product GraphX / Spark / / ProgrammingLanguage Java / Scala / / SportsLeague Stanford University / / Technology graph algorithms / matching-like algorithms / HITS algorithm / subgraph finding algorithms / graph algorithm / Java / set algorithm / API / example algorithms / approximate betweenness-centrality algorithm / GPS / clustering algorithm / components algorithm / spanning tree algorithm / bipartite matching algorithm / METIS partitioning algorithm / computation using algorithm / that implementing algorithms / minimum spanning tree algorithm / approximate maximum weight matching algorithm / /
SocialTag |
HelP: High-level Primitives For Large-Scale Graph Processing Semih Salihoglu Jennifer Widom