Concurrency and recovery for index trees

VLDB Journal

Volumn 6, Issue 3, 1997, Pages 224-240

  Lomet, David ^a   Salzberg, Betty ^b  

^a MICROSOFT   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Access methods; B trees; Concurrency; Indexing; Recovery

Indexed keywords

EID: 0039972208     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s007780050042     Document Type: Article

References (25)

1. Bayer R, Schkolnick M (1977) Concurrency of operations on B-trees. Acta Inf 9:1-21
2. Π-tree: a modified hB-tree supporting concurrency, recovery and node consolidation. In: Dayal U, Gray P, Nishio S (eds) Proc. Very Large Databases Conf., Zurich. Morgan-Kaufman, San Francisco, pp 551-561
3. Π-tree: a multiattribute index supporting concurrency, recovery and node consolidation. VLDB J 6(1): 1-31
4. Gray JN, Lorie RA, Putzolu GR, Traiger IL (1976) Granularity of locks and degrees of consistency in a shared data base. In: IFIP Working Conf on Modeling of Data Base Management Systems, pp 1-29. Reprinted in: Stonebraker M (ed) Readings in Database Systems. Morgan Kaufman, San Francisco, 2nd edn 1994, pp 181-208
5. Gray JN, Lorie RA, Putzolu GR, Traiger IL (1976) Granularity of locks and degrees of consistency in a shared data base. In: IFIP Working Conf on Modeling of Data Base Management Systems, pp 1-29. Reprinted in: Stonebraker M (ed) Readings in Database Systems. Morgan Kaufman, San Francisco, 2nd edn 1994, pp 181-208
6. Gray J, Reuter A (1993) Transaction Processing: Techniques and Concepts. Morgan Kaufman, San Mateo, Calif.
7. Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: Proc. ACMSIGMOD Conf., pp 47-54. Reprinted in: Stonebraker M (ed) Readings in Database Systems. Morgan Kaufman, San Francisco, 2nd edn 1994, pp 125-135
8. Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: Proc. ACMSIGMOD Conf., pp 47-54. Reprinted in: Stonebraker M (ed) Readings in Database Systems. Morgan Kaufman, San Francisco, 2nd edn 1994, pp 125-135
9. Lehman P, Yao SB (1981) Efficient locking for concurrent operations on B-trees. ACM Trans Database Sys 6:650-670
10. Lomet DB (1977) Process structuring, synchronization, and recovery using atomic actions. In: Proc ACM Conf on Language Design for Reliable Software, SIGPLAN Notices 12,3 pp 128-137
11. Lomet DB (1980) Subsystems of processes with deadlock avoidance. IEEE Trans Software Eng SE-6:297-304
12. Lomet D, Salzberg B (1989) Access methods for multiversion data. In: Clifford J, Lindsay B, Maier D (eds) Proc ACM SIGMOD Conf, Portland. ACM, New York pp 315-324
13. Lomet DB (1990) Recovery for shared disk systems using multiple redo logs. Digital Equipment Corp Technical Report CRL90/4 Cambridge Research Lab, Cambridge, Mass.
14. Lomet D, Salzberg B (1990) The hB-tree: a multiattribute indexing method with good guaranteed performance. ACM Trans Database Sys 15:625-658
15. Lomet D, Salzberg B (1992) Access method concurrency with recovery. In: Stonebraker M (ed) Proc. ACM SIGMOD Conf., San Diego. ACM, New York, pp 351-360
16. Lomet DB (1992) MLR: A recovery method for multi-level systems. In: Stonebraker M (ed) Proc. ACM SIGMOD Conf., San Diego, ACM, New York, pp 185-194
17. Mohan C (1990) ARIES/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes. In: McLeod D, Sacks-Davis R, Schek H (eds) Proc. Very Large Databases Conf. Brisbane. Morgan Kaufman, Palo Alto, pp 392-405
18. Mohan C, Haderle D, Lindsay B, Pirahesh P, Schwarz P (1992) ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM Trans Database Sys 19(1): 94-162
19. Mohan C, Levine F (1992) ARIES/IM: an efficient and high concurrency index management method using write-ahead logging. In: Stonebraker M (ed) Proc. ACM SIGMOD Conf. San Diego. ACM, New York, pp 371-380
20. Sagiv Y (1986) Concurrent operations on B* trees with overtaking. J Comput Sys Sci 33:275-296
21. Salzberg B (1985) Restructuring the Lehman-Yao tree. Northeastern University Technical Report TR BS-85-21, Boston, Mass.
22. Shasha D, Goodman N (1988) Concurrent search structure algorithms. ACM Trans Database Sys 13:53-90
23. Weikum G (1986) A theoretical foundation of multi-level concurrency control. Proc ACM PODS Conference, Cambridge, Mass, ACM, New York, pp 31-42
24. Weikum G, Hasse C, Broessler P, Muth P (1990) Multi-level recovery. Proc ACM PODS Conf, Nashville, ACM, New York, pp 109-123
25. +-trees. In: Jagadish HV, Inderpal Singh Mumick (eds). ACM, New York, pp 115-124