{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4TLWWQY3EO5VDWYCGZZMBXVWYZ","short_pith_number":"pith:4TLWWQY3","schema_version":"1.0","canonical_sha256":"e4d76b431b23bb51db023672c0deb6c66255c3d830db0a95c894664ef393741a","source":{"kind":"arxiv","id":"1510.07749","version":1},"attestation_state":"computed","paper":{"title":"A partition-based Summary-Graph-Driven Method for Efficient RDF Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Lei Gai, Tengjiao Wang, Wei Chen","submitted_at":"2015-10-27T02:01:53Z","abstract_excerpt":"RDF query optimization is a challenging problem. Although considerable factors and their impacts on query efficiency have been investigated, this problem still needs further investigation. We identify that decomposing query into a series of light-weight operations is also effective in boosting query processing. Considering the linked nature of RDF data, the correlations among operations should be carefully handled. In this paper, we present SGDQ, a novel framework that features a partition-based Summary Graph Driven Query for efficient query processing. Basically, SGDQ partitions data and mode"},"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":"1510.07749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-27T02:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"4014b00bbb4a8cc23c12528eb62206892da9def981d733a9ed0a454bb6ddf2c4","abstract_canon_sha256":"b6dcdbec240225878dbd22d373cb082cf5f3ea19fb6cd190739e5e15d50c3f1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:12.728154Z","signature_b64":"P6IbQ5iDSukPDEjs7p01CKyMHLALl8O1JVFBeRLRGB7jN7S5VDrnB0+cF8NmsZ7mYtszUTkFJnQMJGPHWt/BDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d76b431b23bb51db023672c0deb6c66255c3d830db0a95c894664ef393741a","last_reissued_at":"2026-05-18T01:29:12.727578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:12.727578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A partition-based Summary-Graph-Driven Method for Efficient RDF Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Lei Gai, Tengjiao Wang, Wei Chen","submitted_at":"2015-10-27T02:01:53Z","abstract_excerpt":"RDF query optimization is a challenging problem. Although considerable factors and their impacts on query efficiency have been investigated, this problem still needs further investigation. We identify that decomposing query into a series of light-weight operations is also effective in boosting query processing. Considering the linked nature of RDF data, the correlations among operations should be carefully handled. In this paper, we present SGDQ, a novel framework that features a partition-based Summary Graph Driven Query for efficient query processing. Basically, SGDQ partitions data and mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07749","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":"1510.07749","created_at":"2026-05-18T01:29:12.727685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07749v1","created_at":"2026-05-18T01:29:12.727685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07749","created_at":"2026-05-18T01:29:12.727685+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TLWWQY3EO5V","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TLWWQY3EO5VDWYC","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TLWWQY3","created_at":"2026-05-18T12:29:05.191682+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/4TLWWQY3EO5VDWYCGZZMBXVWYZ","json":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ.json","graph_json":"https://pith.science/api/pith-number/4TLWWQY3EO5VDWYCGZZMBXVWYZ/graph.json","events_json":"https://pith.science/api/pith-number/4TLWWQY3EO5VDWYCGZZMBXVWYZ/events.json","paper":"https://pith.science/paper/4TLWWQY3"},"agent_actions":{"view_html":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ","download_json":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ.json","view_paper":"https://pith.science/paper/4TLWWQY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07749&json=true","fetch_graph":"https://pith.science/api/pith-number/4TLWWQY3EO5VDWYCGZZMBXVWYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4TLWWQY3EO5VDWYCGZZMBXVWYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/action/storage_attestation","attest_author":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/action/author_attestation","sign_citation":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/action/citation_signature","submit_replication":"https://pith.science/pith/4TLWWQY3EO5VDWYCGZZMBXVWYZ/action/replication_record"}},"created_at":"2026-05-18T01:29:12.727685+00:00","updated_at":"2026-05-18T01:29:12.727685+00:00"}