{"id":14777,"date":"2022-05-28T19:56:56","date_gmt":"2022-05-28T23:56:56","guid":{"rendered":"https:\/\/carleton.ca\/scs\/?page_id=14777"},"modified":"2026-06-09T11:03:09","modified_gmt":"2026-06-09T15:03:09","slug":"tr-166-efficient-concurrency-control-protocols-for-b-tree-indexes","status":"publish","type":"page","link":"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1990\/tr-166-efficient-concurrency-control-protocols-for-b-tree-indexes\/","title":{"rendered":"TR-166: Efficient Concurrency Control Protocols for B-tree Indexes"},"content":{"rendered":"\n<section class=\"w-screen px-6 cu-section cu-section--white ml-offset-center md:px-8 lg:px-14\">\n    <div class=\"space-y-6 cu-max-w-child-5xl  md:space-y-10 cu-prose-first-last\">\n\n            <div class=\"cu-textmedia flex flex-col lg:flex-row mx-auto gap-6 md:gap-10 my-6 md:my-12 first:mt-0 max-w-5xl\">\n        <div class=\"justify-start cu-textmedia-content cu-prose-first-last\" style=\"flex: 0 0 100%;\">\n            <header class=\"font-light prose-xl cu-pageheader md:prose-2xl cu-component-updated cu-prose-first-last\">\n                                    <h1 class=\"cu-prose-first-last font-semibold !mt-2 mb-4 md:mb-6 relative after:absolute after:h-px after:bottom-0 after:bg-cu-red after:left-px text-3xl md:text-4xl lg:text-5xl lg:leading-[3.5rem] pb-5 after:w-10 text-cu-black-700 not-prose\">\n                        TR-166: Efficient Concurrency Control Protocols for B-tree Indexes\n                    <\/h1>\n                \n                                \n                            <\/header>\n\n                    <\/div>\n\n            <\/div>\n\n    <\/div>\n<\/section>\n\n\n\n<p>Carleton University<br><a href=\"https:\/\/carleton.ca\/scs\/research\/scs-technical-reports\/technical-reports-1990\/\">Technical Report<\/a>&nbsp;<strong>TR-166<\/strong><br>January 1990<\/p>\n\n\n\n<h2 id=\"efficient-concurrency-control-protocols-for-b-tree-indexes\" class=\"wp-block-heading\">Efficient Concurrency Control Protocols for B-tree Indexes<\/h2>\n\n\n\n<p>Ekow J. Otoo<\/p>\n\n\n\n<h3 id=\"abstract\" class=\"wp-block-heading\">Abstract<\/h3>\n\n\n\n<p>We address the problem of maintaining the consistency and integrity of a B-tree index under a number of independent asynchronous concurrently executing processes. Each process issues an insert, delete or look-up operation. We present a survey of some of the previous works in this area and propose two simple but efficient locking protocol for B-tree indexes. Update processes in our scheme make use of lock conversions. The protocols are deadlock and livelock free and each process ensures that the B-tree characteristics are maintained at all times.<\/p>\n\n\n\n<p><a href=\"https:\/\/carleton.ca\/scs\/wp-content\/uploads\/sites\/260\/TR-166.pdf\">TR-166.pdf<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Carleton UniversityTechnical Report&nbsp;TR-166January 1990 Efficient Concurrency Control Protocols for B-tree Indexes Ekow J. Otoo Abstract We address the problem of maintaining the consistency and integrity of a B-tree index under a number of independent asynchronous concurrently executing processes. Each process issues an insert, delete or look-up operation. We present a survey of some of the [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":11906,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"_cu_dining_location_slug":"","footnotes":"","_links_to":"","_links_to_target":""},"cu_page_type":[],"class_list":["post-14777","page","type-page","status-publish","hentry"],"acf":{"cu_post_thumbnail":""},"_links":{"self":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14777","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/comments?post=14777"}],"version-history":[{"count":2,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14777\/revisions"}],"predecessor-version":[{"id":24545,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/14777\/revisions\/24545"}],"up":[{"embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/pages\/11906"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/media?parent=14777"}],"wp:term":[{"taxonomy":"cu_page_type","embeddable":true,"href":"https:\/\/carleton.ca\/scs\/wp-json\/wp\/v2\/cu_page_type?post=14777"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}