{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JCLTPK35D5UIH6BYDE6VYVT727","short_pith_number":"pith:JCLTPK35","schema_version":"1.0","canonical_sha256":"489737ab7d1f6883f838193d5c567fd7f536328a0faf8ba1f94483578bd3a5fa","source":{"kind":"arxiv","id":"2305.01237","version":1},"attestation_state":"computed","paper":{"title":"Updatable Learned Indexes Meet Disk-Resident DBMS -- From Evaluations to Design Choices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Hai Lan, J. Shane Culpepper, Renata Borovica-Gajic, Zhifeng Bao","submitted_at":"2023-05-02T07:34:58Z","abstract_excerpt":"Although many updatable learned indexes have been proposed in recent years, whether they can outperform traditional approaches on disk remains unknown. In this study, we revisit and implement four state-of-the-art updatable learned indexes on disk, and compare them against the B+-tree under a wide range of settings. Through our evaluation, we make some key observations: 1) Overall, the B+-tree performs well across a range of workload types and datasets. 2) A learned index could outperform B+-tree or other learned indexes on disk for a specific workload. For example, PGM achieves the best perfo"},"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":"2305.01237","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-05-02T07:34:58Z","cross_cats_sorted":[],"title_canon_sha256":"ec19e99be03e66eb2e8b7a6a8e92beaf2bdebb60b9237727a722927a89e56731","abstract_canon_sha256":"5caa9b5bc07b6a5f05b95677a60ac8ae7744ebfd081a79bde6bff70bd2de4348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:23.274235Z","signature_b64":"cyIZw4zyrFKfndpRITfo/GnW0Ry2mhXxRhtxu6cC05TW1wsKOa5/A7TEhvbQLo38e6L+Ecl6fkw5gMC1cptyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"489737ab7d1f6883f838193d5c567fd7f536328a0faf8ba1f94483578bd3a5fa","last_reissued_at":"2026-07-05T06:06:23.273830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:23.273830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Updatable Learned Indexes Meet Disk-Resident DBMS -- From Evaluations to Design Choices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Hai Lan, J. Shane Culpepper, Renata Borovica-Gajic, Zhifeng Bao","submitted_at":"2023-05-02T07:34:58Z","abstract_excerpt":"Although many updatable learned indexes have been proposed in recent years, whether they can outperform traditional approaches on disk remains unknown. In this study, we revisit and implement four state-of-the-art updatable learned indexes on disk, and compare them against the B+-tree under a wide range of settings. Through our evaluation, we make some key observations: 1) Overall, the B+-tree performs well across a range of workload types and datasets. 2) A learned index could outperform B+-tree or other learned indexes on disk for a specific workload. For example, PGM achieves the best perfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01237","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/2305.01237/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":"2305.01237","created_at":"2026-07-05T06:06:23.273889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.01237v1","created_at":"2026-07-05T06:06:23.273889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01237","created_at":"2026-07-05T06:06:23.273889+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCLTPK35D5UI","created_at":"2026-07-05T06:06:23.273889+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCLTPK35D5UIH6BY","created_at":"2026-07-05T06:06:23.273889+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCLTPK35","created_at":"2026-07-05T06:06:23.273889+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/JCLTPK35D5UIH6BYDE6VYVT727","json":"https://pith.science/pith/JCLTPK35D5UIH6BYDE6VYVT727.json","graph_json":"https://pith.science/api/pith-number/JCLTPK35D5UIH6BYDE6VYVT727/graph.json","events_json":"https://pith.science/api/pith-number/JCLTPK35D5UIH6BYDE6VYVT727/events.json","paper":"https://pith.science/paper/JCLTPK35"},"agent_actions":{"view_html":"https://pith.science/pith/JCLTPK35D5UIH6BYDE6VYVT727","download_json":"https://pith.science/pith/JCLTPK35D5UIH6BYDE6VYVT727.json","view_paper":"https://pith.science/paper/JCLTPK35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.01237&json=true","fetch_graph":"https://pith.science/api/pith-number/JCLTPK35D5UIH6BYDE6VYVT727/graph.json","fetch_events":"https://pith.science/api/pith-number/JCLTPK35D5UIH6BYDE6VYVT727/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCLTPK35D5UIH6BYDE6VYVT727/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCLTPK35D5UIH6BYDE6VYVT727/action/storage_attestation","attest_author":"https://pith.science/pith/JCLTPK35D5UIH6BYDE6VYVT727/action/author_attestation","sign_citation":"https://pith.science/pith/JCLTPK35D5UIH6BYDE6VYVT727/action/citation_signature","submit_replication":"https://pith.science/pith/JCLTPK35D5UIH6BYDE6VYVT727/action/replication_record"}},"created_at":"2026-07-05T06:06:23.273889+00:00","updated_at":"2026-07-05T06:06:23.273889+00:00"}