{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SVI5NPAEXDGLOX37H5MN3VTRRR","short_pith_number":"pith:SVI5NPAE","schema_version":"1.0","canonical_sha256":"9551d6bc04b8ccb75f7f3f58ddd6718c7d304841aceec0989b3d501cd930f295","source":{"kind":"arxiv","id":"2204.09235","version":2},"attestation_state":"computed","paper":{"title":"JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Sanjay Krishnan, Stavros Sintos, Xi Liang","submitted_at":"2022-04-20T05:39:31Z","abstract_excerpt":"Approximate query processing over dynamic databases, i.e., under insertions/deletions, has applications ranging from high-frequency trading to internet-of-things analytics. We present JanusAQP, a new dynamic AQP system, which supports SUM, COUNT, AVG, MIN, and MAX queries under insertions and deletions to the dataset. JanusAQP extends static partition tree synopses, which are hierarchical aggregations of datasets, into the dynamic setting. This paper contributes new methods for: (1) efficient initialization of the data synopsis in the presence of incoming data, (2) maintenance of the data syno"},"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":"2204.09235","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-04-20T05:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"02e88e9c91b4debe09b9d9f6715a9413ee97fd9008a0944db07b69e3866286f0","abstract_canon_sha256":"a39800fffd6bb239ab827491ee838502ac0c4beedc919de5b61fef836fa3564a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:43:43.817041Z","signature_b64":"I4Kv8m3cMubLBHEsxAMFHbykgCOhEKPLi1R+wwpiovHHww+pC3uhVSWy2W2Bqh2aENHmBYjgeCvc0qyUZ0XqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9551d6bc04b8ccb75f7f3f58ddd6718c7d304841aceec0989b3d501cd930f295","last_reissued_at":"2026-07-05T04:43:43.816689Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:43:43.816689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Sanjay Krishnan, Stavros Sintos, Xi Liang","submitted_at":"2022-04-20T05:39:31Z","abstract_excerpt":"Approximate query processing over dynamic databases, i.e., under insertions/deletions, has applications ranging from high-frequency trading to internet-of-things analytics. We present JanusAQP, a new dynamic AQP system, which supports SUM, COUNT, AVG, MIN, and MAX queries under insertions and deletions to the dataset. JanusAQP extends static partition tree synopses, which are hierarchical aggregations of datasets, into the dynamic setting. This paper contributes new methods for: (1) efficient initialization of the data synopsis in the presence of incoming data, (2) maintenance of the data syno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.09235","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.09235/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":"2204.09235","created_at":"2026-07-05T04:43:43.816748+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.09235v2","created_at":"2026-07-05T04:43:43.816748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.09235","created_at":"2026-07-05T04:43:43.816748+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVI5NPAEXDGL","created_at":"2026-07-05T04:43:43.816748+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVI5NPAEXDGLOX37","created_at":"2026-07-05T04:43:43.816748+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVI5NPAE","created_at":"2026-07-05T04:43:43.816748+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/SVI5NPAEXDGLOX37H5MN3VTRRR","json":"https://pith.science/pith/SVI5NPAEXDGLOX37H5MN3VTRRR.json","graph_json":"https://pith.science/api/pith-number/SVI5NPAEXDGLOX37H5MN3VTRRR/graph.json","events_json":"https://pith.science/api/pith-number/SVI5NPAEXDGLOX37H5MN3VTRRR/events.json","paper":"https://pith.science/paper/SVI5NPAE"},"agent_actions":{"view_html":"https://pith.science/pith/SVI5NPAEXDGLOX37H5MN3VTRRR","download_json":"https://pith.science/pith/SVI5NPAEXDGLOX37H5MN3VTRRR.json","view_paper":"https://pith.science/paper/SVI5NPAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.09235&json=true","fetch_graph":"https://pith.science/api/pith-number/SVI5NPAEXDGLOX37H5MN3VTRRR/graph.json","fetch_events":"https://pith.science/api/pith-number/SVI5NPAEXDGLOX37H5MN3VTRRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVI5NPAEXDGLOX37H5MN3VTRRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVI5NPAEXDGLOX37H5MN3VTRRR/action/storage_attestation","attest_author":"https://pith.science/pith/SVI5NPAEXDGLOX37H5MN3VTRRR/action/author_attestation","sign_citation":"https://pith.science/pith/SVI5NPAEXDGLOX37H5MN3VTRRR/action/citation_signature","submit_replication":"https://pith.science/pith/SVI5NPAEXDGLOX37H5MN3VTRRR/action/replication_record"}},"created_at":"2026-07-05T04:43:43.816748+00:00","updated_at":"2026-07-05T04:43:43.816748+00:00"}