A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Characterizing Load Imbalance in Real-World Networked Caches
2014
Proceedings of the 13th ACM Workshop on Hot Topics in Networks - HotNets-XIII
Preserved Fulltext
We analyze the degree of observed load imbalance, focusing on read-only traffic against Facebook's graph cache tier in Tao. ...
We investigate the principal causes of load imbalance, including data co-location, non-ideal hashing scenarios, and hot-spot temporal effects. ...
Acknowledgments We thank our HotNets reviewers for their constructive feedback. ...
doi:10.1145/2670518.2673882
dblp:conf/hotnets/HuangGVFBR14
fatcat:v7ym55lczjdoreoablhqkrno5i
Facebook immune system
2011
Proceedings of the 4th Workshop on Social Network Systems - SNS '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Over the past several years we have built and deployed a coherent, scalable, and extensible realtime system to protect our users and the social graph. ...
The system also generates signals for use as feedback in classifiers and other components. ...
, and other members of Facebook's Site Integrity team. ...
doi:10.1145/1989656.1989664
dblp:conf/sns/SteinCM11
fatcat:ipvrox3elvgtje4ffg5w7gj2wu
LinkBench
2013
Proceedings of the 2013 international conference on Management of data - SIGMOD '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
LinkBench is based on traces from production databases that store "social graph" data at Facebook, a major social network. ...
LinkBench provides a realistic and challenging test for persistent storage of social and web service data, filling a gap in the available tools for researchers, developers and administrators. ...
We characterized the social graph data and accompanying database workload for Facebook's social network, extracting key statistical distributions and showing how power law distributions occur in several ...
doi:10.1145/2463676.2465296
dblp:conf/sigmod/ArmstrongPBC13
fatcat:nijp6itf3zdkpn6cu3oaqp2gxe
Graph Aware Caching Policy for Distributed Graph Stores
2015
2015 IEEE International Conference on Cloud Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We implemented graph aware caching on a distributed data store Apache HBase in the Hadoop family. ...
We also show how to improve the performance of existing caching algorithms for distributed graphs by exploiting the topology information. ...
ACKNOWLEDGMENTS We thank TUBITAK (The Scientific and Technological Research Council of Turkey) for partially supporting this work with project 113E274. ...
doi:10.1109/ic2e.2015.39
dblp:conf/ic2e/AksuCCKU15
fatcat:boumt4wnqnb7jpgsjtqcjn6wae
ZipG
2017
Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present ZipG, a distributed memory-efficient graph store for serving interactive graph queries. ZipG achieves memory efficiency by storing the input graph data using a compressed representation. ...
On a single server with 244GB memory, ZipG executes tens of thousands of queries from these workloads for raw graph data over half a TB; this leads to an order of magnitude (sometimes as much as 23×) higher ...
LinkBench models Facebook's database workload for social graph queries. ...
doi:10.1145/3035918.3064012
dblp:conf/sigmod/KhandelwalYY0S17
fatcat:d7ouljqbgza2lehoshuf37npua
Existential consistency
2015
Proceedings of the 25th Symposium on Operating Systems Principles - SOSP '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We use measurement and analysis of requests to Facebook's TAO system to quantify how often anomalies happen in practice, i.e., when results returned by eventually consistent TAO differ from what is allowed ...
To the best of our knowledge, no prior work does so for a large, production Web service. ...
Acknowledgments We are grateful to the anonymous SOSP reviewers for their extensive comments that substantially improved this work. ...
doi:10.1145/2815400.2815426
dblp:conf/sosp/LuVAHSTKL15
fatcat:kfywtryxe5hfjgghmpafyx3eua
LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This paper presents LiveGraph, a graph storage system that outperforms both the best graph transactional systems and the best systems for real-time graph analytics on fresh data. ...
This is achieved by combining a novel graph-aware data structure, the Transactional Edge Log (TEL), together with a concurrency control mechanism that leverages TEL's data layout. ...
Results demonstrate that LiveGraph outperforms the current leaders at their specialty, in particular outperforming Facebook's RocksDB [2] by up to 8.41× (2.55× on average) using Facebook's social graph ...
arXiv:1910.05773v1
fatcat:7eluyrrabja5lhrugd32oh5fru
LiveGraph
2020
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper presents LiveGraph, a graph storage system that outperforms both the best graph transactional systems and the best solutions for real-time graph analytics on fresh data. ...
Such pure-sequential operations are enabled by combining a novel graph-aware data structure, the Transactional Edge Log (TEL), with a concurrency control mechanism that leverages TEL's data layout. ...
Results demonstrate that LiveGraph outperforms the current leaders at their specialty, in particular outperforming Facebook's RocksDB [2] by up to 7.45× using Facebook's social graph benchmark [12] . ...
doi:10.14778/3384345.3384351
fatcat:emhzadcyjzcvbia77wsttwvdiq
ODT FLOW: Extracting, analyzing, and sharing multi-source multi-scale human mobility
2021
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In response to the soaring needs of human mobility data, especially during disaster events such as the COVID-19 pandemic, and the associated big data challenges, we develop a scalable online platform for ...
allows for efficient extraction, query, and aggregation of billion-level origin-destination (OD) flows in parallel at the server-side. ...
mobility insights at the country level using aggregated population movement data from Facebook's Data for Good program. ...
doi:10.1371/journal.pone.0255259
fatcat:ncscv2gbhvggze5h76ic7qk2bu
GraphChi-DB: Simple Design for a Scalable Graph Database System -- on Just a PC
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Compared to previous data structures, PAL can store graphs more compactly while allowing fast access to both the incoming and the outgoing edges of a vertex, without duplicating data. ...
We propose a new data structure, Parallel Adjacency Lists (PAL), for efficiently managing graphs with billions of edges on disk. ...
Acknowledgements We thank Brandon Myers, Bill Howe and Svilen Mihailov for valuable feedback. Aapo Kyrola was supported by VMWare Graduate Fellowship. ...
arXiv:1403.0701v1
fatcat:xcnlv3jixnalrkaapygzz3mmcu
Using weaker consistency models with monitoring and recovery for improving performance of key-value stores
2019
Journal of the Brazilian Computer Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We evaluate this approach with graph-based applications running on the Voldemort key-value store. ...
On the other hand, weaker consistency models suffer from data conflicts. ...
Acknowledgements We thank the reviewers of the 8th Latin-American Symposium on Dependable Computing (LADC 2018) for their suggestions on our work. ...
doi:10.1186/s13173-019-0091-9
fatcat:6eogslvzonesnnsa7mhotie3ru
Optimistic Execution in Key-Value Store
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We evaluate this approach in the Voldemort key-value store. ...
If P is violated (because the underlying key-value store provides a weaker consistency), the system rolls back and resumes the computation at a state where P holds. ...
For instance, TAO [38] handles social graph data at Facebook. TAO is not strongly consistent, as its main goal is performance and high scalability, even across datacenters and geographical regions. ...
arXiv:1801.07319v1
fatcat:4re2yjj2gzaxledlpbrwgokw7a
Using Weaker Consistency Models with Monitoring and Recovery for Improving Performance of Key-Value Stores
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We evaluate this approach with graph-based applications running on the Voldemort key-value store. ...
We find that for some applications, frequent rollback can cause the program using eventual consistency to effectively stall. We propose alternate mechanisms for dealing with re-occurring rollbacks. ...
Acknowledgement We thank the reviewers of the 8th Latin-American Symposium on Dependable Computing (LADC 2018) for their suggestions on our work.
Authors' information ...
arXiv:1909.01980v1
fatcat:uzijpapg2jcxhll4zghnzagdmu
Technical Report: Optimistic Execution in Key-Value Store
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We evaluate this approach with practical graph applications running on the Voldemort key-value store. ...
Limitations of the CAP theorem imply that if availability is desired in the presence of network partitions, one must sacrifice sequential consistency, a consistency model that is more natural for system ...
For instance, TAO [44] handles social graph data at Facebook. TAO is not strongly consistent, as its main goal is performance and high scalability, even across datacenters and geographical regions. ...
arXiv:1805.11453v3
fatcat:kg75kgsoknbetd2twl5ekapp2e
Understanding Acceleration Opportunities at Hyperscale
2021
IEEE Micro
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
; 3) Feed: a news feed stories extractor; 4) Tao: a distributed social graph data store; and 5) MyRocks: a user database. ...
(e.g., executing key-value stores in Cache). ...
doi:10.1109/mm.2021.3066615
fatcat:iyktvfx4ebejzjff7eeqf4ct24
« Previous
Showing results 1 — 15 out of 61 results