{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PP62EXI3T64FROIDRI6RYZLPDD","short_pith_number":"pith:PP62EXI3","schema_version":"1.0","canonical_sha256":"7bfda25d1b9fb858b9038a3d1c656f18e59b5495d314fa93dfe9b2183f15bd07","source":{"kind":"arxiv","id":"2406.18099","version":1},"attestation_state":"computed","paper":{"title":"CompassDB: Pioneering High-Performance Key-Value Store with Perfect Hash","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chaoqu Jiang, Chenfan Xiao, Dong Liu, Dongsheng He, Hongxiao Bi, Jin Jiang, Yu Hu, Yusong Zhang, Zhijun Fu","submitted_at":"2024-06-26T06:19:35Z","abstract_excerpt":"Modern mainstream persistent key-value storage engines utilize Log-Structured Merge tree (LSM-tree) based designs, optimizing read/write performance by leveraging sequential disk I/O. However, the advent of SSDs, with their significant improvements in bandwidth and IOPS, shifts the bottleneck from I/O to CPU. The high compaction cost and large read/write amplification associated with LSM trees have become critical bottlenecks. In this paper, we introduce CompassDB, which utilizes a Two-tier Perfect Hash Table (TPH) design to significantly decrease read/write amplification and compaction costs."},"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":"2406.18099","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-26T06:19:35Z","cross_cats_sorted":[],"title_canon_sha256":"ff9cd65588ac96d63af8eb0dade459806ef9c7b20f3f932a960e5fcf40ed693a","abstract_canon_sha256":"7fac8bf5b79447de8718ccd4cb510d3a17b83cc706065cddb3ea47d0b321d29b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:55.193063Z","signature_b64":"qWazoIjpIoMv8rrlfVZ0gjkp6XOEctjWoYVt6HyjPhXRGF8l1vvE6OoOoKNjDCGQ8Fgv2yRhUTPZRQ3LG900AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bfda25d1b9fb858b9038a3d1c656f18e59b5495d314fa93dfe9b2183f15bd07","last_reissued_at":"2026-07-05T08:36:55.192590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:55.192590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CompassDB: Pioneering High-Performance Key-Value Store with Perfect Hash","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chaoqu Jiang, Chenfan Xiao, Dong Liu, Dongsheng He, Hongxiao Bi, Jin Jiang, Yu Hu, Yusong Zhang, Zhijun Fu","submitted_at":"2024-06-26T06:19:35Z","abstract_excerpt":"Modern mainstream persistent key-value storage engines utilize Log-Structured Merge tree (LSM-tree) based designs, optimizing read/write performance by leveraging sequential disk I/O. However, the advent of SSDs, with their significant improvements in bandwidth and IOPS, shifts the bottleneck from I/O to CPU. The high compaction cost and large read/write amplification associated with LSM trees have become critical bottlenecks. In this paper, we introduce CompassDB, which utilizes a Two-tier Perfect Hash Table (TPH) design to significantly decrease read/write amplification and compaction costs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18099","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.18099/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":"2406.18099","created_at":"2026-07-05T08:36:55.192647+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18099v1","created_at":"2026-07-05T08:36:55.192647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18099","created_at":"2026-07-05T08:36:55.192647+00:00"},{"alias_kind":"pith_short_12","alias_value":"PP62EXI3T64F","created_at":"2026-07-05T08:36:55.192647+00:00"},{"alias_kind":"pith_short_16","alias_value":"PP62EXI3T64FROID","created_at":"2026-07-05T08:36:55.192647+00:00"},{"alias_kind":"pith_short_8","alias_value":"PP62EXI3","created_at":"2026-07-05T08:36:55.192647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01742","citing_title":"BOLT: Bandwidth-Optimized Lightning-Fast Oblivious Map powered by Secure HBM Accelerators","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PP62EXI3T64FROIDRI6RYZLPDD","json":"https://pith.science/pith/PP62EXI3T64FROIDRI6RYZLPDD.json","graph_json":"https://pith.science/api/pith-number/PP62EXI3T64FROIDRI6RYZLPDD/graph.json","events_json":"https://pith.science/api/pith-number/PP62EXI3T64FROIDRI6RYZLPDD/events.json","paper":"https://pith.science/paper/PP62EXI3"},"agent_actions":{"view_html":"https://pith.science/pith/PP62EXI3T64FROIDRI6RYZLPDD","download_json":"https://pith.science/pith/PP62EXI3T64FROIDRI6RYZLPDD.json","view_paper":"https://pith.science/paper/PP62EXI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18099&json=true","fetch_graph":"https://pith.science/api/pith-number/PP62EXI3T64FROIDRI6RYZLPDD/graph.json","fetch_events":"https://pith.science/api/pith-number/PP62EXI3T64FROIDRI6RYZLPDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PP62EXI3T64FROIDRI6RYZLPDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PP62EXI3T64FROIDRI6RYZLPDD/action/storage_attestation","attest_author":"https://pith.science/pith/PP62EXI3T64FROIDRI6RYZLPDD/action/author_attestation","sign_citation":"https://pith.science/pith/PP62EXI3T64FROIDRI6RYZLPDD/action/citation_signature","submit_replication":"https://pith.science/pith/PP62EXI3T64FROIDRI6RYZLPDD/action/replication_record"}},"created_at":"2026-07-05T08:36:55.192647+00:00","updated_at":"2026-07-05T08:36:55.192647+00:00"}