{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:Y2EN64J5CVADX2FLB5AR3WRCEG","short_pith_number":"pith:Y2EN64J5","schema_version":"1.0","canonical_sha256":"c688df713d15403be8ab0f411dda222192292bb61a7a725e2239b95a1ce708a6","source":{"kind":"arxiv","id":"2101.01507","version":1},"attestation_state":"computed","paper":{"title":"A Survey on Advancing the DBMS Query Optimizer: Cardinality Estimation, Cost Model, and Plan Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Hai Lan, Yuwei Peng, Zhifeng Bao","submitted_at":"2021-01-05T13:47:45Z","abstract_excerpt":"Query optimizer is at the heart of the database systems. Cost-based optimizer studied in this paper is adopted in almost all current database systems. A cost-based optimizer introduces a plan enumeration algorithm to find a (sub)plan, and then uses a cost model to obtain the cost of that plan, and selects the plan with the lowest cost. In the cost model, cardinality, the number of tuples through an operator, plays a crucial role. Due to the inaccuracy in cardinality estimation, errors in cost model, and the huge plan space, the optimizer cannot find the optimal execution plan for a complex que"},"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":"2101.01507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-01-05T13:47:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cc1069cbe7459c3cfa574187d50da39a6801c0707088edf5347537b83e56523c","abstract_canon_sha256":"cd7259695706fb86c2799a278b3f75e864408e104a3283b5d3c6e2e60c05a5c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:50.495946Z","signature_b64":"t9WBzFT0A94wpxFYxgaGBINa8flK+ahTTBFgKL0WMy7r18Cwxm0/IsRSAlcBGWMtWLXa4S6+4HrosBET1WclBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c688df713d15403be8ab0f411dda222192292bb61a7a725e2239b95a1ce708a6","last_reissued_at":"2026-07-05T02:04:50.495434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:50.495434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on Advancing the DBMS Query Optimizer: Cardinality Estimation, Cost Model, and Plan Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Hai Lan, Yuwei Peng, Zhifeng Bao","submitted_at":"2021-01-05T13:47:45Z","abstract_excerpt":"Query optimizer is at the heart of the database systems. Cost-based optimizer studied in this paper is adopted in almost all current database systems. A cost-based optimizer introduces a plan enumeration algorithm to find a (sub)plan, and then uses a cost model to obtain the cost of that plan, and selects the plan with the lowest cost. In the cost model, cardinality, the number of tuples through an operator, plays a crucial role. Due to the inaccuracy in cardinality estimation, errors in cost model, and the huge plan space, the optimizer cannot find the optimal execution plan for a complex que"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.01507","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/2101.01507/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":"2101.01507","created_at":"2026-07-05T02:04:50.495497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.01507v1","created_at":"2026-07-05T02:04:50.495497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.01507","created_at":"2026-07-05T02:04:50.495497+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2EN64J5CVAD","created_at":"2026-07-05T02:04:50.495497+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2EN64J5CVADX2FL","created_at":"2026-07-05T02:04:50.495497+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2EN64J5","created_at":"2026-07-05T02:04:50.495497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14725","citing_title":"RELOAD: A Robust and Efficient Learned Query Optimizer for Database Systems","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2EN64J5CVADX2FLB5AR3WRCEG","json":"https://pith.science/pith/Y2EN64J5CVADX2FLB5AR3WRCEG.json","graph_json":"https://pith.science/api/pith-number/Y2EN64J5CVADX2FLB5AR3WRCEG/graph.json","events_json":"https://pith.science/api/pith-number/Y2EN64J5CVADX2FLB5AR3WRCEG/events.json","paper":"https://pith.science/paper/Y2EN64J5"},"agent_actions":{"view_html":"https://pith.science/pith/Y2EN64J5CVADX2FLB5AR3WRCEG","download_json":"https://pith.science/pith/Y2EN64J5CVADX2FLB5AR3WRCEG.json","view_paper":"https://pith.science/paper/Y2EN64J5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.01507&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2EN64J5CVADX2FLB5AR3WRCEG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2EN64J5CVADX2FLB5AR3WRCEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2EN64J5CVADX2FLB5AR3WRCEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2EN64J5CVADX2FLB5AR3WRCEG/action/storage_attestation","attest_author":"https://pith.science/pith/Y2EN64J5CVADX2FLB5AR3WRCEG/action/author_attestation","sign_citation":"https://pith.science/pith/Y2EN64J5CVADX2FLB5AR3WRCEG/action/citation_signature","submit_replication":"https://pith.science/pith/Y2EN64J5CVADX2FLB5AR3WRCEG/action/replication_record"}},"created_at":"2026-07-05T02:04:50.495497+00:00","updated_at":"2026-07-05T02:04:50.495497+00:00"}