References
| [Bil87] | Biliris, A. Operation specific locking in b-trees. Pods '87: |
| proceedings of the sixth acm sigact-sigmod-sigart symposium on | |
| principles of database systems, pages 159—169. New York, NY, | |
| USA, 1987. ACM Press. | |
| [Com79] | Comer, D. Ubiquitous b-tree. ACM Comput. Surv., 11(2):121—137, |
| 1979. | |
| [Coo78] | Cook, T. J. A dynamic address computation mechanism for use in |
| database management. Sigmod '78: proceedings of the 1978 acm | |
| sigmod international conference on management of data, pages | |
| 78—87. New York, NY, USA, 1978. ACM Press. | |
| [JS89] | Johnson, T. and D. Shasha. Utilization of b-trees with inserts, |
| deletes and modifies. Pods '89: proceedings of the eighth acm | |
| sigact-sigmod-sigart symposium on principles of database systems, | |
| pages 235—246. New York, NY, USA, 1989. ACM Press. | |
| [JS93a] | Johnson, T. and D. Sasha. The performance of current b-tree |
| algorithms. ACM Trans. Database Syst., 18(1):51—101, 1993. | |
| [JS93b] | Johnson, T. and D. Shasha. B-trees with inserts and deletes: why |
| free-at-empty is better than merge-at-half. Journal of Computer | |
| and System Sciencesn, 47(1):45-76, 1993. | |
| [Jan95] | Jannink, J. Implementing deletion in b+-trees. SIGMOD Rec., |
| 24(1):33—38, 1995. | |
| [KW01] | Kim, S.-W. and H.-S. Won. Batch-construction of b+-trees. Sac |
| '01: proceedings of the 2001 acm symposium on applied computing, | |
| pages 231—235. New York, NY, USA, 2001. ACM Press. | |
| [LM91] | Lanka, S. and E. Mays. Fully persistent b+-trees. Sigmod '91: |
| proceedings of the 1991 acm sigmod international conference on | |
| management of data, pages 426—435. New York, NY, USA, 1991. ACM | |
| Press. | |
| [LsBY81] | Lehman, P. L. and s. B. Y. s. Bing Yao. Efficient locking for |
| concurrent operations on b-trees. ACM Trans. Database Syst., | |
| 6(4):650—670, 1981. | |
| [MO95] | Maelbrancke, R. and H. Olivié. Optimizing jan jannink's |
| implementation of b+-tree deletion. SIGMOD Rec., 24(3):5—7, 1995. | |
These documents are available via The ACM Digital Library. Many universities subscribe to ACM, so check your local university library for access if necessary.
