{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VVYXZPREZRYJVWKWCULOSAT4IW","short_pith_number":"pith:VVYXZPRE","canonical_record":{"source":{"id":"1808.08896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-08-27T15:56:00Z","cross_cats_sorted":[],"title_canon_sha256":"14b3f428fb28cce3d22bd28ea87d206b8a4e91684e153167494e509c338cdaf1","abstract_canon_sha256":"7349fafa3dd3b8d5996b1631ccce106f19c03d67d28d64908269348dd2bd4efe"},"schema_version":"1.0"},"canonical_sha256":"ad717cbe24cc709ad9561516e9027c45a69b28451932c584ee27b0ebab2ae14c","source":{"kind":"arxiv","id":"1808.08896","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08896","created_at":"2026-05-17T23:56:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08896v2","created_at":"2026-05-17T23:56:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08896","created_at":"2026-05-17T23:56:49Z"},{"alias_kind":"pith_short_12","alias_value":"VVYXZPREZRYJ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VVYXZPREZRYJVWKW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VVYXZPRE","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VVYXZPREZRYJVWKWCULOSAT4IW","target":"record","payload":{"canonical_record":{"source":{"id":"1808.08896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-08-27T15:56:00Z","cross_cats_sorted":[],"title_canon_sha256":"14b3f428fb28cce3d22bd28ea87d206b8a4e91684e153167494e509c338cdaf1","abstract_canon_sha256":"7349fafa3dd3b8d5996b1631ccce106f19c03d67d28d64908269348dd2bd4efe"},"schema_version":"1.0"},"canonical_sha256":"ad717cbe24cc709ad9561516e9027c45a69b28451932c584ee27b0ebab2ae14c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:49.075148Z","signature_b64":"zo3A3BNx63XBksnIADeTFJOhu5pUzmkIE3gc2Sj7Ohdrc4le8ceF2PSL4T9t4XgbeXN6tQkgj1RwHr8vOzqqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad717cbe24cc709ad9561516e9027c45a69b28451932c584ee27b0ebab2ae14c","last_reissued_at":"2026-05-17T23:56:49.074574Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:49.074574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.08896","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwkVbcbJaNpjiMvvGzrBs6K35y1GiSX/QZOjSEDku2DEzKf9EwDwV6jzRM+SOgKnnRoZ96mHVaI9qjaYSd5CDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:55:32.065546Z"},"content_sha256":"c9d7942d219890885382414d2da37e7ca7b3f262b23efc83a66baee3af373904","schema_version":"1.0","event_id":"sha256:c9d7942d219890885382414d2da37e7ca7b3f262b23efc83a66baee3af373904"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VVYXZPREZRYJVWKWCULOSAT4IW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chen Luo, Michael J. Carey","submitted_at":"2018-08-27T15:56:00Z","abstract_excerpt":"In recent years, the Log Structured Merge (LSM) tree has been widely adopted by NoSQL and NewSQL systems for its superior write performance. Despite its popularity, however, most existing work has focused on LSM-based key-value stores with only a primary LSM-tree index; auxiliary structures, which are critical for supporting ad-hoc queries, have received much less attention. In this paper, we focus on efficient data ingestion and query processing for general-purpose LSM-based storage systems. We first propose and evaluate a series of optimizations for efficient batched point lookups, significa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08896","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PreTNVsHt/YyxwrNv6G3sZkSrZkW+cCQDsDd0tQigvDNh+zFBsf+v0GvYKMAeq7TZdOE/LWQXWHTqKrx53PQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:55:32.065907Z"},"content_sha256":"6eb783ae9ffdd2a30d545c72e1689ab49d589af3b35999fea8ec0c7486692ecd","schema_version":"1.0","event_id":"sha256:6eb783ae9ffdd2a30d545c72e1689ab49d589af3b35999fea8ec0c7486692ecd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVYXZPREZRYJVWKWCULOSAT4IW/bundle.json","state_url":"https://pith.science/pith/VVYXZPREZRYJVWKWCULOSAT4IW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVYXZPREZRYJVWKWCULOSAT4IW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T18:55:32Z","links":{"resolver":"https://pith.science/pith/VVYXZPREZRYJVWKWCULOSAT4IW","bundle":"https://pith.science/pith/VVYXZPREZRYJVWKWCULOSAT4IW/bundle.json","state":"https://pith.science/pith/VVYXZPREZRYJVWKWCULOSAT4IW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVYXZPREZRYJVWKWCULOSAT4IW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VVYXZPREZRYJVWKWCULOSAT4IW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7349fafa3dd3b8d5996b1631ccce106f19c03d67d28d64908269348dd2bd4efe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-08-27T15:56:00Z","title_canon_sha256":"14b3f428fb28cce3d22bd28ea87d206b8a4e91684e153167494e509c338cdaf1"},"schema_version":"1.0","source":{"id":"1808.08896","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.08896","created_at":"2026-05-17T23:56:49Z"},{"alias_kind":"arxiv_version","alias_value":"1808.08896v2","created_at":"2026-05-17T23:56:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08896","created_at":"2026-05-17T23:56:49Z"},{"alias_kind":"pith_short_12","alias_value":"VVYXZPREZRYJ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VVYXZPREZRYJVWKW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VVYXZPRE","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:6eb783ae9ffdd2a30d545c72e1689ab49d589af3b35999fea8ec0c7486692ecd","target":"graph","created_at":"2026-05-17T23:56:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In recent years, the Log Structured Merge (LSM) tree has been widely adopted by NoSQL and NewSQL systems for its superior write performance. Despite its popularity, however, most existing work has focused on LSM-based key-value stores with only a primary LSM-tree index; auxiliary structures, which are critical for supporting ad-hoc queries, have received much less attention. In this paper, we focus on efficient data ingestion and query processing for general-purpose LSM-based storage systems. We first propose and evaluate a series of optimizations for efficient batched point lookups, significa","authors_text":"Chen Luo, Michael J. Carey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-08-27T15:56:00Z","title":"Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08896","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c9d7942d219890885382414d2da37e7ca7b3f262b23efc83a66baee3af373904","target":"record","created_at":"2026-05-17T23:56:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7349fafa3dd3b8d5996b1631ccce106f19c03d67d28d64908269348dd2bd4efe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-08-27T15:56:00Z","title_canon_sha256":"14b3f428fb28cce3d22bd28ea87d206b8a4e91684e153167494e509c338cdaf1"},"schema_version":"1.0","source":{"id":"1808.08896","kind":"arxiv","version":2}},"canonical_sha256":"ad717cbe24cc709ad9561516e9027c45a69b28451932c584ee27b0ebab2ae14c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad717cbe24cc709ad9561516e9027c45a69b28451932c584ee27b0ebab2ae14c","first_computed_at":"2026-05-17T23:56:49.074574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:49.074574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zo3A3BNx63XBksnIADeTFJOhu5pUzmkIE3gc2Sj7Ohdrc4le8ceF2PSL4T9t4XgbeXN6tQkgj1RwHr8vOzqqDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:49.075148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.08896","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9d7942d219890885382414d2da37e7ca7b3f262b23efc83a66baee3af373904","sha256:6eb783ae9ffdd2a30d545c72e1689ab49d589af3b35999fea8ec0c7486692ecd"],"state_sha256":"4b681d31d81767b694716549dd0ea8d769f3fd976568e2b7b1bc265837101241"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGJeS6kLSyLoB7GUFHA09E2DQUz/kje2kNdcb/H9n6Vvr0TycDaaKgFcRYZCbYtP3F8+YoXwZJy4Dytt07IfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:55:32.067842Z","bundle_sha256":"2353f45b970b9bbe952c061a9c12fe87192588f9281383765e801b57d5039041"}}