Concurrency of operations on B-trees Export

@article{citeulike:3968370, abstract = {Concurrent operations on B-trees pose the problem of insuring that each operation can be carried out without interfering with other operations being performed simultaneously by other users. This problem can become critical if these structures are being used to support access paths, like indexes, to data base systems. In this case, serializing access to one of these indexes can create an unacceptable bottleneck for the entire system. Thus, there is a need for locking protocols that can assure integrity for each access while at the same time providing a maximum possible degree of concurrency. Another feature required from these protocols is that they be deadlock free, since the cost to resolve a deadlock may be high.}, author = {Bayer, R. and Schkolnick, M.}, citeulike-article-id = {3968370}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/BF00263762}, citeulike-linkout-1 = {http://www.springerlink.com/content/xrh82qh34622213w}, day = {1}, doi = {10.1007/BF00263762}, journal = {Acta Informatica}, keywords = {4ref, b-tree, classic, concurrency, lockcoupling}, month = {March}, number = {1}, pages = {1--21}, posted-at = {2009-01-27 16:46:21}, priority = {2}, title = {Concurrency of operations on B-trees}, url = {http://dx.doi.org/10.1007/BF00263762}, volume = {9}, year = {1977} }

TY - JOUR ID - citeulike:3968370 L3 - citeulike-article-id:3968370 N2 - Concurrent operations on B-trees pose the problem of insuring that each operation can be carried out without interfering with other operations being performed simultaneously by other users. This problem can become critical if these structures are being used to support access paths, like indexes, to data base systems. In this case, serializing access to one of these indexes can create an unacceptable bottleneck for the entire system. Thus, there is a need for locking protocols that can assure integrity for each access while at the same time providing a maximum possible degree of concurrency. Another feature required from these protocols is that they be deadlock free, since the cost to resolve a deadlock may be high. IS - 1 JF - Acta Informatica EP - 21 TI - Concurrency of operations on B-trees VL - 9 SP - 1 KW - 4ref KW - b-tree KW - classic KW - concurrency KW - lockcoupling AU - Bayer, R AU - Schkolnick, M PY - 1977/03/01/ UR - http://dx.doi.org/10.1007/BF00263762 ER -