{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KJXLV6Z5OXVGKDTHCUZVJANWD2","short_pith_number":"pith:KJXLV6Z5","schema_version":"1.0","canonical_sha256":"526ebafb3d75ea650e6715335481b61ea8aa478c793d68becee8d2523bc1944e","source":{"kind":"arxiv","id":"1503.03642","version":1},"attestation_state":"computed","paper":{"title":"DGCC:A New Dependency Graph based Concurrency Control Protocol for Multicore Database Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Beng Chin Ooi, Chang Yao, Divyakant Agrawal, Gang Chen, Meihui Zhang, Pengfei Chang, Weng-Fai Wong","submitted_at":"2015-03-12T09:32:02Z","abstract_excerpt":"Multicore CPUs and large memories are increasingly becoming the norm in modern computer systems. However, current database management systems (DBMSs) are generally ineffective in exploiting the parallelism of such systems. In particular, contention can lead to a dramatic fall in performance. In this paper, we propose a new concurrency control protocol called DGCC (Dependency Graph based Concurrency Control) that separates concurrency control from execution. DGCC builds dependency graphs for batched transactions before executing them. Using these graphs, contentions within the same batch of tra"},"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":"1503.03642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-03-12T09:32:02Z","cross_cats_sorted":[],"title_canon_sha256":"f50128f156135c7bd920d871365899e52fe0a8140580d86fc09f6f4b4d4cdcd6","abstract_canon_sha256":"201fcae35a05f2a29fbbe86a2dd3043cc68fefc94673a99a2a71e70fe06f040e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:27.751246Z","signature_b64":"KUu/wuYmcW+aL2SVIJ95Txg9lZKH8yHnf+oh4gc8WIjMkc967Ea7KdlJx6Sx70RvrwxAMxBLwkfS1YRQTn5eAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"526ebafb3d75ea650e6715335481b61ea8aa478c793d68becee8d2523bc1944e","last_reissued_at":"2026-05-18T02:24:27.750479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:27.750479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DGCC:A New Dependency Graph based Concurrency Control Protocol for Multicore Database Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Beng Chin Ooi, Chang Yao, Divyakant Agrawal, Gang Chen, Meihui Zhang, Pengfei Chang, Weng-Fai Wong","submitted_at":"2015-03-12T09:32:02Z","abstract_excerpt":"Multicore CPUs and large memories are increasingly becoming the norm in modern computer systems. However, current database management systems (DBMSs) are generally ineffective in exploiting the parallelism of such systems. In particular, contention can lead to a dramatic fall in performance. In this paper, we propose a new concurrency control protocol called DGCC (Dependency Graph based Concurrency Control) that separates concurrency control from execution. DGCC builds dependency graphs for batched transactions before executing them. Using these graphs, contentions within the same batch of tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03642","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":"1503.03642","created_at":"2026-05-18T02:24:27.750591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03642v1","created_at":"2026-05-18T02:24:27.750591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03642","created_at":"2026-05-18T02:24:27.750591+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJXLV6Z5OXVG","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJXLV6Z5OXVGKDTH","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJXLV6Z5","created_at":"2026-05-18T12:29:29.992203+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/KJXLV6Z5OXVGKDTHCUZVJANWD2","json":"https://pith.science/pith/KJXLV6Z5OXVGKDTHCUZVJANWD2.json","graph_json":"https://pith.science/api/pith-number/KJXLV6Z5OXVGKDTHCUZVJANWD2/graph.json","events_json":"https://pith.science/api/pith-number/KJXLV6Z5OXVGKDTHCUZVJANWD2/events.json","paper":"https://pith.science/paper/KJXLV6Z5"},"agent_actions":{"view_html":"https://pith.science/pith/KJXLV6Z5OXVGKDTHCUZVJANWD2","download_json":"https://pith.science/pith/KJXLV6Z5OXVGKDTHCUZVJANWD2.json","view_paper":"https://pith.science/paper/KJXLV6Z5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03642&json=true","fetch_graph":"https://pith.science/api/pith-number/KJXLV6Z5OXVGKDTHCUZVJANWD2/graph.json","fetch_events":"https://pith.science/api/pith-number/KJXLV6Z5OXVGKDTHCUZVJANWD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJXLV6Z5OXVGKDTHCUZVJANWD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJXLV6Z5OXVGKDTHCUZVJANWD2/action/storage_attestation","attest_author":"https://pith.science/pith/KJXLV6Z5OXVGKDTHCUZVJANWD2/action/author_attestation","sign_citation":"https://pith.science/pith/KJXLV6Z5OXVGKDTHCUZVJANWD2/action/citation_signature","submit_replication":"https://pith.science/pith/KJXLV6Z5OXVGKDTHCUZVJANWD2/action/replication_record"}},"created_at":"2026-05-18T02:24:27.750591+00:00","updated_at":"2026-05-18T02:24:27.750591+00:00"}