Friday, July 09, 2004


A nice article on B-Trees (or Balanced Trees, for the pedantic), useful for those who've been out of school a little too long, and even for those who've never been to school at all. "Why are B-Trees important?" one may ask, and the answer's straightforward enough - they can drastically reduce the number of accesses to slow secondary storage required to get at any given record.

The importance of understanding fundamental data structures can't be emphasized enough, and not understanding B-trees and doubly-linked lists ought to be a crime for anyone working with databases; for instance, SQL Server 2000's indexes are implemented as B-trees.


Anonymous Anonymous said...

онлайн [url=http://улетно.рф]улетно[/url]
[url=]фильмы онлайн hd[/url]
Наш [url=]кинопоиск[/url] - поиск онлайн кино.
[url=]скачать бесплатно через торрент[/url]
[url=]сериалы тут[/url]
Наш [url=]новинки кино онлайн[/url].
[url=]zerx[/url] - фильмы онлайн.
[url=]кино новинки[/url] онлайн.

February 15, 2013 at 11:16 PM  

Post a Comment

<< Home