{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GSGYFSL3LD6V2W756OU6ITBG32","short_pith_number":"pith:GSGYFSL3","schema_version":"1.0","canonical_sha256":"348d82c97b58fd5d5bfdf3a9e44c26de9afb0e99b40c113c81e0ceea9e6813a9","source":{"kind":"arxiv","id":"1310.4802","version":1},"attestation_state":"computed","paper":{"title":"On Demand Memory Specialization for Distributed Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"David Dominguez-Sal, Josep Llu\\'is Larriba-Pey, Patrick Valduriez, Reza Akbarinia, Xavier Martinez-Palau","submitted_at":"2013-10-16T15:04:06Z","abstract_excerpt":"In this paper, we propose the DN-tree that is a data structure to build lossy summaries of the frequent data access patterns of the queries in a distributed graph data management system. These compact representations allow us an efficient communication of the data structure in distributed systems. We exploit this data structure with a new \\textit{Dynamic Data Partitioning} strategy (DYDAP) that assigns the portions of the graph according to historical data access patterns, and guarantees a small network communication and a computational load balance in distributed graph queries. This method is"},"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":"1310.4802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-10-16T15:04:06Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2b79ec50e6cbfead5287f85544aed3fd61e1cfaeb28294f85b1880fbfd898775","abstract_canon_sha256":"87bfc62c209f1ecadca5ef65016f2ea57e4243e8b42c96143627cd0a879502c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.681781Z","signature_b64":"Y0x/sWWS/maB5Ah9Gu7YSGC1JpJYNVbGNUymxL3aeNeK88zp++de3+2tO/LdwUAIyLf/70a8V+yAC6AW/ia0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"348d82c97b58fd5d5bfdf3a9e44c26de9afb0e99b40c113c81e0ceea9e6813a9","last_reissued_at":"2026-05-18T03:10:12.680943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.680943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Demand Memory Specialization for Distributed Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DB","authors_text":"David Dominguez-Sal, Josep Llu\\'is Larriba-Pey, Patrick Valduriez, Reza Akbarinia, Xavier Martinez-Palau","submitted_at":"2013-10-16T15:04:06Z","abstract_excerpt":"In this paper, we propose the DN-tree that is a data structure to build lossy summaries of the frequent data access patterns of the queries in a distributed graph data management system. These compact representations allow us an efficient communication of the data structure in distributed systems. We exploit this data structure with a new \\textit{Dynamic Data Partitioning} strategy (DYDAP) that assigns the portions of the graph according to historical data access patterns, and guarantees a small network communication and a computational load balance in distributed graph queries. This method is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4802","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":"1310.4802","created_at":"2026-05-18T03:10:12.681078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4802v1","created_at":"2026-05-18T03:10:12.681078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4802","created_at":"2026-05-18T03:10:12.681078+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSGYFSL3LD6V","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSGYFSL3LD6V2W75","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSGYFSL3","created_at":"2026-05-18T12:27:45.050594+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/GSGYFSL3LD6V2W756OU6ITBG32","json":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32.json","graph_json":"https://pith.science/api/pith-number/GSGYFSL3LD6V2W756OU6ITBG32/graph.json","events_json":"https://pith.science/api/pith-number/GSGYFSL3LD6V2W756OU6ITBG32/events.json","paper":"https://pith.science/paper/GSGYFSL3"},"agent_actions":{"view_html":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32","download_json":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32.json","view_paper":"https://pith.science/paper/GSGYFSL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4802&json=true","fetch_graph":"https://pith.science/api/pith-number/GSGYFSL3LD6V2W756OU6ITBG32/graph.json","fetch_events":"https://pith.science/api/pith-number/GSGYFSL3LD6V2W756OU6ITBG32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32/action/storage_attestation","attest_author":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32/action/author_attestation","sign_citation":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32/action/citation_signature","submit_replication":"https://pith.science/pith/GSGYFSL3LD6V2W756OU6ITBG32/action/replication_record"}},"created_at":"2026-05-18T03:10:12.681078+00:00","updated_at":"2026-05-18T03:10:12.681078+00:00"}