{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y67YX56UZKZFIDC2W5OTDFPEKA","short_pith_number":"pith:Y67YX56U","schema_version":"1.0","canonical_sha256":"c7bf8bf7d4cab2540c5ab75d3195e4503f9beec42a762575b87a39cb2e7a1ac4","source":{"kind":"arxiv","id":"1507.03049","version":2},"attestation_state":"computed","paper":{"title":"Forecasting the cost of processing multi-join queries via hashing for main-memory databases (Extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Feilong Liu, Spyros Blanas (The Ohio State University)","submitted_at":"2015-07-11T00:17:59Z","abstract_excerpt":"Database management systems (DBMSs) carefully optimize complex multi-join queries to avoid expensive disk I/O. As servers today feature tens or hundreds of gigabytes of RAM, a significant fraction of many analytic databases becomes memory-resident. Even after careful tuning for an in-memory environment, a linear disk I/O model such as the one implemented in PostgreSQL may make query response time predictions that are up to 2X slower than the optimal multi-join query plan over memory-resident data. This paper introduces a memory I/O cost model to identify good evaluation strategies for complex "},"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":"1507.03049","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-07-11T00:17:59Z","cross_cats_sorted":[],"title_canon_sha256":"80bfc490664bb9bbc8c6c6067dfd2624fa4cbf72fe16ae186737b54034c80355","abstract_canon_sha256":"5e9b8896eb3f4930312a3142b659827f9cb9956d8d0757c8fd907993896db0b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:33.022784Z","signature_b64":"g+HAmyFaEH1XlAi1gg6d1xr6BPbPFkRpJCwCZMfWurDD/vGOSWS9huqFaWaOmk+5jL9jPmzUusWCTMs2ZT0GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7bf8bf7d4cab2540c5ab75d3195e4503f9beec42a762575b87a39cb2e7a1ac4","last_reissued_at":"2026-05-18T01:36:33.022223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:33.022223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forecasting the cost of processing multi-join queries via hashing for main-memory databases (Extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Feilong Liu, Spyros Blanas (The Ohio State University)","submitted_at":"2015-07-11T00:17:59Z","abstract_excerpt":"Database management systems (DBMSs) carefully optimize complex multi-join queries to avoid expensive disk I/O. As servers today feature tens or hundreds of gigabytes of RAM, a significant fraction of many analytic databases becomes memory-resident. Even after careful tuning for an in-memory environment, a linear disk I/O model such as the one implemented in PostgreSQL may make query response time predictions that are up to 2X slower than the optimal multi-join query plan over memory-resident data. This paper introduces a memory I/O cost model to identify good evaluation strategies for complex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03049","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":"1507.03049","created_at":"2026-05-18T01:36:33.022303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03049v2","created_at":"2026-05-18T01:36:33.022303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03049","created_at":"2026-05-18T01:36:33.022303+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y67YX56UZKZF","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y67YX56UZKZFIDC2","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y67YX56U","created_at":"2026-05-18T12:29:50.041715+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/Y67YX56UZKZFIDC2W5OTDFPEKA","json":"https://pith.science/pith/Y67YX56UZKZFIDC2W5OTDFPEKA.json","graph_json":"https://pith.science/api/pith-number/Y67YX56UZKZFIDC2W5OTDFPEKA/graph.json","events_json":"https://pith.science/api/pith-number/Y67YX56UZKZFIDC2W5OTDFPEKA/events.json","paper":"https://pith.science/paper/Y67YX56U"},"agent_actions":{"view_html":"https://pith.science/pith/Y67YX56UZKZFIDC2W5OTDFPEKA","download_json":"https://pith.science/pith/Y67YX56UZKZFIDC2W5OTDFPEKA.json","view_paper":"https://pith.science/paper/Y67YX56U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03049&json=true","fetch_graph":"https://pith.science/api/pith-number/Y67YX56UZKZFIDC2W5OTDFPEKA/graph.json","fetch_events":"https://pith.science/api/pith-number/Y67YX56UZKZFIDC2W5OTDFPEKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y67YX56UZKZFIDC2W5OTDFPEKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y67YX56UZKZFIDC2W5OTDFPEKA/action/storage_attestation","attest_author":"https://pith.science/pith/Y67YX56UZKZFIDC2W5OTDFPEKA/action/author_attestation","sign_citation":"https://pith.science/pith/Y67YX56UZKZFIDC2W5OTDFPEKA/action/citation_signature","submit_replication":"https://pith.science/pith/Y67YX56UZKZFIDC2W5OTDFPEKA/action/replication_record"}},"created_at":"2026-05-18T01:36:33.022303+00:00","updated_at":"2026-05-18T01:36:33.022303+00:00"}