{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DISN7NEWAJ7MUMR7XNBXR7YENT","short_pith_number":"pith:DISN7NEW","schema_version":"1.0","canonical_sha256":"1a24dfb496027eca323fbb4378ff046cf9f3f5c2346b588ef3a7bd0ee069d61c","source":{"kind":"arxiv","id":"1203.1952","version":1},"attestation_state":"computed","paper":{"title":"Worst-case Optimal Join Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DB","authors_text":"Atri Rudra, Christopher R\\'e, Ely Porat, Hung Q. Ngo","submitted_at":"2012-03-08T22:35:29Z","abstract_excerpt":"Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who gave bounds on the size of a full conjunctive query in terms of the sizes of the individual relations in the body of the query. These bounds, however, are not constructive: they rely on Shearer's entropy inequality which is information-theoreti"},"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":"1203.1952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-08T22:35:29Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"caecce63ec823130d49f2eddf3f952db7cf9044c65345e113e6bdfcc2e0583ea","abstract_canon_sha256":"80d41c8224b1ec49381b8d1011519a1da195a5c0335fc89b2062097527e8e390"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:27.912976Z","signature_b64":"nXp48k5mdrycpV0A1BsIa+8UOvHd5atjHSaJSJfgAEHn/OYoARNYolUKiVi0RJw6u5O1Yl+PujlDvOF+6AuaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a24dfb496027eca323fbb4378ff046cf9f3f5c2346b588ef3a7bd0ee069d61c","last_reissued_at":"2026-05-18T04:00:27.912484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:27.912484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-case Optimal Join Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DB","authors_text":"Atri Rudra, Christopher R\\'e, Ely Porat, Hung Q. Ngo","submitted_at":"2012-03-08T22:35:29Z","abstract_excerpt":"Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who gave bounds on the size of a full conjunctive query in terms of the sizes of the individual relations in the body of the query. These bounds, however, are not constructive: they rely on Shearer's entropy inequality which is information-theoreti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1952","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":"1203.1952","created_at":"2026-05-18T04:00:27.912558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1952v1","created_at":"2026-05-18T04:00:27.912558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1952","created_at":"2026-05-18T04:00:27.912558+00:00"},{"alias_kind":"pith_short_12","alias_value":"DISN7NEWAJ7M","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DISN7NEWAJ7MUMR7","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DISN7NEW","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2607.05832","citing_title":"BaCon: Efficient Batch Processing of Counting Queries [Full Version]","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT","json":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT.json","graph_json":"https://pith.science/api/pith-number/DISN7NEWAJ7MUMR7XNBXR7YENT/graph.json","events_json":"https://pith.science/api/pith-number/DISN7NEWAJ7MUMR7XNBXR7YENT/events.json","paper":"https://pith.science/paper/DISN7NEW"},"agent_actions":{"view_html":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT","download_json":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT.json","view_paper":"https://pith.science/paper/DISN7NEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1952&json=true","fetch_graph":"https://pith.science/api/pith-number/DISN7NEWAJ7MUMR7XNBXR7YENT/graph.json","fetch_events":"https://pith.science/api/pith-number/DISN7NEWAJ7MUMR7XNBXR7YENT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/action/storage_attestation","attest_author":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/action/author_attestation","sign_citation":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/action/citation_signature","submit_replication":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/action/replication_record"}},"created_at":"2026-05-18T04:00:27.912558+00:00","updated_at":"2026-05-18T04:00:27.912558+00:00"}