{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7ZXKHFYHKWQXY327HKAXSLAOWT","short_pith_number":"pith:7ZXKHFYH","schema_version":"1.0","canonical_sha256":"fe6ea3970755a17c6f5f3a81792c0eb4e81144d34757571f2142a5f426a9ca59","source":{"kind":"arxiv","id":"1602.08721","version":1},"attestation_state":"computed","paper":{"title":"Flexible Caching in Trie Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Benny Kimelfeld, Oren Kalinsky, Yoav Etsion","submitted_at":"2016-02-28T14:26:08Z","abstract_excerpt":"Traditional algorithms for multiway join computation are based on rewriting the order of joins and combining results of intermediate subqueries. Recently, several approaches have been proposed for algorithms that are \"worst-case optimal\" wherein all relations are scanned simultaneously. An example is Veldhuizen's Leapfrog Trie Join (LFTJ). An important advantage of LFTJ is its small memory footprint, due to the fact that intermediate results are full tuples that can be dumped immediately. However, since the algorithm does not store intermediate results, recurring joins must be reconstructed fr"},"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":"1602.08721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-28T14:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"8b04a078ba8c6f5ce782e4d1730ba1a133e6e34db3a75caca0c96b74c90765ab","abstract_canon_sha256":"eef8182274a14da08769dbcd09ee9e35df3da112eaaff0c0e6958a125b87f9f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:52.095399Z","signature_b64":"+NLgenIsd4HjWymQzbO39Cszvdsgfm+/CBYkPajQm196dEXr1Qxm3mn0aV128Y1sldvK8HEWLLUqQBEJ82jeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe6ea3970755a17c6f5f3a81792c0eb4e81144d34757571f2142a5f426a9ca59","last_reissued_at":"2026-05-18T01:19:52.094846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:52.094846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flexible Caching in Trie Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Benny Kimelfeld, Oren Kalinsky, Yoav Etsion","submitted_at":"2016-02-28T14:26:08Z","abstract_excerpt":"Traditional algorithms for multiway join computation are based on rewriting the order of joins and combining results of intermediate subqueries. Recently, several approaches have been proposed for algorithms that are \"worst-case optimal\" wherein all relations are scanned simultaneously. An example is Veldhuizen's Leapfrog Trie Join (LFTJ). An important advantage of LFTJ is its small memory footprint, due to the fact that intermediate results are full tuples that can be dumped immediately. However, since the algorithm does not store intermediate results, recurring joins must be reconstructed fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08721","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":"1602.08721","created_at":"2026-05-18T01:19:52.094949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08721v1","created_at":"2026-05-18T01:19:52.094949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08721","created_at":"2026-05-18T01:19:52.094949+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZXKHFYHKWQX","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZXKHFYHKWQXY327","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZXKHFYH","created_at":"2026-05-18T12:30:04.600751+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/7ZXKHFYHKWQXY327HKAXSLAOWT","json":"https://pith.science/pith/7ZXKHFYHKWQXY327HKAXSLAOWT.json","graph_json":"https://pith.science/api/pith-number/7ZXKHFYHKWQXY327HKAXSLAOWT/graph.json","events_json":"https://pith.science/api/pith-number/7ZXKHFYHKWQXY327HKAXSLAOWT/events.json","paper":"https://pith.science/paper/7ZXKHFYH"},"agent_actions":{"view_html":"https://pith.science/pith/7ZXKHFYHKWQXY327HKAXSLAOWT","download_json":"https://pith.science/pith/7ZXKHFYHKWQXY327HKAXSLAOWT.json","view_paper":"https://pith.science/paper/7ZXKHFYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08721&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZXKHFYHKWQXY327HKAXSLAOWT/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZXKHFYHKWQXY327HKAXSLAOWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZXKHFYHKWQXY327HKAXSLAOWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZXKHFYHKWQXY327HKAXSLAOWT/action/storage_attestation","attest_author":"https://pith.science/pith/7ZXKHFYHKWQXY327HKAXSLAOWT/action/author_attestation","sign_citation":"https://pith.science/pith/7ZXKHFYHKWQXY327HKAXSLAOWT/action/citation_signature","submit_replication":"https://pith.science/pith/7ZXKHFYHKWQXY327HKAXSLAOWT/action/replication_record"}},"created_at":"2026-05-18T01:19:52.094949+00:00","updated_at":"2026-05-18T01:19:52.094949+00:00"}