{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IWTIB23KXEXCCTV3FHGSIEM7IC","short_pith_number":"pith:IWTIB23K","schema_version":"1.0","canonical_sha256":"45a680eb6ab92e214ebb29cd24119f40b5b27daac889b5a3a185d44ba905177f","source":{"kind":"arxiv","id":"1807.07691","version":1},"attestation_state":"computed","paper":{"title":"gSMat: A Scalable Sparse Matrix-based Join for SPARQL Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jiaming Song, Lei Zou, Mingyue Zhang, Peng Peng, Xiaowang Zhang, Zhiyong Feng","submitted_at":"2018-07-20T01:52:45Z","abstract_excerpt":"Resource Description Framework (RDF) has been widely used to represent information on the web, while SPARQL is a standard query language to manipulate RDF data. Given a SPARQL query, there often exist many joins which are the bottlenecks of efficiency of query processing. Besides, the real RDF datasets often reveal strong data sparsity, which indicates that a resource often only relates to a few resources even the number of total resources is large. In this paper, we propose a sparse matrix-based (SM-based) SPARQL query processing approach over RDF datasets which con- siders both join optimiza"},"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":"1807.07691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-07-20T01:52:45Z","cross_cats_sorted":[],"title_canon_sha256":"68d32ebffe16415fe23b16f597b404698b140a69c64db2318e439db05e7d17ab","abstract_canon_sha256":"e9f21c51dc0bbc60a1166c32a067641c10ebff429fc3111f894e0b7d0a309540"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:15.879522Z","signature_b64":"YI5Odt12VVfcTtYQMr8SaM1Qsbr+DHEmztPzMr+H1gCVTBc6EXv5Ftjem5m1FbutrftIX/CfBdjuJl4NhPPJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45a680eb6ab92e214ebb29cd24119f40b5b27daac889b5a3a185d44ba905177f","last_reissued_at":"2026-05-18T00:10:15.878856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:15.878856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"gSMat: A Scalable Sparse Matrix-based Join for SPARQL Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jiaming Song, Lei Zou, Mingyue Zhang, Peng Peng, Xiaowang Zhang, Zhiyong Feng","submitted_at":"2018-07-20T01:52:45Z","abstract_excerpt":"Resource Description Framework (RDF) has been widely used to represent information on the web, while SPARQL is a standard query language to manipulate RDF data. Given a SPARQL query, there often exist many joins which are the bottlenecks of efficiency of query processing. Besides, the real RDF datasets often reveal strong data sparsity, which indicates that a resource often only relates to a few resources even the number of total resources is large. In this paper, we propose a sparse matrix-based (SM-based) SPARQL query processing approach over RDF datasets which con- siders both join optimiza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07691","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":"1807.07691","created_at":"2026-05-18T00:10:15.878952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07691v1","created_at":"2026-05-18T00:10:15.878952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07691","created_at":"2026-05-18T00:10:15.878952+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWTIB23KXEXC","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWTIB23KXEXCCTV3","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWTIB23K","created_at":"2026-05-18T12:32:31.084164+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/IWTIB23KXEXCCTV3FHGSIEM7IC","json":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC.json","graph_json":"https://pith.science/api/pith-number/IWTIB23KXEXCCTV3FHGSIEM7IC/graph.json","events_json":"https://pith.science/api/pith-number/IWTIB23KXEXCCTV3FHGSIEM7IC/events.json","paper":"https://pith.science/paper/IWTIB23K"},"agent_actions":{"view_html":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC","download_json":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC.json","view_paper":"https://pith.science/paper/IWTIB23K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07691&json=true","fetch_graph":"https://pith.science/api/pith-number/IWTIB23KXEXCCTV3FHGSIEM7IC/graph.json","fetch_events":"https://pith.science/api/pith-number/IWTIB23KXEXCCTV3FHGSIEM7IC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/action/storage_attestation","attest_author":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/action/author_attestation","sign_citation":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/action/citation_signature","submit_replication":"https://pith.science/pith/IWTIB23KXEXCCTV3FHGSIEM7IC/action/replication_record"}},"created_at":"2026-05-18T00:10:15.878952+00:00","updated_at":"2026-05-18T00:10:15.878952+00:00"}