A Theory of Transactions on Recoverable Search Trees.

@inproceedings{DBLP:conf/icdt/SippuS01,
  author    = {Seppo Sippu and
               Eljas Soisalon-Soininen},
  editor    = {Jan Van den Bussche and
               Victor Vianu},
  title     = {A Theory of Transactions on Recoverable Search Trees},
  booktitle = {Database Theory - ICDT 2001, 8th International Conference, London,
               UK, January 4-6, 2001, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1973},
  year      = {2001},
  isbn      = {3-540-41456-8},
  pages     = {83-98},
  ee        = {db/conf/icdt/SippuS01.html, http://link.springer.de/link/service/series/0558/bibs/1973/19730083.htm},
  crossref  = {DBLP:conf/icdt/2001},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Online Edition: Springer LINK

References

[1]

Gustavo Alonso, Radek Vingralek, Divyakant Agrawal, Yuri Breitbart, Amr El Abbadi, Hans-Jörg Schek, Gerhard Weikum: Unifying concurrency control and recovery of transactions. Inf. Syst. 19(1): 101-115(1994) BibTeX

[2]

Rudolf Bayer, Mario Schkolnick: Concurrency of Operations on B-Trees. Acta Inf. 9: 1-21(1977) BibTeX

[3]

Hal Berenson, Philip A. Bernstein, Jim Gray, Jim Melton, Elizabeth J. O'Neil, Patrick E. O'Neil: A Critique of ANSI SQL Isolation Levels. SIGMOD Conference 1995: 1-10 BibTeX

[4]

Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
Contents BibTeX

[5]

Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan Kaufmann 1993, ISBN 1-55860-190-2
Contents BibTeX

[6]

David B. Lomet: Key Range Locking Strategies for Improved Concurrency. VLDB 1993: 655-664 BibTeX

[7]

Philip L. Lehman, S. Bing Yao: Efficient Locking for Concurrent Operations on B-Trees. ACM Trans. Database Syst. 6(4): 650-670(1981) BibTeX

[8]

David B. Lomet: MLR: A Recovery Method for Multi-level Systems. SIGMOD Conference 1992: 185-194 BibTeX

[9]

...

[10]

David B. Lomet, Betty Salzberg: Access Method Concurrency with Recovery. SIGMOD Conference 1992: 351-360 BibTeX

[11]

David B. Lomet, Betty Salzberg: Concurrency and Recovery for Index Trees. VLDB J. 6(3): 224-240(1997) BibTeX

[12]

...

[13]

C. Mohan: ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. VLDB 1990: 392-405 BibTeX

[14]

C. Mohan, Donald J. Haderle, Bruce G. Lindsay, Hamid Pirahesh, Peter M. Schwarz: ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging. ACM Trans. Database Syst. 17(1): 94-162(1992) BibTeX

[15]

C. Mohan, Frank E. Levine: ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging. SIGMOD Conference 1992: 371-380 BibTeX

[16]

Yehoshua Sagiv: Concurrent Operations on B*-Trees with Overtaking. J. Comput. Syst. Sci. 33(2): 275-296(1986) BibTeX

[17]

Hans-Jörg Schek, Gerhard Weikum, Haiyan Ye: Towards a Unified Theory of Concurrency Control and Recovery. PODS 1993: 300-311 BibTeX

[18]

Dennis Shasha, Nathan Goodman: Concurrent Search Structure Algorithms. ACM Trans. Database Syst. 13(1): 53-90(1988) BibTeX

[19]

Radek Vingralek, Haiyan Hasse-Ye, Yuri Breitbart, Hans-Jörg Schek: Unifying Concurrency Control and Recovery of Transactions with Semantically Rich Operations. Theor. Comput. Sci. 190(2): 363-396(1998) BibTeX

[20]

Gerhard Weikum: Principles and Realization Strategies of Multilevel Transaction Management. ACM Trans. Database Syst. 16(1): 132-180(1991) BibTeX