{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XQQJISYDZYRZCMWEN7HXS2XNK7","short_pith_number":"pith:XQQJISYD","schema_version":"1.0","canonical_sha256":"bc20944b03ce239132c46fcf796aed57f63ca40ee944f9405db803f6392ea65f","source":{"kind":"arxiv","id":"2403.01631","version":4},"attestation_state":"computed","paper":{"title":"TreeTracker Join: Simple, Optimal, Fast","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daniel P. Miranker, Yisu Remy Wang, Zeyuan Hu","submitted_at":"2024-03-03T22:34:19Z","abstract_excerpt":"We present a novel linear-time acyclic join algorithm, TreeTracker Join (TTJ). The algorithm can be understood as the pipelined binary hash join with a simple twist: upon a hash lookup failure, TTJ resets execution to the binding of the tuple causing the failure, and removes the offending tuple from its relation. Compared to the best known linear-time acyclic join algorithm, Yannakakis's algorithm, TTJ shares the same asymptotic complexity while imposing lower overhead. Further, we prove that when measuring query performance by counting the number of hash probes, TTJ will match or outperform b"},"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":"2403.01631","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-03-03T22:34:19Z","cross_cats_sorted":[],"title_canon_sha256":"8980613ced5b39ec5741b8337ae309973cc70b03413d6b92ee2e3f8735ebaab6","abstract_canon_sha256":"d60228ef16afa092730063a50d02ffde641f67051ce3fd7b5083cb9a0a0a1270"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:49.227330Z","signature_b64":"nQJ7d2rL3sEHyhu8Ac3hRSWv83bkICesr0N6Xson9f/ITZ/nPUpj8nPxmkiqgmRvLv1n4oI7GC8LXjMKAAieAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc20944b03ce239132c46fcf796aed57f63ca40ee944f9405db803f6392ea65f","last_reissued_at":"2026-07-05T11:03:49.226881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:49.226881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TreeTracker Join: Simple, Optimal, Fast","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daniel P. Miranker, Yisu Remy Wang, Zeyuan Hu","submitted_at":"2024-03-03T22:34:19Z","abstract_excerpt":"We present a novel linear-time acyclic join algorithm, TreeTracker Join (TTJ). The algorithm can be understood as the pipelined binary hash join with a simple twist: upon a hash lookup failure, TTJ resets execution to the binding of the tuple causing the failure, and removes the offending tuple from its relation. Compared to the best known linear-time acyclic join algorithm, Yannakakis's algorithm, TTJ shares the same asymptotic complexity while imposing lower overhead. Further, we prove that when measuring query performance by counting the number of hash probes, TTJ will match or outperform b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01631","kind":"arxiv","version":4},"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/2403.01631/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":"2403.01631","created_at":"2026-07-05T11:03:49.226937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01631v4","created_at":"2026-07-05T11:03:49.226937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01631","created_at":"2026-07-05T11:03:49.226937+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQQJISYDZYRZ","created_at":"2026-07-05T11:03:49.226937+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQQJISYDZYRZCMWE","created_at":"2026-07-05T11:03:49.226937+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQQJISYD","created_at":"2026-07-05T11:03:49.226937+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/XQQJISYDZYRZCMWEN7HXS2XNK7","json":"https://pith.science/pith/XQQJISYDZYRZCMWEN7HXS2XNK7.json","graph_json":"https://pith.science/api/pith-number/XQQJISYDZYRZCMWEN7HXS2XNK7/graph.json","events_json":"https://pith.science/api/pith-number/XQQJISYDZYRZCMWEN7HXS2XNK7/events.json","paper":"https://pith.science/paper/XQQJISYD"},"agent_actions":{"view_html":"https://pith.science/pith/XQQJISYDZYRZCMWEN7HXS2XNK7","download_json":"https://pith.science/pith/XQQJISYDZYRZCMWEN7HXS2XNK7.json","view_paper":"https://pith.science/paper/XQQJISYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01631&json=true","fetch_graph":"https://pith.science/api/pith-number/XQQJISYDZYRZCMWEN7HXS2XNK7/graph.json","fetch_events":"https://pith.science/api/pith-number/XQQJISYDZYRZCMWEN7HXS2XNK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQQJISYDZYRZCMWEN7HXS2XNK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQQJISYDZYRZCMWEN7HXS2XNK7/action/storage_attestation","attest_author":"https://pith.science/pith/XQQJISYDZYRZCMWEN7HXS2XNK7/action/author_attestation","sign_citation":"https://pith.science/pith/XQQJISYDZYRZCMWEN7HXS2XNK7/action/citation_signature","submit_replication":"https://pith.science/pith/XQQJISYDZYRZCMWEN7HXS2XNK7/action/replication_record"}},"created_at":"2026-07-05T11:03:49.226937+00:00","updated_at":"2026-07-05T11:03:49.226937+00:00"}