{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZEZMNJWHTXAXCQRMKGJTSVPMFK","short_pith_number":"pith:ZEZMNJWH","schema_version":"1.0","canonical_sha256":"c932c6a6c79dc171422c51933955ec2abd83aaf1de25eeb73f8548df03939b6d","source":{"kind":"arxiv","id":"1711.08330","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Cardinality Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DB","authors_text":"Oleg Ivanov, Sergey Bartunov","submitted_at":"2017-11-22T15:20:19Z","abstract_excerpt":"In this paper we address cardinality estimation problem which is an important subproblem in query optimization. Query optimization is a part of every relational DBMS responsible for finding the best way of the execution for the given query. These ways are called plans. The execution time of different plans may differ by several orders, so query optimizer has a great influence on the whole DBMS performance. We consider cost-based query optimization approach as the most popular one. It was observed that cost-based optimization quality depends much on cardinality estimation quality. Cardinality o"},"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":"1711.08330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-22T15:20:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3dbab30483d8a69ae4c239684aff0d453f7fc22911eb64af6ffda1ff9d16da57","abstract_canon_sha256":"99fd50408d334a9682ef7f02ac84caebcfeaa3c78314cb0145b482e4a54ad3bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:50.074773Z","signature_b64":"1aJpgfXh/htM6RgIxVXrG++oaSZ41JQ8lQHdj9dyM8vQRTx3eJ1I6MN+3BQBJjVx95A5tLBGHDXldwHUm4KqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c932c6a6c79dc171422c51933955ec2abd83aaf1de25eeb73f8548df03939b6d","last_reissued_at":"2026-05-18T00:29:50.074307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:50.074307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Cardinality Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DB","authors_text":"Oleg Ivanov, Sergey Bartunov","submitted_at":"2017-11-22T15:20:19Z","abstract_excerpt":"In this paper we address cardinality estimation problem which is an important subproblem in query optimization. Query optimization is a part of every relational DBMS responsible for finding the best way of the execution for the given query. These ways are called plans. The execution time of different plans may differ by several orders, so query optimizer has a great influence on the whole DBMS performance. We consider cost-based query optimization approach as the most popular one. It was observed that cost-based optimization quality depends much on cardinality estimation quality. Cardinality o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08330","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":""},"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":"1711.08330","created_at":"2026-05-18T00:29:50.074390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08330v1","created_at":"2026-05-18T00:29:50.074390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08330","created_at":"2026-05-18T00:29:50.074390+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEZMNJWHTXAX","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEZMNJWHTXAXCQRM","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEZMNJWH","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22992","citing_title":"Finding Performance Issues in Database Systems by Exploiting Dormant Code Paths","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZEZMNJWHTXAXCQRMKGJTSVPMFK","json":"https://pith.science/pith/ZEZMNJWHTXAXCQRMKGJTSVPMFK.json","graph_json":"https://pith.science/api/pith-number/ZEZMNJWHTXAXCQRMKGJTSVPMFK/graph.json","events_json":"https://pith.science/api/pith-number/ZEZMNJWHTXAXCQRMKGJTSVPMFK/events.json","paper":"https://pith.science/paper/ZEZMNJWH"},"agent_actions":{"view_html":"https://pith.science/pith/ZEZMNJWHTXAXCQRMKGJTSVPMFK","download_json":"https://pith.science/pith/ZEZMNJWHTXAXCQRMKGJTSVPMFK.json","view_paper":"https://pith.science/paper/ZEZMNJWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08330&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEZMNJWHTXAXCQRMKGJTSVPMFK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEZMNJWHTXAXCQRMKGJTSVPMFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEZMNJWHTXAXCQRMKGJTSVPMFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEZMNJWHTXAXCQRMKGJTSVPMFK/action/storage_attestation","attest_author":"https://pith.science/pith/ZEZMNJWHTXAXCQRMKGJTSVPMFK/action/author_attestation","sign_citation":"https://pith.science/pith/ZEZMNJWHTXAXCQRMKGJTSVPMFK/action/citation_signature","submit_replication":"https://pith.science/pith/ZEZMNJWHTXAXCQRMKGJTSVPMFK/action/replication_record"}},"created_at":"2026-05-18T00:29:50.074390+00:00","updated_at":"2026-05-18T00:29:50.074390+00:00"}