Foster b-trees

ACM Transactions on Database Systems

Volumn 37, Issue 3, 2012, Pages

  Graefe, Goetz ^a   Kimura, Hideaki ^b   Kuno, Harumi ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b Brown Univerity   (United States)

Author keywords

Databases; Foster B trees; Indexes; Latching; Locking

Indexed keywords

B TREES; CONTROL REQUIREMENTS; DE-FRAGMENTATION; FLASH DEVICES; FLASH STORAGE; INDEXES; LATCHING; LOCKING; MANY-CORE; MEMORY HIERARCHY; NON-VOLATILE MEMORIES; PERFORMANCE EVALUATION; READ PERFORMANCE; SELF-TESTING; SPECIFIC DESIGN; STORAGE LOCATION; WEAR LEVELING;

CONCURRENCY CONTROL; DATA STRUCTURES; DATABASE SYSTEMS; FLASH MEMORY; NONVOLATILE STORAGE; OPTIMIZATION; TREES (MATHEMATICS);

FORESTRY;

COEFFICIENTS; DATA; FORESTRY; LOCKING; MATHEMATICS; OPTIMIZATION; STRUCTURES; TREES;

EID: 84866511729     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/2338626.2338630     Document Type: Conference Paper

References (40)

1. Bayer, R. and Mccreight, E. 1970. Organization and Maintenance of Large Ordered indices. in Proceedings of the Acm Sigfidet (Now Sigmod) Workshop on Data Description, Access and Control. 107-141.
2. Bayer, R. and Schkolnick, M. 1977. Concurrency of Operations on B-Trees. Acta inf. 9, 1-21.
3. Bayer, R. and Unterauer, K. 1977. Prefix B-Trees. Acm Trans. Databaseyst. 2, 11-26.
4. Bernstein, P. A. and Newcomer, E. 2009. Transaction Processing, 2Nd Ed. Morgan Kaufmann.
5. Borisov, N., Babu, S., Mandagere, N., and Uttamchandani, S. 2011. Dealing Proactively With Data Corruption: Challenges and Opportunities. in Proceedings of the international Conference on Data Engineering (Icde'11). 34-39.
6. Carey, M. J., Dewitt, D. J., Franklin, M. J., Hall, N. E., Mcauliffe, M. L., Naughton, J. F., Schuh, D. T., Solomon, M. H., Tan, C. K., Tsatalos, O. G., White, S. J., and Zwilling, M. J. 1994. Shoring Up Persistent Applications. in Proceedings of the Acm Sigmod Conference on Management of Data. 383-394.
7. Chamberlin, D. D., Astrahan, M. M., Blasgen, M. W., Gray, J. Iii, W. F. K., Lindsay, B. G., Lorie, R. A.,Mehl, J. W., Price, T. G., Putzolu, G. R., Selinger, P. G., Schkolnick, M., Slutz, D. R., Traiger, I. L.,Wade, B. W., and Yost, R. A. 1981. A History and Evaluation of System R. Comm. Acm 24, 10, 632-646.
8. Chen, P. M., Lee, E. K., Gibson, G. A., Katz, R. H., and Patterson, D. A. 1994. Raid: High-Performance, Reliable Secondary Storage. Acm Comput. Surv. 26, 145-185.
9. Comer, D. 1979. The Ubiquitous B-Tree. Acm Comput. Surv. 11, 2, 121-137.
10. Eswaran, K. P., Gray, J., Lorie, R. A., and Traiger, I. L. 1976. The Notions of Consistency and Predicate Locks in A Database System. Comm. Acm 19, 11, 624-633.
11. Graefe, G. 2004. Write-Optimized B-Trees. in Proceedings of the international Conference on Very Large Databases (Vldb'04). 672-683.
12. Graefe, G. 2010. A Survey of B-Tree Locking Techniques. Acm Trans. Database Syst. 35, 3.
13. Graefe, G. 2011. Modern B-Tree Techniques. in Foundations and Trends in Databases.
14. Graefe, G. 2012. A Survey of B-Tree Logging and Recovery Techniques. Acm Trans. Database Syst. 27.
15. Graefe, G. and Kuno, H. 2012. Definition, Detection, and Recovery of Single-Page Failures, A Fourth Class of Database Failures. Proc. Vldb 5, 7, 646-655.
16. Graefe, G., Kuno, H., and Seeger, B. 2012. Self-Diagnosing and Self-Healing indexes. in Proceedings of the Workshop on Testing Database Systems (Dbtest'12).
17. Graefe, G. and Stonecipher, R. 2009. Efficient Verification of B-Tree integrity. in Proceedings of the German Database Conference Datenbanksysteme F Ur Buro, Technik Und Wissenschaft (Btw'09). 27-46.
18. Gray, J. and Reuter, A. 1992. Transaction Processing: Concepts and Techniques. Morgan Kaufmann.
19. Jaluta, I. and Majumda, D. 2006. Efficient Space Management for B-Tree Structure-Modification Operations. in Proceedings of the international Conference on Telecommunication Technology and Applications (Ictta'06). Vol. 2. 2909-2912.
20. Jaluta, I., Sippu, S., and Soisalon-Soininen, E. 2005. Concurrency Control and Recovery for Balanced B-Link Trees. Vldb J. 14, 257-277. (Pubitemid 40536896)
21. Johnson, R., Pandis, I., Hardavellas, N., Ailamaki, A., and Falsafi, B. 2009. Shore-Mt: A Scalable Storage Manager for The Multicore Era. in Proceedings of the international Conference on Extending Database Technology (Edbt'09). 24-35.
22. Johnson, R., Pandis, I., Stoica, R., Athanassoulis, M., and Ailamaki, A. 2010. Aether: A Scalable Approach To Logging. Proc. Vldb 3, 1, 681-692.
23. Kuspert, K. 1985. Fehlererkennung Und Fehlerbehandlung in Speicherungsstrukturen Von Datenbanksystemen. informatik Fachberichte 99.
24. Lanin, V. and Shasha, D. 1986. A Symmetric Concurrent B-Tree Algorithm. in Proceedings of the Acm Fall Joint Computer Conference. Ieee Computer Society Press, Los Alamitos, Ca, 380-389.
25. Lehman, P. L. and Yao, S. B. 1981. Efficient Locking for Concurrent Operations on B-Trees. Acmtrans. Database Syst. 6, 650-670.
26. Lomet, D. B. 1993. Key Range Locking Strategies for Improved Concurrency. in Proceedings of the international Conference on Very Large Databases (Vldb'93). 655-664.
27. Lomet, D. B. 2001. The Evolution of Effective B-Tree Page Organization and Techniques: A Personal Account. Sigmod Rec. 30, 3, 64-69.
28. Lomet, D. B. 2004. Simple, Robust and Highly Concurrent B-Trees With Node Deletion. in Proceedings of the international Conference on Data Engineering (Icde'04). 18-27.
29. Lomet, D. B. and Salzberg, B. 1997. Concurrency and Recovery for index Trees. Vldb J. 6, 3, 224-240.
30. Lomet, D. B. and Tuttle, M. R. 1995. Redo Recovery After System Crashes. in Proceedings of the international Conference on Very Large Databases (Vldb'95). 457-468.
31. Lomet, D. B. and Tuttle,M. R. 2003. A Theory of Redo Recovery. in Proceedings of the Acmsigmod Conference on Management of Data. 397-406.
32. Mohan, C. 1990. Aries/Kvl: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree indexes. in Proceedings of the international Conference on Very Large Databases (Vldb'90). 392-405.
33. Mohan, C. 1995. Disk Read-Write Optimizations and Data integrity in Transaction Systems Using Write-Ahead Logging. in Proceedings of the international Conference on Data Engineering (Icde'95). 324-331.
34. Mohan, C., Haderle, D. J., Lindsay, B. G., Pirahesh, H., and Schwarz, P. M. 1992. Aries: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging. Acm Trans. Database Syst. 17, 1, 94-162.
35. Mohan, C. and Levine, F. E. 1992. Aries/Im: An Efficient and High Concurrency index Management Method Using Write-Ahead Logging. in Proceedings of the Acm Sigmod Conference on Management of Data. 371-380.
36. Pandis, I., Johnson, R., Hardavellas, N., and Ailamaki, A. 2010. Data-Oriented Transaction Execution. Proc. Vldb 3, 1, 928-939.
37. Pandis, I., Tozun, P., Johnson, R., and Ailamaki, A. 2011. Plp: Page Latch-Free Shared-Everything Oltp. Proc. Vldb 4, 10, 610-621.
38. Sagiv, Y. 1985. Concurrent Operations on B-Trees With Overtaking. in Proceedings of the Acm Sigmodsigact-Sigart Symposium on Principles of Database Systems (Pods'85). Acm, New York, 28-37.
39. Sewall, J., Chhugani, J., Kim, C., Satish, N., and Dubey, P. 2011. Palm: Parallel Architecture-Friendly Latchfree Modifications To B+ Trees on Many-Core Processors. Proc. Vldb 4, 11.
40. Weikum, G. 1991. Principles and Realization Strategies of Multilevel Transaction Management. Acm Trans. Database Syst. 16, 1, 132-180.