Author:
Brinkmann Filip-Martin,Schuldt Heiko
Reference27 articles.
1. M. K. Aguilera, W. Golab, and M. A. Shah. A practical scalable distributed B-Tree. Proceedings of the VLDB Endowment, 1(1):598--609, 2008.
2. F. Akal, C. Türker, H. Schek, Y. Breitbart, T. Grabs, and L. Veen. Fine-Grained Replication and Scheduling with Freshness and Correctness Guarantees. In Proceedings of the 31st International Conference on Very Large Data Bases, pages 565--576, Trondheim, Norway, 2005. ACM.
3. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion b-tree. The VLDB Journal, 5(4):264--275, Dec. 1996.
4. P. A. Bernstein and N. Goodman. Concurrency control algorithms for multiversion database systems. In Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of Distributed Computing, PODC '82, pages 209--215. ACM, 1982.
5. P. A. Bernstein and N. Goodman. Multiversion concurrency control-theory and algorithms. ACM Trans. Database Syst., 8(4):465--483, Dec. 1983.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献