{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:55:26Z","timestamp":1775638526606,"version":"3.50.1"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p>Social networks, online communities, mobile devices, and instant messaging applications generate complex, unstructured data at a high rate, resulting in large volumes of data. This poses new challenges for data management systems that aim to ingest, store, index, and analyze such data efficiently. In response, we released the first public version of AsterixDB, an open-source Big Data Management System (BDMS), in June of 2013. This paper describes the storage management layer of AsterixDB, providing a detailed description of its ingestion-oriented approach to local storage and a set of initial measurements of its ingestion-related performance characteristics.<\/jats:p>\n          <jats:p>In order to support high frequency insertions, AsterixDB has wholly adopted Log-Structured Merge-trees as the storage technology for all of its index structures. We describe how the AsterixDB software framework enables \"LSM-ification\" (conversion from an in-place update, disk-based data structure to a deferred-update, append-only data structure) of any kind of index structure that supports certain primitive operations, enabling the index to ingest data efficiently. We also describe how AsterixDB ensures the ACID properties for operations involving multiple heterogeneous LSM-based indexes. Lastly, we highlight the challenges related to managing the resources of a system when many LSM indexes are used concurrently and present AsterixDB's initial solution.<\/jats:p>","DOI":"10.14778\/2732951.2732958","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"841-852","source":"Crossref","is-referenced-by-count":66,"title":["Storage management in AsterixDB"],"prefix":"10.14778","volume":"7","author":[{"given":"Sattam","family":"Alsubaiee","sequence":"first","affiliation":[{"name":"University of California, Irvine"}]},{"given":"Alexander","family":"Behm","sequence":"additional","affiliation":[{"name":"Cloudera"}]},{"given":"Vinayak","family":"Borkar","sequence":"additional","affiliation":[{"name":"University of California, Irvine"}]},{"given":"Zachary","family":"Heilbron","sequence":"additional","affiliation":[{"name":"University of California, Irvine"}]},{"given":"Young-Seok","family":"Kim","sequence":"additional","affiliation":[{"name":"University of California, Irvine"}]},{"given":"Michael J.","family":"Carey","sequence":"additional","affiliation":[{"name":"University of California, Irvine"}]},{"given":"Markus","family":"Dreseler","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute Potsdam"}]},{"given":"Chen","family":"Li","sequence":"additional","affiliation":[{"name":"University of California, Irvine"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"AsterixDB. http:\/\/asterixdb.ics.uci.edu\/.  AsterixDB. http:\/\/asterixdb.ics.uci.edu\/."},{"key":"e_1_2_1_2_1","unstructured":"Cassandra. http:\/\/cassandra.apache.org\/.  Cassandra. http:\/\/cassandra.apache.org\/."},{"key":"e_1_2_1_3_1","unstructured":"CouchDB. http:\/\/couchdb.apache.org\/.  CouchDB. http:\/\/couchdb.apache.org\/."},{"key":"e_1_2_1_4_1","unstructured":"HBase. http:\/\/hbase.apache.org\/.  HBase. http:\/\/hbase.apache.org\/."},{"key":"e_1_2_1_5_1","unstructured":"LevelDB. https:\/\/code.google.com\/p\/leveldb\/.  LevelDB. https:\/\/code.google.com\/p\/leveldb\/."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2331801.2331803"},{"key":"e_1_2_1_7_1","unstructured":"Apache Hive http:\/\/hadoop.apache.org\/hive.  Apache Hive http:\/\/hadoop.apache.org\/hive."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-011-7082-y"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767921"},{"key":"e_1_2_1_10_1","volume-title":"VLDB","author":"Brown K. P.","year":"1994","unstructured":"K. P. Brown Towards automated performance tuning for complex workloads . In VLDB , 1994 . K. P. Brown et al. Towards automated performance tuning for complex workloads. In VLDB, 1994."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1945023.1945034"},{"key":"e_1_2_1_13_1","unstructured":"Facebook. Facebook's growth in the past year. https:\/\/www.facebook.com\/media\/set\/? set=a.10151908376636729.1073741825.20531316728.  Facebook. Facebook's growth in the past year. https:\/\/www.facebook.com\/media\/set\/? set=a.10151908376636729.1073741825.20531316728."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_15_1","unstructured":"Jaql http:\/\/www.jaql.org.  Jaql http:\/\/www.jaql.org."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0171-7"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/170088.170403"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253272"},{"key":"e_1_2_1_19_1","volume-title":"VLDB","author":"Mohan C.","year":"1990","unstructured":"C. Mohan . ARIES\/KVL : A key-value locking method for concurrency control of multiaction transactions operating on b-tree indexes . In VLDB , 1990 . C. Mohan. ARIES\/KVL: A key-value locking method for concurrency control of multiaction transactions operating on b-tree indexes. In VLDB, 1990."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/128765.128770"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376726"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_23_1","volume-title":"SSTD","author":"Procopiuc O.","year":"2003","unstructured":"O. Procopiuc : A dynamic scalable kd-tree . In SSTD , 2003 . O. Procopiuc et al. Bkd-tree: A dynamic scalable kd-tree. In SSTD, 2003."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/121132.121137"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/320473.320484"},{"key":"e_1_2_1_28_1","volume-title":"VLDB","author":"Storm A. J.","year":"2006","unstructured":"A. J. Storm Adaptive self-tuning memory in DB2 . In VLDB , 2006 . A. J. Storm et al. Adaptive self-tuning memory in DB2. In VLDB, 2006."},{"key":"e_1_2_1_29_1","volume-title":"August","year":"2013","unstructured":"Twitter Blog. New Tweets per second record, and how! , August 2013 . https:\/\/blog.twitter.com\/2013\/new-tweets-persecond-record-and-how. Twitter Blog. New Tweets per second record, and how!, August 2013. https:\/\/blog.twitter.com\/2013\/new-tweets-persecond-record-and-how."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732951.2732958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:58:06Z","timestamp":1672225086000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732951.2732958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":29,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.14778\/2732951.2732958"],"URL":"https:\/\/doi.org\/10.14778\/2732951.2732958","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,6]]}}}