{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PMZJZYCIXPFYSGXFB5F6U6QKE2","short_pith_number":"pith:PMZJZYCI","schema_version":"1.0","canonical_sha256":"7b329ce048bbcb891ae50f4bea7a0a2695172bbd16e69a4693de1e2cac5a14c3","source":{"kind":"arxiv","id":"1605.05219","version":2},"attestation_state":"computed","paper":{"title":"Parallel Evaluation of Multi-Semi-Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Frank Neven, Jonny Daenen, Stijn Vansummeren, Tony Tan","submitted_at":"2016-05-17T15:53:27Z","abstract_excerpt":"While services such as Amazon AWS make computing power abundantly available, adding more computing nodes can incur high costs in, for instance, pay-as-you-go plans while not always significantly improving the net running time (aka wall-clock time) of queries. In this work, we provide algorithms for parallel evaluation of SGF queries in MapReduce that optimize total time, while retaining low net time. Not only can SGF queries specify all semi-join reducers, but also more expressive queries involving disjunction and negation. Since SGF queries can be seen as Boolean combinations of (potentially "},"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":"1605.05219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-17T15:53:27Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2fabcd51068fa359bdc7ac723b6bfa168fa68dd341152a42f47007172f6b6b0f","abstract_canon_sha256":"6d4dfe7f473bab7b9c8d1bf27ff7f880419e28c0c74e38e4620deee8ee614d85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:12.080291Z","signature_b64":"tat1ekmU+IfbnQ88ZesKqw5GK4zdZIPGT58Usd7cZF31QCGj4fPPEeHUggzafUeAxZqoA73J5/n5zUdSFPB/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b329ce048bbcb891ae50f4bea7a0a2695172bbd16e69a4693de1e2cac5a14c3","last_reissued_at":"2026-05-18T01:14:12.079661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:12.079661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Evaluation of Multi-Semi-Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Frank Neven, Jonny Daenen, Stijn Vansummeren, Tony Tan","submitted_at":"2016-05-17T15:53:27Z","abstract_excerpt":"While services such as Amazon AWS make computing power abundantly available, adding more computing nodes can incur high costs in, for instance, pay-as-you-go plans while not always significantly improving the net running time (aka wall-clock time) of queries. In this work, we provide algorithms for parallel evaluation of SGF queries in MapReduce that optimize total time, while retaining low net time. Not only can SGF queries specify all semi-join reducers, but also more expressive queries involving disjunction and negation. Since SGF queries can be seen as Boolean combinations of (potentially "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05219","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":""},"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":"1605.05219","created_at":"2026-05-18T01:14:12.079776+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05219v2","created_at":"2026-05-18T01:14:12.079776+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05219","created_at":"2026-05-18T01:14:12.079776+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMZJZYCIXPFY","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMZJZYCIXPFYSGXF","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMZJZYCI","created_at":"2026-05-18T12:30:39.010887+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/PMZJZYCIXPFYSGXFB5F6U6QKE2","json":"https://pith.science/pith/PMZJZYCIXPFYSGXFB5F6U6QKE2.json","graph_json":"https://pith.science/api/pith-number/PMZJZYCIXPFYSGXFB5F6U6QKE2/graph.json","events_json":"https://pith.science/api/pith-number/PMZJZYCIXPFYSGXFB5F6U6QKE2/events.json","paper":"https://pith.science/paper/PMZJZYCI"},"agent_actions":{"view_html":"https://pith.science/pith/PMZJZYCIXPFYSGXFB5F6U6QKE2","download_json":"https://pith.science/pith/PMZJZYCIXPFYSGXFB5F6U6QKE2.json","view_paper":"https://pith.science/paper/PMZJZYCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05219&json=true","fetch_graph":"https://pith.science/api/pith-number/PMZJZYCIXPFYSGXFB5F6U6QKE2/graph.json","fetch_events":"https://pith.science/api/pith-number/PMZJZYCIXPFYSGXFB5F6U6QKE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMZJZYCIXPFYSGXFB5F6U6QKE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMZJZYCIXPFYSGXFB5F6U6QKE2/action/storage_attestation","attest_author":"https://pith.science/pith/PMZJZYCIXPFYSGXFB5F6U6QKE2/action/author_attestation","sign_citation":"https://pith.science/pith/PMZJZYCIXPFYSGXFB5F6U6QKE2/action/citation_signature","submit_replication":"https://pith.science/pith/PMZJZYCIXPFYSGXFB5F6U6QKE2/action/replication_record"}},"created_at":"2026-05-18T01:14:12.079776+00:00","updated_at":"2026-05-18T01:14:12.079776+00:00"}