{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BJACN6TRZDP4PA4EQSEOYIFUWM","short_pith_number":"pith:BJACN6TR","schema_version":"1.0","canonical_sha256":"0a4026fa71c8dfc783848488ec20b4b30feb7c9eed8412ae21c5bd15f21ae93a","source":{"kind":"arxiv","id":"2412.16323","version":3},"attestation_state":"computed","paper":{"title":"Optimizing Queries with Many-to-Many Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amol Deshpande, Hasara Kalumin","submitted_at":"2024-12-20T20:22:11Z","abstract_excerpt":"As database query processing techniques are being used to handle diverse workloads, a key emerging challenge is how to efficiently handle multi-way join queries containing multiple many-to-many joins. While uncommon in traditional enterprise settings that have been the focus of much of the query optimization work to date, such queries are seen frequently in other contexts such as graph workloads. This has led to much work on developing join algorithms for handling cyclic queries, on compressed (factorized) representations for more efficient storage of intermediate results, and on use of semi-j"},"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":"2412.16323","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-20T20:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"888a18dd1a835fd471325898c3ce9a22f989f7c7139b620c0777cd66e814332e","abstract_canon_sha256":"31cd2bbe71df47abcb7b3922a2509359a09332a6615b67f5b8827d9447d4269b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:43.216155Z","signature_b64":"zK4CLQtgatcRDz9OSCIho0P+/l2vJtI23BLevrfIBPxpAMtNpDUp7O6/0qvyOCxLpgraD/YK4z/P3csW/oEdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a4026fa71c8dfc783848488ec20b4b30feb7c9eed8412ae21c5bd15f21ae93a","last_reissued_at":"2026-07-05T11:04:43.215646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:43.215646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Queries with Many-to-Many Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amol Deshpande, Hasara Kalumin","submitted_at":"2024-12-20T20:22:11Z","abstract_excerpt":"As database query processing techniques are being used to handle diverse workloads, a key emerging challenge is how to efficiently handle multi-way join queries containing multiple many-to-many joins. While uncommon in traditional enterprise settings that have been the focus of much of the query optimization work to date, such queries are seen frequently in other contexts such as graph workloads. This has led to much work on developing join algorithms for handling cyclic queries, on compressed (factorized) representations for more efficient storage of intermediate results, and on use of semi-j"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16323","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.16323/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.16323","created_at":"2026-07-05T11:04:43.215704+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.16323v3","created_at":"2026-07-05T11:04:43.215704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16323","created_at":"2026-07-05T11:04:43.215704+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJACN6TRZDP4","created_at":"2026-07-05T11:04:43.215704+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJACN6TRZDP4PA4E","created_at":"2026-07-05T11:04:43.215704+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJACN6TR","created_at":"2026-07-05T11:04:43.215704+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/BJACN6TRZDP4PA4EQSEOYIFUWM","json":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM.json","graph_json":"https://pith.science/api/pith-number/BJACN6TRZDP4PA4EQSEOYIFUWM/graph.json","events_json":"https://pith.science/api/pith-number/BJACN6TRZDP4PA4EQSEOYIFUWM/events.json","paper":"https://pith.science/paper/BJACN6TR"},"agent_actions":{"view_html":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM","download_json":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM.json","view_paper":"https://pith.science/paper/BJACN6TR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.16323&json=true","fetch_graph":"https://pith.science/api/pith-number/BJACN6TRZDP4PA4EQSEOYIFUWM/graph.json","fetch_events":"https://pith.science/api/pith-number/BJACN6TRZDP4PA4EQSEOYIFUWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/action/storage_attestation","attest_author":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/action/author_attestation","sign_citation":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/action/citation_signature","submit_replication":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/action/replication_record"}},"created_at":"2026-07-05T11:04:43.215704+00:00","updated_at":"2026-07-05T11:04:43.215704+00:00"}