The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Gorilla: a fast, scalable, in-memory time series database
Abstract
Large-scale internet services aim to remain highly available and responsive in the presence of unexpected failures. Providing this service often requires monitoring and analyzing tens of millions of measurements per second across a large number of systems, and one particularly effective solution is to store and query such measurements in a time series database (TSDB). A key challenge in the design of TSDBs is how to strike the right balance between efficiency, scalability, and reliability. In this paper we introduce Gorilla, Facebook's in-memory TSDB. Our insight is that users of monitoring systems do not place much emphasis on individual data points but rather on aggregate analysis, and recent data points are of much higher value than older points to quickly detect and diagnose the root cause of an ongoing problem. Gorilla optimizes for remaining highly available for writes and reads, even in the face of failures, at the expense of possibly dropping small amounts of data on the write path. To improve query efficiency, we aggressively leverage compression techniques such as delta-of-delta timestamps and XOR'd floating point values to reduce Gorilla's storage footprint by 10x. This allows us to store Gorilla's data in memory, reducing query latency by 73x and improving query throughput by 14x when compared to a traditional database (HBase)-backed time series data. This performance improvement has unlocked new monitoring and debugging tools, such as time series correlation search and more dense visualization tools. Gorilla also gracefully handles failures from a single-node to entire regions with little to no operational overhead.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
VII. Note on regression and inheritance in the case of two parents
Pearson, K. (1895) · Proceedings of the Royal Society of London · doi:10.1098/rspl.1895.0041 · Cited by 3,424
Exact indexing of dynamic time warping
Keogh, E., & Ratanamahatana, C. A. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-004-0154-9 · Cited by 1,962
A symbolic representation of time series, with implications for streaming algorithms
Lin, J., Keogh, E., Lonardi, S., & Chiu, B. (2003) · Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery · doi:10.1145/882082.882086 · Cited by 1,799
Hive: a warehousing solution over a map-reduce framework
Thusoo, A., Sarma, J. S., Jain, N., Shao, Z., Chakka, P., Anthony, S., Liu, H., Wyckoff, P., & Murthy, R. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687553.1687609 · Cited by 1,556
Lamport, L. (2001) · Cited by 1,325
Searching and mining trillions of time series subsequences under dynamic time warping
Rakthanmanon, T., Campana, B., Mueen, A., Batista, G., Westover, B., Zhu, Q., Zakaria, J., & Keogh, E. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339576 · Cited by 1,047
Nishtala, R., Fugal, H., Grimm, S., Kwiatkowski, M., Lee, H., Li, H. C., McElroy, R., Paleczny, M., Peek, D., Saab, P., et al. (2013) · Networked Systems Design and Implementation · Cited by 959
Proceedings of the Royal Society (London)
(1889) · Rendiconti del Circolo Matematico di Palermo · doi:10.1007/bf03017175 · Cited by 921
Locally adaptive dimensionality reduction for indexing large time series databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375680 · Cited by 866
Paxos made live: an engineering perspective
Chandra, T. D., Griesemer, R., & Redstone, J. (2007) · Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing · doi:10.1145/1281100.1281103 · Cited by 619
Towards parameter-free data mining
Keogh, E., Lonardi, S., & Ratanamahatana, C. A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014077 · Cited by 567
Fast and Efficient Compression of Floating-Point Data
Lindstrom, P., & Isenburg, M. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.143 · Cited by 442
Finding surprising patterns in a time series database in linear time and space
Keogh, E., Lonardi, S., & Chiu, B. '.-C. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775128 · Cited by 404
Locally adaptive dimensionality reduction for indexing large time series databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · ACM SIGMOD Record · doi:10.1145/376284.375680 · Cited by 296
Dynamic Time Warping Averaging of Time Series Allows Faster and More Accurate Classification
Petitjean, F., Forestier, G., Webb, G. I., Nicholson, A. E., Chen, Y., & Keogh, E. (2014) · 2014 IEEE International Conference on Data Mining · doi:10.1109/icdm.2014.27 · Cited by 239
Capturing sensor-generated time series with quality guarantees
Lazaridis, I., & Mehrotra, S. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2003.1260811 · Cited by 178
Visually mining and monitoring massive time series
Lin, J., Keogh, E., Lonardi, S., Lankford, J. P., & Nystrom, D. M. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014104 · Cited by 162
Fast Lossless Compression of Scientific Floating-Point Data
Ratanaworabhan, P., Ke, J., & Burtscher, M. (2006) · Data Compression Conference (DCC'06) · doi:10.1109/dcc.2006.35 · Cited by 159
Time Series Classification under More Realistic Assumptions
Hu, B., Chen, Y., & Keogh, E. (2013) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.64 · Cited by 151
Scuba: diving into data at facebook
Abraham, L., Allen, J., Barykin, O., Borkar, V., Chopra, B., Gerea, C., Merl, D., Metzler, J., Reiss, D., Subramanian, S., et al. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536222.2536231 · Cited by 86
RACE: time series compression with rate adaptivity and error bound for sensor networks
Chen, H., Li, J., & Mohapatra, P. (2005) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mahss.2004.1392089 · Cited by 45
Cited by
(2021) · doi:10.1145/3448016.3457550 · Cited by 416
Wondra, B., Malek, S., Botz, M., Glaser, S. D., & Grosse, C. U. (2019) · Data-Enabled Discovery and Applications · doi:10.1007/s41688-018-0029-y · Cited by 28
Intent-driven network management with multi-agent LLMs: the confucius framework
Wang, Z., Lin, S., Yan, G., Ghorbani, S., Yu, M., Zhou, J., Hu, N., Baruah, L., Peters, S., Kamath, S., et al. (2025) · Proceedings of the ACM SIGCOMM 2025 Conference · doi:10.1145/3718958.3750537 · Cited by 27
Metadata
- Authors
- Pelkonen, T., Franklin, S., Teller, J., Cavallaro, P., Huang, Q., Meza, J., & Veeraraghavan, K.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2015-08
- Volume
- 8
- Issue
- 12
- Pages
- 1816-1827
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2294581520
- Cited by
- 290
- References
- 21
- FWCI
- 18.04
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.