J
James C. Dehnert
Researcher at Google
Publications - 11
Citations - 3995
James C. Dehnert is an academic researcher from Google. The author has contributed to research in topics: Graph (abstract data type) & Graph database. The author has an hindex of 6, co-authored 11 publications receiving 3708 citations.
Papers
More filters
Proceedings ArticleDOI
Pregel: a system for large-scale graph processing
Grzegorz Malewicz,Matthew H. Austern,Aart J. C. Bik,James C. Dehnert,Ilan Horn,Naty Leiser,Grzegorz Czajkowski +6 more
TL;DR: A model for processing large graphs that has been designed for efficient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier.
Proceedings ArticleDOI
Pregel: a system for large-scale graph processing - "ABSTRACT"
Grzegorz Malewicz,Matthew H. Austern,Aart J. C. Bik,James C. Dehnert,Ilan Horn,Naty Leiser,Grzegorz Czajkowski +6 more
TL;DR: The model has been designed for efficient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier.
Proceedings ArticleDOI
Pregel: a system for large-scale graph processing - "ABSTRACT"
Grzegorz Malewicz,Matthew H. Austern,Aart J. C. Bik,James C. Dehnert,Ilan Horn,Naty Leiser,Grzegorz Czajkowski +6 more
TL;DR: This work defined a model of computation and realized it through a scalable and fault-tolerant system called Pregel, with an expressive and flexible API, and inspired by Valiant's Bulk Synchronous Parallel model.
Patent
Label propagation in a distributed system
TL;DR: In this paper, a label propagation algorithm is executed for a plurality of the vertices in the graph in parallel for a series of synchronized iterations to propagate labels through the graph, where labels describe possible characteristics of an item represented by the at least one vertex.
Patent
Resolving conflicting graph mutations
Aart J. C. Bik,Matthew H. Austern,James C. Dehnert,Grzegorz Czajkowski,Grzegorz Malewicz,Naty Leiser +5 more
TL;DR: In this article, a plurality of conflicting mutation requests are received to mutate the graph and a conflict between the mutation requests is resolved with a conflict resolution function that lacks direct access to the graph data.