{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RLUTGCBEKEA4D5DQJS46PYZFIB","short_pith_number":"pith:RLUTGCBE","schema_version":"1.0","canonical_sha256":"8ae93308245101c1f4704cb9e7e325406a7516f28350a83683ce9548d49a3820","source":{"kind":"arxiv","id":"1906.05745","version":2},"attestation_state":"computed","paper":{"title":"Memory-Efficient Group-by Aggregates over Multi-Way Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amol Deshpande, Konstantinos Xirogiannopoulos","submitted_at":"2019-06-13T15:15:20Z","abstract_excerpt":"Aggregate computation in relational databases has long been done using the standard unary aggregation and binary join operators. These implement the classical model of computing joins between relations two at a time, materializing the intermediate results, and then proceeding to do either sort-based or hash-based aggregate computation to derive the final result. This approach, however, can be dramatically sub-optimal in the case of low-selectivity joins, and often ends up generating large intermediate results even if the relations involved as well as the final result sets themselves are quite "},"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":"1906.05745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-13T15:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"33e065a9c81da50fcbd2eed52e0a4882faefcbb49131e17e9684316163dd6314","abstract_canon_sha256":"b7dff0a4df57afe70d8432c84915758a936118e1eaab6bf602698da530855890"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:14.016573Z","signature_b64":"G8irLJVwTB2qa+s8/lhDcID9IDztiIsyLD+/P5Dr9/PqfD1JP3Vs95WWYry3B3SWIo+aeAvT3d601uMMGfFEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae93308245101c1f4704cb9e7e325406a7516f28350a83683ce9548d49a3820","last_reissued_at":"2026-05-17T23:43:14.016143Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:14.016143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory-Efficient Group-by Aggregates over Multi-Way Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amol Deshpande, Konstantinos Xirogiannopoulos","submitted_at":"2019-06-13T15:15:20Z","abstract_excerpt":"Aggregate computation in relational databases has long been done using the standard unary aggregation and binary join operators. These implement the classical model of computing joins between relations two at a time, materializing the intermediate results, and then proceeding to do either sort-based or hash-based aggregate computation to derive the final result. This approach, however, can be dramatically sub-optimal in the case of low-selectivity joins, and often ends up generating large intermediate results even if the relations involved as well as the final result sets themselves are quite "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05745","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":"1906.05745","created_at":"2026-05-17T23:43:14.016205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05745v2","created_at":"2026-05-17T23:43:14.016205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05745","created_at":"2026-05-17T23:43:14.016205+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLUTGCBEKEA4","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLUTGCBEKEA4D5DQ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLUTGCBE","created_at":"2026-05-18T12:33:27.125529+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/RLUTGCBEKEA4D5DQJS46PYZFIB","json":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB.json","graph_json":"https://pith.science/api/pith-number/RLUTGCBEKEA4D5DQJS46PYZFIB/graph.json","events_json":"https://pith.science/api/pith-number/RLUTGCBEKEA4D5DQJS46PYZFIB/events.json","paper":"https://pith.science/paper/RLUTGCBE"},"agent_actions":{"view_html":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB","download_json":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB.json","view_paper":"https://pith.science/paper/RLUTGCBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05745&json=true","fetch_graph":"https://pith.science/api/pith-number/RLUTGCBEKEA4D5DQJS46PYZFIB/graph.json","fetch_events":"https://pith.science/api/pith-number/RLUTGCBEKEA4D5DQJS46PYZFIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/action/storage_attestation","attest_author":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/action/author_attestation","sign_citation":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/action/citation_signature","submit_replication":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/action/replication_record"}},"created_at":"2026-05-17T23:43:14.016205+00:00","updated_at":"2026-05-17T23:43:14.016205+00:00"}