{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HBSG56VK62U6K6Z2LMNEIKNDCE","short_pith_number":"pith:HBSG56VK","schema_version":"1.0","canonical_sha256":"38646efaaaf6a9e57b3a5b1a4429a3112d28705716a60b07866f6c31010a90c3","source":{"kind":"arxiv","id":"1104.2079","version":1},"attestation_state":"computed","paper":{"title":"Optimizing XML querying using type-based document projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dario Colazzo, Giuseppe Castagna, Kim Nguyen, V\\'eronique Benzaken","submitted_at":"2011-04-11T22:32:31Z","abstract_excerpt":"XML data projection (or pruning) is a natural optimization for main memory query engines: given a query Q over a document D, the subtrees of D that are not necessary to evaluate Q are pruned, thus producing a smaller document D'; the query Q is then executed on D', hence avoiding to allocate and process nodes that will never be reached by Q. In this article, we propose a new approach, based on types, that greatly improves current solutions. Besides providing comparable or greater precision and far lesser pruning overhead, our solution ---unlike current approaches--- takes into account backward"},"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":"1104.2079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-04-11T22:32:31Z","cross_cats_sorted":[],"title_canon_sha256":"2dc84a4f0bde3d90d7be1c51cc796a475b9a88511ba2ab23ba0f837ccf44e7ec","abstract_canon_sha256":"27bb3832233fa779b0963d6a4ddac8be762b9725da6031410411594f667284f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:09.847358Z","signature_b64":"d7+e949kZB1k4oU3Okk+RmvidFKkNokagutAHmDAH8CIgqn1Dw8Su5T8iM5bn2sAjYYXC+BTn7woygDBUmn4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38646efaaaf6a9e57b3a5b1a4429a3112d28705716a60b07866f6c31010a90c3","last_reissued_at":"2026-05-18T02:22:09.846817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:09.846817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing XML querying using type-based document projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dario Colazzo, Giuseppe Castagna, Kim Nguyen, V\\'eronique Benzaken","submitted_at":"2011-04-11T22:32:31Z","abstract_excerpt":"XML data projection (or pruning) is a natural optimization for main memory query engines: given a query Q over a document D, the subtrees of D that are not necessary to evaluate Q are pruned, thus producing a smaller document D'; the query Q is then executed on D', hence avoiding to allocate and process nodes that will never be reached by Q. In this article, we propose a new approach, based on types, that greatly improves current solutions. Besides providing comparable or greater precision and far lesser pruning overhead, our solution ---unlike current approaches--- takes into account backward"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2079","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":"1104.2079","created_at":"2026-05-18T02:22:09.846906+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2079v1","created_at":"2026-05-18T02:22:09.846906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2079","created_at":"2026-05-18T02:22:09.846906+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBSG56VK62U6","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBSG56VK62U6K6Z2","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBSG56VK","created_at":"2026-05-18T12:26:30.835961+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/HBSG56VK62U6K6Z2LMNEIKNDCE","json":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE.json","graph_json":"https://pith.science/api/pith-number/HBSG56VK62U6K6Z2LMNEIKNDCE/graph.json","events_json":"https://pith.science/api/pith-number/HBSG56VK62U6K6Z2LMNEIKNDCE/events.json","paper":"https://pith.science/paper/HBSG56VK"},"agent_actions":{"view_html":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE","download_json":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE.json","view_paper":"https://pith.science/paper/HBSG56VK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2079&json=true","fetch_graph":"https://pith.science/api/pith-number/HBSG56VK62U6K6Z2LMNEIKNDCE/graph.json","fetch_events":"https://pith.science/api/pith-number/HBSG56VK62U6K6Z2LMNEIKNDCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/action/storage_attestation","attest_author":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/action/author_attestation","sign_citation":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/action/citation_signature","submit_replication":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/action/replication_record"}},"created_at":"2026-05-18T02:22:09.846906+00:00","updated_at":"2026-05-18T02:22:09.846906+00:00"}