Home
1 items | 8 visits
-
B-tree - Wikipedia, the free encyclopedia
-
In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. Unlike self-balancing binary search trees, it is optimized for systems that read and write large blocks of data. It is most commonly used in databases and filesystems.
-
1 - 1 of 1
Showing 20▼ items per page
List Comments
(0)
List Info
Maggie Tsai's Public Lists (16)
- Digiteen ~ Digital Security
- Diigo in Education
- Diigo NECC Workshop
- Diigo Reviews
- Diigo Tutorials
- Diigo V3 Reviews
- Elearning
- General
- Hawaii vacation planning
- iPhone & iTouch
- MashableOWA
- My favorite youtube video
- Reno Class Sharing
- TechCrunch40 Alexa Tracking
- web2.0
- WRITER’S TOOLBOX: 35+ Best Tools for Writing Online