{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PQVCE63EG66YJUYAFBE63JCCI4","short_pith_number":"pith:PQVCE63E","schema_version":"1.0","canonical_sha256":"7c2a227b6437bd84d3002849eda442471f207e2ad765d767aca41874d85cf03a","source":{"kind":"arxiv","id":"1908.08341","version":2},"attestation_state":"computed","paper":{"title":"The Case for Deep Query Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jens Dittrich, Joris Nix","submitted_at":"2019-08-22T12:54:33Z","abstract_excerpt":"Query Optimisation (QO) is the most important optimisation problem in databases. The goal of QO is to compute the best physical plan under a given cost model. In that process, physical operators are used as building blocks for the planning and optimisation process. In this paper, we propose to deepen that process. We present Deep Query Optimisation (DQO). In DQO, we break up the abstraction of a 'physical' operator to consider more fine-granular subcomponents. These subcomponents are then used to enumerate (sub-)plans both offline and at query time. This idea triggers several exciting research"},"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":"1908.08341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-08-22T12:54:33Z","cross_cats_sorted":[],"title_canon_sha256":"9dfb2afcdb95ff5b7fd7ea949fc25eb161f022b25d46617215223498bb2c25a7","abstract_canon_sha256":"ba66bf9a5b9d9602d06abc928e02e888740e53b9e596de6f388ded595175e962"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:39.942366Z","signature_b64":"0V7rFDZ7QxGmT/LXd283461mfWrA38895GD0OtbPr5OK66QY4r5pQKIUHCVVi3WjR4MeV57aFhf2K8Db/UKRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c2a227b6437bd84d3002849eda442471f207e2ad765d767aca41874d85cf03a","last_reissued_at":"2026-07-05T00:26:39.941808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:39.941808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Case for Deep Query Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jens Dittrich, Joris Nix","submitted_at":"2019-08-22T12:54:33Z","abstract_excerpt":"Query Optimisation (QO) is the most important optimisation problem in databases. The goal of QO is to compute the best physical plan under a given cost model. In that process, physical operators are used as building blocks for the planning and optimisation process. In this paper, we propose to deepen that process. We present Deep Query Optimisation (DQO). In DQO, we break up the abstraction of a 'physical' operator to consider more fine-granular subcomponents. These subcomponents are then used to enumerate (sub-)plans both offline and at query time. This idea triggers several exciting research"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08341","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/1908.08341/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":"1908.08341","created_at":"2026-07-05T00:26:39.941873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08341v2","created_at":"2026-07-05T00:26:39.941873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08341","created_at":"2026-07-05T00:26:39.941873+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQVCE63EG66Y","created_at":"2026-07-05T00:26:39.941873+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQVCE63EG66YJUYA","created_at":"2026-07-05T00:26:39.941873+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQVCE63E","created_at":"2026-07-05T00:26:39.941873+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/PQVCE63EG66YJUYAFBE63JCCI4","json":"https://pith.science/pith/PQVCE63EG66YJUYAFBE63JCCI4.json","graph_json":"https://pith.science/api/pith-number/PQVCE63EG66YJUYAFBE63JCCI4/graph.json","events_json":"https://pith.science/api/pith-number/PQVCE63EG66YJUYAFBE63JCCI4/events.json","paper":"https://pith.science/paper/PQVCE63E"},"agent_actions":{"view_html":"https://pith.science/pith/PQVCE63EG66YJUYAFBE63JCCI4","download_json":"https://pith.science/pith/PQVCE63EG66YJUYAFBE63JCCI4.json","view_paper":"https://pith.science/paper/PQVCE63E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08341&json=true","fetch_graph":"https://pith.science/api/pith-number/PQVCE63EG66YJUYAFBE63JCCI4/graph.json","fetch_events":"https://pith.science/api/pith-number/PQVCE63EG66YJUYAFBE63JCCI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQVCE63EG66YJUYAFBE63JCCI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQVCE63EG66YJUYAFBE63JCCI4/action/storage_attestation","attest_author":"https://pith.science/pith/PQVCE63EG66YJUYAFBE63JCCI4/action/author_attestation","sign_citation":"https://pith.science/pith/PQVCE63EG66YJUYAFBE63JCCI4/action/citation_signature","submit_replication":"https://pith.science/pith/PQVCE63EG66YJUYAFBE63JCCI4/action/replication_record"}},"created_at":"2026-07-05T00:26:39.941873+00:00","updated_at":"2026-07-05T00:26:39.941873+00:00"}