{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3DPOZAQUSZVQP2LHCW5HJINX7Q","short_pith_number":"pith:3DPOZAQU","schema_version":"1.0","canonical_sha256":"d8deec8214966b07e96715ba74a1b7fc06de5896800482ec4d1b39ebe9d3a98e","source":{"kind":"arxiv","id":"1606.02015","version":1},"attestation_state":"computed","paper":{"title":"Re-enabling high-speed caching for LSM-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Dejun Teng, Feng Chen, Lei Guo, Rubao Lee, Siyuan Ma, Xiaodong Zhang","submitted_at":"2016-06-07T03:53:45Z","abstract_excerpt":"LSM-tree has been widely used in cloud computing systems by Google, Facebook, and Amazon, to achieve high performance for write-intensive workloads. However, in LSM-tree, random key-value queries can experience long latency and low throughput due to the interference from the compaction, a basic operation in the algorithm, to caching. LSM-tree relies on frequent compaction operations to merge data into a sorted structure. After a compaction, the original data are reorganized and written to other locations on the disk. As a result, the cached data are invalidated since their referencing addresse"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.02015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-07T03:53:45Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0f944c340bc2858eae046c276e21f286d9534c565c95204d0b04990602f41cd3","abstract_canon_sha256":"e05b86ff7351e91dafa919f1aa3ab421688ee6cf66504934264d0ceb849038d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:44.827622Z","signature_b64":"pMDofhEDF4AMKWwQIToJV4OiVpDup/9u9qKr2unxD7lxy9tbYgcLqkX765Dq4KhzSZVUiq1x2rDtPGDq5ajPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8deec8214966b07e96715ba74a1b7fc06de5896800482ec4d1b39ebe9d3a98e","last_reissued_at":"2026-05-18T01:12:44.827244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:44.827244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Re-enabling high-speed caching for LSM-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Dejun Teng, Feng Chen, Lei Guo, Rubao Lee, Siyuan Ma, Xiaodong Zhang","submitted_at":"2016-06-07T03:53:45Z","abstract_excerpt":"LSM-tree has been widely used in cloud computing systems by Google, Facebook, and Amazon, to achieve high performance for write-intensive workloads. However, in LSM-tree, random key-value queries can experience long latency and low throughput due to the interference from the compaction, a basic operation in the algorithm, to caching. LSM-tree relies on frequent compaction operations to merge data into a sorted structure. After a compaction, the original data are reorganized and written to other locations on the disk. As a result, the cached data are invalidated since their referencing addresse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02015","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.02015","created_at":"2026-05-18T01:12:44.827298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02015v1","created_at":"2026-05-18T01:12:44.827298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02015","created_at":"2026-05-18T01:12:44.827298+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DPOZAQUSZVQ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DPOZAQUSZVQP2LH","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DPOZAQU","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DPOZAQUSZVQP2LHCW5HJINX7Q","json":"https://pith.science/pith/3DPOZAQUSZVQP2LHCW5HJINX7Q.json","graph_json":"https://pith.science/api/pith-number/3DPOZAQUSZVQP2LHCW5HJINX7Q/graph.json","events_json":"https://pith.science/api/pith-number/3DPOZAQUSZVQP2LHCW5HJINX7Q/events.json","paper":"https://pith.science/paper/3DPOZAQU"},"agent_actions":{"view_html":"https://pith.science/pith/3DPOZAQUSZVQP2LHCW5HJINX7Q","download_json":"https://pith.science/pith/3DPOZAQUSZVQP2LHCW5HJINX7Q.json","view_paper":"https://pith.science/paper/3DPOZAQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02015&json=true","fetch_graph":"https://pith.science/api/pith-number/3DPOZAQUSZVQP2LHCW5HJINX7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/3DPOZAQUSZVQP2LHCW5HJINX7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DPOZAQUSZVQP2LHCW5HJINX7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DPOZAQUSZVQP2LHCW5HJINX7Q/action/storage_attestation","attest_author":"https://pith.science/pith/3DPOZAQUSZVQP2LHCW5HJINX7Q/action/author_attestation","sign_citation":"https://pith.science/pith/3DPOZAQUSZVQP2LHCW5HJINX7Q/action/citation_signature","submit_replication":"https://pith.science/pith/3DPOZAQUSZVQP2LHCW5HJINX7Q/action/replication_record"}},"created_at":"2026-05-18T01:12:44.827298+00:00","updated_at":"2026-05-18T01:12:44.827298+00:00"}