B-tree Last modified: Friday, May 19, 2006
Most often used in databases and file systems, B-trees are tree structures (a type of data structure) that are optimized for situations when all or part of the tree must be maintained on a secondary storage device such as an optical disk or tape. A B-tree is designed to minimize the number of disk accesses. See also tree structure.
•E-mail this definition to a colleague• Sponsored listings Looking for Trees In? - BizRate helps solve all your shopping needs! <b>b_tree</b> - Learn about <b>b_tree</b> About Trees - About Trees Directory. Find Info & Compare. For internet.com pages about B-tree . Also check out the following links! B-Trees: Balanced Tree Data Structures  An in-depth introduction to the structure, operations, and applications of B-tress. EarthWeb’s IT Management  Provides strategic information and analysis that lets CIOs, CTOs and Senior IT Managers be more effective in their jobs. Articles and columns cover a variety of topics important to IT Managers, including: security, network and systems management, application development, enterprise resource planning, intranets and IT services.	Data Structures binary tree branch directory file management system hierarchical leaf tree structure Give Us Your Feedback Shopping B tree Products Compare Products,Prices and Stores Shop by Category: Wireless Access Points 7 Model Matches Pets 3 Store Offers Sport and Outdoor 18 Store Offers Networking Hubs and Switches 54 Model Matches Auto Parts and Accessories 1943 Store Offers