B-trees, shadowing, and clones

ACM Transactions on Storage

Volumn 3, Issue 4, 2008, Pages

  Rodeh, Ohad ^a  

^a IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

B trees; Concurrency; Copy on write; Shadowing; Snapshots

Indexed keywords

B-TREES; CLONING ALGORITHM; SHADOWING; WRITEABLE SNAPSHOTS;

ALGORITHMS; CONCURRENCY CONTROL; DATA STRUCTURES; FILE EDITORS;

TREES (MATHEMATICS);

EID: 40749137424     PISSN: 15533077     EISSN: 15533093     Source Type: Journal    
DOI: 10.1145/1326542.1326544     Document Type: Article

References (24)

1. BAYER, R. AND MCCREIGHT, E. 1972. Organization and maintenance of large ordered indices. Acta Informática, 173-189.
2. BAYER, R. AND SCHKOLNICK, M. 1977. Concurrency of operations on B-trees. Acta Informática 9, 1-21.
3. BEST, S. 2002. Journaling file systems. Linux Mag.
4. COMER, D. 1979. Ubiquitous B-tree. ACM Comput. Surv. 11, 2, 121-137.
5. GRAEPE, G. 2004. Write-Optimized B-trees. In Proceedings of the International Conference on Very Large Database (VLDB), 672-683.
6. GRAY, J. AND REUTER, A. 1993. Transaction Processing: Concepts and Techniques. Mogran Kaufmann.
7. GUIBAS, L. AND SEDGEWICK, R. 1978. A dichromatic framework for balanced trees. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science.
8. HENSON, V., AHRENS, M., AND BONWICK, J. 2003. Automatic performance tuning in the Zettabyte file system. In USENIX Conference on File and Storage Technologies (work in progress report).
9. HITZ, D., LAU, J., AND MALCOLM, M. 1994. File system design for an NFS file server appliance. In Proceedings of the USENIX Technical Conference.
10. LANIN, V. AND SHASHA, D. 1986. A symmetric concurrent B-tree algorithm. In Proceedings of the ACM Fall Joint Computer Conference, Dallas, TX, 380-389.
11. LEHMAN, P. AND YAO, S. 1981. Efficient locking for concurrent operations on B-trees. ACM Trans. Database Syst. 6, 4, 650-670.
12. LOMET, D. 2001. The evolution of effective B-tree: Page organization and techniques: A personal account. ACM SIGMOD Rec. 30, 3(Sept.), 64-69.
13. LOMET, D. AND SALZBERG, B. 1992. Access method concurrency with recovery. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 351-360.
14. MCKUSICK, M., JOY, W., LEFFLER, S., AND FABRY, R. 1984. A fast file system for Unix. ACM Trans. Comput. Syst.
15. MEGIDDO, N. AND MODHA, D. S. 2003. ARC: A self-tuning, low overhead replacement cache. In USENIX Conference on File and Storage Technologies (FAST).
16. MENON, J., PEASE, D., REES, R., DUYANOVICH, L., AND HILLSBERG, B. 2003. IBM storage tank a heterogeneous scalable SAN file system. IBM Syst. J. 42, 2, 250-267.
17. MOHAN, C. AND LEVINE, F. 1992. ARIES/IM:An efficient and high concurrency index management method using write-ahead logging. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 371-380.
18. MOND, Y. AND RAZ, Y. 1985. Concurrency control in B+ trees databases using preparatory operations. In the 11th International Conference on Very Large Data Bases.
19. REISER, H. 2004. ReiserFS. http://www.namesys.com/.
20. RODEH, O. 2006. B-trees, shadowing, and range-operations. Tech. Rep. H-248. November.
21. ROSENBERG, J., HENSKENS, F., BROWN, A., MORRISON, R., AND MUNRO, D. 1990. Stability in a persistent store based on a large virtual memory. Secur. Persist. 229-245.
22. SOULES, C., GOODSON, G., STRUNK, J., AND GANGER, G. 2003. Metadata efficiency in a comprehensive versioning file system. In USENIX Conference on File and Storage Technologies (FAST).
23. SRINIVASAN, V. AND CAREY, M. 1993. Performance of B+ tree concurrency control algorithms. VLDB J. 2, 4, 361-406.
24. SWEENY, A., DOUCETTE, D., HU, W., ANDERSON, C., NISHIMOTO, M., AND PECK, G. 1996. Scalability in the XFS file system. In Proceedings of the USENIX Technical Conference, 1-14.