{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:SEKSHEITXFWZIHB6KDDOR3LTDS","short_pith_number":"pith:SEKSHEIT","schema_version":"1.0","canonical_sha256":"9115239113b96d941c3e50c6e8ed731c8fc5e5039f6fc59fa78b5f0f883ce1f8","source":{"kind":"arxiv","id":"2010.12734","version":2},"attestation_state":"computed","paper":{"title":"REMIX: Efficient Range Query for LSM-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chen Chen, Song Jiang, Wenshao Zhong, Xingbo Wu","submitted_at":"2020-10-24T01:21:21Z","abstract_excerpt":"LSM-tree based key-value (KV) stores organize data in a multi-level structure for high-speed writes. Range queries on traditional LSM-trees must seek and sort-merge data from multiple table files on the fly, which is expensive and often leads to mediocre read performance. To improve range query efficiency on LSM-trees, we introduce a space-efficient KV index data structure, named REMIX, that records a globally sorted view of KV data spanning multiple table files. A range query on multiple REMIX-indexed data files can quickly locate the target key using a binary search, and retrieve subsequent "},"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":"2010.12734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-24T01:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"f0db6e9c394a4fad88f2dd6f930ad48d46d5b3e124e36050c9ff8b3c33eeb28c","abstract_canon_sha256":"22686f17ad8cdfebf93704d1c52b0a1e3f40fd7e3526819038f95b1e39e16bfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:49.223726Z","signature_b64":"MKl2urAr/5lJBwzZRPZsJsV5EbH2ZXE/L1nbVNQO7gALuW9X96XDTjV4O30bQ/r1eQDpSZj9oUQczSGj1CM0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9115239113b96d941c3e50c6e8ed731c8fc5e5039f6fc59fa78b5f0f883ce1f8","last_reissued_at":"2026-07-05T02:09:49.223243Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:49.223243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"REMIX: Efficient Range Query for LSM-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chen Chen, Song Jiang, Wenshao Zhong, Xingbo Wu","submitted_at":"2020-10-24T01:21:21Z","abstract_excerpt":"LSM-tree based key-value (KV) stores organize data in a multi-level structure for high-speed writes. Range queries on traditional LSM-trees must seek and sort-merge data from multiple table files on the fly, which is expensive and often leads to mediocre read performance. To improve range query efficiency on LSM-trees, we introduce a space-efficient KV index data structure, named REMIX, that records a globally sorted view of KV data spanning multiple table files. A range query on multiple REMIX-indexed data files can quickly locate the target key using a binary search, and retrieve subsequent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12734","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.12734/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2010.12734","created_at":"2026-07-05T02:09:49.223300+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.12734v2","created_at":"2026-07-05T02:09:49.223300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12734","created_at":"2026-07-05T02:09:49.223300+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEKSHEITXFWZ","created_at":"2026-07-05T02:09:49.223300+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEKSHEITXFWZIHB6","created_at":"2026-07-05T02:09:49.223300+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEKSHEIT","created_at":"2026-07-05T02:09:49.223300+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/SEKSHEITXFWZIHB6KDDOR3LTDS","json":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS.json","graph_json":"https://pith.science/api/pith-number/SEKSHEITXFWZIHB6KDDOR3LTDS/graph.json","events_json":"https://pith.science/api/pith-number/SEKSHEITXFWZIHB6KDDOR3LTDS/events.json","paper":"https://pith.science/paper/SEKSHEIT"},"agent_actions":{"view_html":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS","download_json":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS.json","view_paper":"https://pith.science/paper/SEKSHEIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.12734&json=true","fetch_graph":"https://pith.science/api/pith-number/SEKSHEITXFWZIHB6KDDOR3LTDS/graph.json","fetch_events":"https://pith.science/api/pith-number/SEKSHEITXFWZIHB6KDDOR3LTDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/action/storage_attestation","attest_author":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/action/author_attestation","sign_citation":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/action/citation_signature","submit_replication":"https://pith.science/pith/SEKSHEITXFWZIHB6KDDOR3LTDS/action/replication_record"}},"created_at":"2026-07-05T02:09:49.223300+00:00","updated_at":"2026-07-05T02:09:49.223300+00:00"}