{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KYN5IGXE2HKFYBLRFRM3EQXLLN","short_pith_number":"pith:KYN5IGXE","schema_version":"1.0","canonical_sha256":"561bd41ae4d1d45c05712c59b242eb5b6a2657cd55935d76da09337874890df5","source":{"kind":"arxiv","id":"1104.3214","version":1},"attestation_state":"computed","paper":{"title":"CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anastasia Ailamaki (EPFL), Debabrata Dash (ArcSight), Neoklis Polyzotis (UC Santa Cruz)","submitted_at":"2011-04-16T08:51:27Z","abstract_excerpt":"Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instances that are common in practice, e.g., thousands of queries in the workload, thousands of candidate indexes and several hard and soft constraints. Our work is the first to reveal that the index tuning problem has a well structured space of solutions, and this space can be explored efficiently with well known techniques from linear optimization. Experimental results demonstrate that our approach outperforms state-of-th"},"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":"1104.3214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-04-16T08:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"69cd042839da18ea5f019d8a33eb3f0c7b7edf3f63666d9dab0d6d3b8c7cfdd9","abstract_canon_sha256":"3c06a86dd54a7349774c4d307b8e41d790dbdb34b4141d5396e1718d1df64eef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.552889Z","signature_b64":"QPvxM351t/aLnR+TCq5FqZ+iBltZDfDWPDa84eI9qOKk081ys3WT4A3BF+W2GMxUrHo5phsuBwrGj25YGukZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"561bd41ae4d1d45c05712c59b242eb5b6a2657cd55935d76da09337874890df5","last_reissued_at":"2026-05-18T04:24:05.552221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.552221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anastasia Ailamaki (EPFL), Debabrata Dash (ArcSight), Neoklis Polyzotis (UC Santa Cruz)","submitted_at":"2011-04-16T08:51:27Z","abstract_excerpt":"Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instances that are common in practice, e.g., thousands of queries in the workload, thousands of candidate indexes and several hard and soft constraints. Our work is the first to reveal that the index tuning problem has a well structured space of solutions, and this space can be explored efficiently with well known techniques from linear optimization. Experimental results demonstrate that our approach outperforms state-of-th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3214","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":"1104.3214","created_at":"2026-05-18T04:24:05.552330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3214v1","created_at":"2026-05-18T04:24:05.552330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3214","created_at":"2026-05-18T04:24:05.552330+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYN5IGXE2HKF","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYN5IGXE2HKFYBLR","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYN5IGXE","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.13211","citing_title":"MAGI-1: Autoregressive Video Generation at Scale","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KYN5IGXE2HKFYBLRFRM3EQXLLN","json":"https://pith.science/pith/KYN5IGXE2HKFYBLRFRM3EQXLLN.json","graph_json":"https://pith.science/api/pith-number/KYN5IGXE2HKFYBLRFRM3EQXLLN/graph.json","events_json":"https://pith.science/api/pith-number/KYN5IGXE2HKFYBLRFRM3EQXLLN/events.json","paper":"https://pith.science/paper/KYN5IGXE"},"agent_actions":{"view_html":"https://pith.science/pith/KYN5IGXE2HKFYBLRFRM3EQXLLN","download_json":"https://pith.science/pith/KYN5IGXE2HKFYBLRFRM3EQXLLN.json","view_paper":"https://pith.science/paper/KYN5IGXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3214&json=true","fetch_graph":"https://pith.science/api/pith-number/KYN5IGXE2HKFYBLRFRM3EQXLLN/graph.json","fetch_events":"https://pith.science/api/pith-number/KYN5IGXE2HKFYBLRFRM3EQXLLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYN5IGXE2HKFYBLRFRM3EQXLLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYN5IGXE2HKFYBLRFRM3EQXLLN/action/storage_attestation","attest_author":"https://pith.science/pith/KYN5IGXE2HKFYBLRFRM3EQXLLN/action/author_attestation","sign_citation":"https://pith.science/pith/KYN5IGXE2HKFYBLRFRM3EQXLLN/action/citation_signature","submit_replication":"https://pith.science/pith/KYN5IGXE2HKFYBLRFRM3EQXLLN/action/replication_record"}},"created_at":"2026-05-18T04:24:05.552330+00:00","updated_at":"2026-05-18T04:24:05.552330+00:00"}