Comer, Douglas, "Ubiquitous B-Tree," Computer Surveys, vol. 11, No. 2, Jun. 1979, pp. 121-136. |
�BASc! Bayer, R., Schkolnick, M., Concurrency of Operations on B-Trees. Acta Informatica, vol. 9 (1977) pp. 1-21. |
�EGLT! Eswaren, K., Gray, J., Lorie R. and Traiger, I., The Notions of Consistency and Predicate Locks in a Database System. Communications of ACM vol. 19, No. 11 (Nov. 1976) pp. 624-633. |
�ELS! Evangelidis, G., Lomet, D. and Salzberg, B., Modifications of the hB-Tree for Node Consolidation and Concurrency. (in preparation). |
�GLPT! Gray, J.N., Lorie, R.A., Putzulo, G.R., and Traiger, I.L., Granularity of Locks and Degrees of Consistency in a Shared Database. IFIP Working Conf. on Modeling of Data Base Management Systems, (1976) pp. 1-29. (Unavailable). |
�GrRE! Gray, J. and Reuter, A., Transaction Processing: Techniques and Concepts, (in preparation). |
�LeYa! Lehman, P., Yao, S.B., Efficient Locking for Concurrent Operations on B-Trees. ACM Trans on Database Systems, vol. 6, No. 4 (Dec. 1981) pp. 650-670. |
�Lom1! Lomet, D.B. Process structuring, synchronization, and recovery using atomic actions. Proc. ACM Conf. on Language Design for Reliable Software, Sigplan Notices 12, 3 (Mar. 1977) pp. 128-137. |
�Lom2! Lomet, D.B. Subsystems of Processes with Deadlock Avoidance. IEEE Trans. on Software Engineering, vol. SE-6, No. 3 (May 1980) pp. 297-304. |
�Lom3! Lomet, D.B. Recovery for Shared Disk Systems Using Multiple Redo Logs. Digital Equipment Corp. Technical Report CRL90/4 (Oct. 1990) Cambridge Research Lab, Cambridge, MA. |
�LoSa1! Lomet, D., Salzberg, B., Access Methods for Multiversion Data, Proc. ACM SIGMOD Conf. 1989, Portland, OR, pp. 315-324. |
�LoSa2! Lomet, D., Salzberg, B., The hB-Tree: a Multiattribute Indexing Method with Good Guarantee Performance �to appear in! ACM Trans on Database Systems, vol. 15, No. 4 (Dec. 1990). |
�MHLPS! Aries: A Transaction Recovery Method Supporting Fine-Granularity Locking and Parial Rollbacks Using Write-Ahead Logging. IBM Research Report RJ 6649, (Jan. 1989) IBM Almaden Research Center, San Jose, CA. |
�MoLe! Mohan, C., and LEvind, F., Aries/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. IBM Research Report RJ 6846, (Aug. 1989) IBM Almaden Research Center, San Jose, CA. |
�Saqi! Saqiv, Y., Concurrent Operations on B* trees with over-taking. Journal of Computer and System Sciences, vol. 33, No. 2 (1986) pp. 275-296. |
�Salz! Salzberg., B., Restructuring the Lehman-Yao tree. Northeastern University Technical Report TR BS-85-21 (1985), Boston, MA. |
�ShGo! Shasha, D., Goodman, N. Concurrent Search Structure Algorithms. ACM Trans. on Database Systems, vol. 13, No. 1 (Mar. 1988) pp. 53-90. |
Lomet et al., "A Robust Multi-Attribute Search Structures", Proceedings Fifth International Conference on Data Engineering IEEE, pp. 296-304, Feb. 1989. |
Chang et al., "A New Class of Node-Splitting Problems and Applications", 1989 IEEE International Symposium on Circuits and Systems (IEEE CD-ROM), pp. 309-312, May 1989. |
Mancini et al., "Replication within Atomic Actions and Conversations:A Case Study in Fault-Tolerence Duality", IEEE on CD-ROM, pp. 454-461, 1989. |