{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:44Z","timestamp":1779174884930,"version":"3.51.4"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,8]]},"abstract":"<jats:p>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).<\/jats:p><jats:p>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.<\/jats:p>","DOI":"10.14778\/2824032.2824078","type":"journal-article","created":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T12:18:17Z","timestamp":1442405897000},"page":"1816-1827","source":"Crossref","is-referenced-by-count":234,"title":["Gorilla"],"prefix":"10.14778","volume":"8","author":[{"given":"Tuomas","family":"Pelkonen","sequence":"first","affiliation":[{"name":"Facebook, Inc., Menlo Park, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Franklin","sequence":"additional","affiliation":[{"name":"Facebook, Inc., Menlo Park, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Teller","sequence":"additional","affiliation":[{"name":"Facebook, Inc., Menlo Park, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Cavallaro","sequence":"additional","affiliation":[{"name":"Facebook, Inc., Menlo Park, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Huang","sequence":"additional","affiliation":[{"name":"Facebook, Inc., Menlo Park, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Meza","sequence":"additional","affiliation":[{"name":"Facebook, Inc., Menlo Park, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaushik","family":"Veeraraghavan","sequence":"additional","affiliation":[{"name":"Facebook, Inc., Menlo Park, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"http:\/\/graphite.wikidot.com\/. Accessed","author":"Scalable Realtime Graphing Graphite","year":"2015"},{"key":"e_1_2_1_2_1","volume-title":"Accessed","year":"2015"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536231"},{"key":"e_1_2_1_4_1","volume-title":"Los Alamos National Laboratory (LANL)","author":"Boyer E. B.","year":"2012"},{"key":"e_1_2_1_5_1","volume-title":"Workshops Proceedings of the 31st International Conference on Data Engineering Workshops, ICDE Seoul, Korea. IEEE","author":"Bronson N.","year":"2015"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/1281100.1281103","volume-title":"Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing","author":"Chandra T. D.","year":"2007"},{"key":"e_1_2_1_7_1","first-page":"124","volume-title":"Mobile Ad-hoc and Sensor Systems, 2004 IEEE International Conference on","author":"Chen H.","year":"2004"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"B. Hu Y. Chen and E. J. Keogh . Time Series Classification under More Realistic Assumptions . In SDM pages 578 -- 586 2013 . B. Hu Y. Chen and E. J. Keogh. Time Series Classification under More Realistic Assumptions. In SDM pages 578--586 2013.","DOI":"10.1137\/1.9781611972832.64"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375680"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/775047.775128","volume-title":"Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Keogh E.","year":"2002"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/1014052.1014077","volume-title":"Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Keogh E.","year":"2004"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0154-9"},{"key":"e_1_2_1_13_1","first-page":"429","volume-title":"Data Engineering, 2003. Proceedings. 19th International Conference on","author":"Lazaridis I.","year":"2003"},{"key":"e_1_2_1_14_1","volume-title":"December","author":"Lamport Leslie","year":"2001"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/882082.882086","volume-title":"Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery","author":"Lin J.","year":"2003"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1145\/1014052.1014104","volume-title":"Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Lin J.","year":"2004"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.143"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/1807167.1807188","volume-title":"Proceedings of the 2010 ACM SIGMOD International Conference on Management of data","author":"Mueen A.","year":"2010"},{"key":"e_1_2_1_19_1","volume-title":"CA","author":"Nishtala R.","year":"2015"},{"key":"e_1_2_1_20_1","first-page":"385","volume-title":"Scaling Memcache at Facebook. In nsdi","author":"Nishtala R.","year":"2013"},{"key":"e_1_2_1_21_1","volume-title":"CA","author":"Parikh J.","year":"2014"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the Royal Society of London, 58(347--352)","author":"Pearson K.","year":"1895"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.27"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/2339530.2339576","volume-title":"Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Rakthanmanon T.","year":"2012"},{"key":"e_1_2_1_25_1","first-page":"133","volume-title":"DCC","author":"Ratanaworabhan P.","year":"2006"},{"key":"e_1_2_1_26_1","volume-title":"Strata Conference","author":"Tang L.","year":"2012"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687609"},{"key":"e_1_2_1_28_1","first-page":"625","volume-title":"Proceedings of the 2012 IEEE 4th International Conference on Cloud Computing Technology and Science (CloudCom)","author":"Wlodarczyk T. W.","year":"2012"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2824032.2824078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T05:50:21Z","timestamp":1691992221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2824032.2824078"}},"subtitle":["a fast, scalable, in-memory time series database"],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":28,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["10.14778\/2824032.2824078"],"URL":"https:\/\/doi.org\/10.14778\/2824032.2824078","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}