Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dmitri Petrov

dblp:91/11411 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 67% Storage systems · 25% Cloud and datacenter computing · 8%
Databases, data mining, and information retrieval
3 papers
Graph data management · 49% Distributed and cloud data management · 23% Database system architecture and tuning · 21%

Topics — the 4 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
replication
0.412020
FlightTracker: Consistency across Read-Optimized Online Stores at Facebook · OSDI 2020
Storage systems
distributed storage
0.212013
TAO: Facebook's Distributed Data Store for the Social Graph · USENIX ATC 2013
Database system architecture and tuning › analytical database system
read-optimized database
0.112020
FlightTracker: Consistency across Read-Optimized Online Stores at Facebook · OSDI 2020
Cloud and datacenter computing
datacenter storage
0.012013
TAO: Facebook's Distributed Data Store for the Social Graph · USENIX ATC 2013

Methods — techniques the papers use, named apart from their topics

distributed implementation · 0.1
YearPublicationVenuePosition
2024 Bayesian inference of relative fitness on high-throughput pooled competition assays
abstract
The tracking of lineage frequencies via DNA barcode sequencing enables the quantification of microbial fitness. However, experimental noise coming from biotic and abiotic sources complicates the computation of a reliable inference. We present a Bayesian pipeline to infer relative microbial fitness from high-throughput lineage tracking assays. Our model accounts for multiple sources of noise and propagates uncertainties throughout all parameters in a systematic way. Furthermore, using modern variational inference methods based on automatic differentiation, we are able to scale the inference to a large number of unique barcodes. We extend this core model to analyze multi-environment assays, replicate experiments, and barcodes linked to genotypes. On simulations, our method recovers known parameters within posterior credible intervals. This work provides a generalizable Bayesian framework to analyze lineage tracking experiments. The accompanying open-source software library enables the adoption of principled statistical methods in experimental evolution.
Manuel Razo-Mejia, Madhav Mani, Dmitri Petrov
PLoS Comput. Biol.3
2020 FlightTracker: Consistency across Read-Optimized Online Stores at Facebook
Scott Pruett, Kevin Doherty, Jinyu Han, Dmitri Petrov, Jim Carrig, John Hugg, Nathan Bronson
OSDI5
2013 TAO: Facebook's Distributed Data Store for the Social Graph
Nathan Bronson, Zach Amsden, George Cabrera, Prasad Chakka, Peter Dimov, Jack Ferris, Anthony Giardullo, Sachin Kulkarni, Harry C. Li, Mark Marchukov, Dmitri Petrov, Lovro Puzar, Yee Jiun Song, Venkateshwaran Venkataramani
USENIX ATC12
2012 TAO: how facebook serves the social graph
abstract
Over 800 million people around the world share their social interactions with friends on Facebook, providing a rich body of information referred to as the social graph. In this talk, I describe how we model and serve this graph. Our model uses typed nodes (fbobjects) and edges (associations) to express the relationships and actions that happen on Facebook. We access the graph via a simple API that provides queries over the set of same-typed associations leaving an object. We have found this API to be both sufficiently expressive and amenable to a scalable implementation. In the last segment of the talk I describe the design of TAO, our graph data store. TAO is a distributed implementation of the fbobject and association API that has been serving production traffic at Facebook for more than 2 years.
Venkateshwaran Venkataramani, Zach Amsden, Nathan Bronson, George Cabrera, Prasad Chakka, Peter Dimov, Jack Ferris, Anthony Giardullo, Jeremy Hoon, Sachin Kulkarni, Nathan Lawrence, Mark Marchukov, Dmitri Petrov, Lovro Puzar
SIGMOD Conference14