{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QIA5KXHV53ONL73BJAE5MRFHB2","short_pith_number":"pith:QIA5KXHV","schema_version":"1.0","canonical_sha256":"8201d55cf5eedcd5ff614809d644a70eb6c726657fc1262f04b16f4365dd52c5","source":{"kind":"arxiv","id":"1411.6763","version":4},"attestation_state":"computed","paper":{"title":"Processing SPARQL Queries Over Distributed RDF Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Dongyan Zhao, Lei Chen, Lei Zou, M. Tamer \\\"Ozsu, Peng Peng","submitted_at":"2014-11-25T08:36:58Z","abstract_excerpt":"We propose techniques for processing SPARQL queries over a large RDF graph in a distributed environment. We adopt a \"partial evaluation and assembly\" framework. Answering a SPARQL query Q is equivalent to finding subgraph matches of the query graph Q over RDF graph G. Based on properties of subgraph matching over a distributed graph, we introduce local partial match as partial answers in each fragment of RDF graph G. For assembly, we propose two methods: centralized and distributed assembly. We analyze our algorithms from both theoretically and experimentally. Extensive experiments over both r"},"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":"1411.6763","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-25T08:36:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"bb9893f591addc5cb79b0cf1dfd4469dca61b672094c5f914daebee3ba079fbb","abstract_canon_sha256":"79ef6414c82d61ef1d32568af33ef2792fc58edb5a847e77867f92c6c2b95519"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:49.445709Z","signature_b64":"NuLfMlfT0wTSdTbNmMQ1w4PM5Xd5jG9pcPG3/F38vdygiQbS/KqOm4YlSfNlcRTgIC3CSdj/CqprhCJtqDqSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8201d55cf5eedcd5ff614809d644a70eb6c726657fc1262f04b16f4365dd52c5","last_reissued_at":"2026-05-18T01:18:49.445172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:49.445172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Processing SPARQL Queries Over Distributed RDF Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"Dongyan Zhao, Lei Chen, Lei Zou, M. Tamer \\\"Ozsu, Peng Peng","submitted_at":"2014-11-25T08:36:58Z","abstract_excerpt":"We propose techniques for processing SPARQL queries over a large RDF graph in a distributed environment. We adopt a \"partial evaluation and assembly\" framework. Answering a SPARQL query Q is equivalent to finding subgraph matches of the query graph Q over RDF graph G. Based on properties of subgraph matching over a distributed graph, we introduce local partial match as partial answers in each fragment of RDF graph G. For assembly, we propose two methods: centralized and distributed assembly. We analyze our algorithms from both theoretically and experimentally. Extensive experiments over both r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6763","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":""},"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":"1411.6763","created_at":"2026-05-18T01:18:49.445247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6763v4","created_at":"2026-05-18T01:18:49.445247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6763","created_at":"2026-05-18T01:18:49.445247+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIA5KXHV53ON","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIA5KXHV53ONL73B","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIA5KXHV","created_at":"2026-05-18T12:28:46.137349+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/QIA5KXHV53ONL73BJAE5MRFHB2","json":"https://pith.science/pith/QIA5KXHV53ONL73BJAE5MRFHB2.json","graph_json":"https://pith.science/api/pith-number/QIA5KXHV53ONL73BJAE5MRFHB2/graph.json","events_json":"https://pith.science/api/pith-number/QIA5KXHV53ONL73BJAE5MRFHB2/events.json","paper":"https://pith.science/paper/QIA5KXHV"},"agent_actions":{"view_html":"https://pith.science/pith/QIA5KXHV53ONL73BJAE5MRFHB2","download_json":"https://pith.science/pith/QIA5KXHV53ONL73BJAE5MRFHB2.json","view_paper":"https://pith.science/paper/QIA5KXHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6763&json=true","fetch_graph":"https://pith.science/api/pith-number/QIA5KXHV53ONL73BJAE5MRFHB2/graph.json","fetch_events":"https://pith.science/api/pith-number/QIA5KXHV53ONL73BJAE5MRFHB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIA5KXHV53ONL73BJAE5MRFHB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIA5KXHV53ONL73BJAE5MRFHB2/action/storage_attestation","attest_author":"https://pith.science/pith/QIA5KXHV53ONL73BJAE5MRFHB2/action/author_attestation","sign_citation":"https://pith.science/pith/QIA5KXHV53ONL73BJAE5MRFHB2/action/citation_signature","submit_replication":"https://pith.science/pith/QIA5KXHV53ONL73BJAE5MRFHB2/action/replication_record"}},"created_at":"2026-05-18T01:18:49.445247+00:00","updated_at":"2026-05-18T01:18:49.445247+00:00"}