B-Tree Concurrency Control Algorithm for Nested Transaction Systems.

@inproceedings{DBLP:conf/dasfaa/Lee93,
  author    = {John K. Lee},
  editor    = {Song C. Moon and
               Hideto Ikeda},
  title     = {B-Tree Concurrency Control Algorithm for Nested Transaction Systems},
  booktitle = {Proceedings of the 3rd International Conference on Database Systems
               for Advanced Applications (DASFAA), Daejeon, Korea, April 6-8,
               1993},
  publisher = {World Scientific},
  series    = {Advanced Database Research and Development Series},
  volume    = {4},
  year      = {1993},
  isbn      = {981-02-1380-8},
  pages     = {205-215},
  ee        = {db/conf/dasfaa/Lee93.html},
  crossref  = {DBLP:conf/dasfaa/93},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

References

[1]

Alexandros Biliris: Operation Specific Locking in B-Trees. PODS 1987: 159-169 BibTeX

[2]

Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976) BibTeX

[3]

Ada Wai-Chee Fu, Tiko Kameda: Concurrency Control of Nested Transactions Accessing B-Trees. PODS 1989: 270-285 BibTeX

[4]

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

[5]

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

[6]

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

[7]

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

[8]

C. Mohan: Commit_LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems. VLDB 1990: 406-418 BibTeX

[9]

Barbara Liskov: Distributed Programming in Argus. Commun. ACM 31(3): 300-312(1988) BibTeX

[10]

John K. Lee, Alan Fekete: Multi-Granularity Locking for Nested Transaction Systems. MFDBS 1991: 160-172 BibTeX

[11]

...

[12]

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

[13]

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

[14]

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

[15]

V. Srinivasan, Michael J. Carey: Performance of B-Tree Concurrency Algorithms. SIGMOD Conference 1991: 416-425 BibTeX