{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SMX7XM7APTIFHEG3RG64QQRICI","short_pith_number":"pith:SMX7XM7A","schema_version":"1.0","canonical_sha256":"932ffbb3e07cd05390db89bdc84228122cac5514216d0ae887b10cf0b2421dee","source":{"kind":"arxiv","id":"2312.09331","version":5},"attestation_state":"computed","paper":{"title":"Insert-Only versus Insert-Delete in Dynamic Query Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmet Kara, Dan Olteanu, Dan Suciu, Mahmoud Abo Khamis","submitted_at":"2023-12-14T20:40:57Z","abstract_excerpt":"We study the dynamic query evaluation problem: Given a full conjunctive query Q and a sequence of updates to the input database, we construct a data structure that supports constant-delay enumeration of the tuples in the query output after each update.\n  We show that a sequence of N insert-only updates to an initially empty database can be executed in total time O(N^w(Q)), where w(Q) is the fractional hypertree width of Q. This matches the complexity of the static query evaluation problem for Q and a database of size N. One corollary is that the amortized time per single-tuple insert is consta"},"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":"2312.09331","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-12-14T20:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"838cbeae1f733ebb0665f8272b81c690897f15edd78afe4315272d572dd225d4","abstract_canon_sha256":"0045f926c859f06335e8683b2904d5dcccb41b6780bf6435fb71571c8c18eb9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:56.496719Z","signature_b64":"Yr+f9TQhQBL/NRfJqcJ1Yr35kuV2iUAPGZRjrFFqK7P9jVPcv+05uEvL2mSCe9QVH6Yd63rgd0O+rllSGLghAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"932ffbb3e07cd05390db89bdc84228122cac5514216d0ae887b10cf0b2421dee","last_reissued_at":"2026-07-05T09:06:56.496287Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:56.496287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Insert-Only versus Insert-Delete in Dynamic Query Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmet Kara, Dan Olteanu, Dan Suciu, Mahmoud Abo Khamis","submitted_at":"2023-12-14T20:40:57Z","abstract_excerpt":"We study the dynamic query evaluation problem: Given a full conjunctive query Q and a sequence of updates to the input database, we construct a data structure that supports constant-delay enumeration of the tuples in the query output after each update.\n  We show that a sequence of N insert-only updates to an initially empty database can be executed in total time O(N^w(Q)), where w(Q) is the fractional hypertree width of Q. This matches the complexity of the static query evaluation problem for Q and a database of size N. One corollary is that the amortized time per single-tuple insert is consta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.09331","kind":"arxiv","version":5},"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/2312.09331/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":"2312.09331","created_at":"2026-07-05T09:06:56.496358+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.09331v5","created_at":"2026-07-05T09:06:56.496358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.09331","created_at":"2026-07-05T09:06:56.496358+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMX7XM7APTIF","created_at":"2026-07-05T09:06:56.496358+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMX7XM7APTIFHEG3","created_at":"2026-07-05T09:06:56.496358+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMX7XM7A","created_at":"2026-07-05T09:06:56.496358+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/SMX7XM7APTIFHEG3RG64QQRICI","json":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI.json","graph_json":"https://pith.science/api/pith-number/SMX7XM7APTIFHEG3RG64QQRICI/graph.json","events_json":"https://pith.science/api/pith-number/SMX7XM7APTIFHEG3RG64QQRICI/events.json","paper":"https://pith.science/paper/SMX7XM7A"},"agent_actions":{"view_html":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI","download_json":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI.json","view_paper":"https://pith.science/paper/SMX7XM7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.09331&json=true","fetch_graph":"https://pith.science/api/pith-number/SMX7XM7APTIFHEG3RG64QQRICI/graph.json","fetch_events":"https://pith.science/api/pith-number/SMX7XM7APTIFHEG3RG64QQRICI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI/action/storage_attestation","attest_author":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI/action/author_attestation","sign_citation":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI/action/citation_signature","submit_replication":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI/action/replication_record"}},"created_at":"2026-07-05T09:06:56.496358+00:00","updated_at":"2026-07-05T09:06:56.496358+00:00"}