{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3RDEKHAB6D7HGP5C5RIHROMBVK","short_pith_number":"pith:3RDEKHAB","schema_version":"1.0","canonical_sha256":"dc46451c01f0fe733fa2ec5078b981aa87438ae543d754956c13c22521dcbb00","source":{"kind":"arxiv","id":"1604.01848","version":1},"attestation_state":"computed","paper":{"title":"Worst-Case Optimal Algorithms for Parallel Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Paraschos Koutris, Paul Beame","submitted_at":"2016-04-07T02:15:13Z","abstract_excerpt":"In this paper, we study the communication complexity for the problem of computing a conjunctive query on a large database in a parallel setting with $p$ servers. In contrast to previous work, where upper and lower bounds on the communication were specified for particular structures of data (either data without skew, or data with specific types of skew), in this work we focus on worst-case analysis of the communication cost. The goal is to find worst-case optimal parallel algorithms, similar to the work of [18] for sequential algorithms.\n  We first show that for a single round we can obtain an "},"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":"1604.01848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-07T02:15:13Z","cross_cats_sorted":[],"title_canon_sha256":"cefd88f0e96222db120c963f33b36b5d14cf8db565c9eb17e1f492bfbd3456ed","abstract_canon_sha256":"45486819d901b1adce9fcc7630f7def32276e3c550c683b71997a0266b596b05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:31.959866Z","signature_b64":"YpcOLdKwmwIrfxdj1h7YZHwBxiNxop2N22st/Gy2orB8OakLuiLlxnZjG6j5y5XPKUhatSkciyRGXReCbyBZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc46451c01f0fe733fa2ec5078b981aa87438ae543d754956c13c22521dcbb00","last_reissued_at":"2026-05-18T01:17:31.959042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:31.959042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-Case Optimal Algorithms for Parallel Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Paraschos Koutris, Paul Beame","submitted_at":"2016-04-07T02:15:13Z","abstract_excerpt":"In this paper, we study the communication complexity for the problem of computing a conjunctive query on a large database in a parallel setting with $p$ servers. In contrast to previous work, where upper and lower bounds on the communication were specified for particular structures of data (either data without skew, or data with specific types of skew), in this work we focus on worst-case analysis of the communication cost. The goal is to find worst-case optimal parallel algorithms, similar to the work of [18] for sequential algorithms.\n  We first show that for a single round we can obtain an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01848","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":"1604.01848","created_at":"2026-05-18T01:17:31.959180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01848v1","created_at":"2026-05-18T01:17:31.959180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01848","created_at":"2026-05-18T01:17:31.959180+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RDEKHAB6D7H","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RDEKHAB6D7HGP5C","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RDEKHAB","created_at":"2026-05-18T12:29:55.572404+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/3RDEKHAB6D7HGP5C5RIHROMBVK","json":"https://pith.science/pith/3RDEKHAB6D7HGP5C5RIHROMBVK.json","graph_json":"https://pith.science/api/pith-number/3RDEKHAB6D7HGP5C5RIHROMBVK/graph.json","events_json":"https://pith.science/api/pith-number/3RDEKHAB6D7HGP5C5RIHROMBVK/events.json","paper":"https://pith.science/paper/3RDEKHAB"},"agent_actions":{"view_html":"https://pith.science/pith/3RDEKHAB6D7HGP5C5RIHROMBVK","download_json":"https://pith.science/pith/3RDEKHAB6D7HGP5C5RIHROMBVK.json","view_paper":"https://pith.science/paper/3RDEKHAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01848&json=true","fetch_graph":"https://pith.science/api/pith-number/3RDEKHAB6D7HGP5C5RIHROMBVK/graph.json","fetch_events":"https://pith.science/api/pith-number/3RDEKHAB6D7HGP5C5RIHROMBVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RDEKHAB6D7HGP5C5RIHROMBVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RDEKHAB6D7HGP5C5RIHROMBVK/action/storage_attestation","attest_author":"https://pith.science/pith/3RDEKHAB6D7HGP5C5RIHROMBVK/action/author_attestation","sign_citation":"https://pith.science/pith/3RDEKHAB6D7HGP5C5RIHROMBVK/action/citation_signature","submit_replication":"https://pith.science/pith/3RDEKHAB6D7HGP5C5RIHROMBVK/action/replication_record"}},"created_at":"2026-05-18T01:17:31.959180+00:00","updated_at":"2026-05-18T01:17:31.959180+00:00"}