from Wiktionary, Creative Commons Attribution/Share-Alike License.

  • noun computing An indexed data structure suitable for storage of a large number of items in a balanced fashion, with very few disk hits required for locating the correct record block.


Sorry, no etymologies found.


  • This study does highlight the fact that a chosen option does not necessarily dictate or limit the scale as long as the other attributes such as an effective parallelism algorithm, B-tree indices, main-memory computation, compression etc. can help achieve the desired scale.

    The Data Mining Renaissance

  • MapReduce in Practice • Abstract input and output interfaces - lots of MR operations don't just read/write simple files • B-tree files • memory-mapped key-value stores • complex inverted index file formats • BigTable tables • SQL databases, etc.

    Recently Uploaded Slideshows

  • I have tried running Disk Utility from the installation CD several times, and using fsck in single-user mode to try to rebuild the Catalog B-tree, all to no avail.

    Discussions: Message List - root

  • I'll explain how Fractal Trees work, and show why they can get one to two orders of magnitude speedup on insertions compared to B-tree indexes.

    Planet MySQL

  • Since the difference I've identified between B-tree indexes and Fractal tree indexes is the disk seeks on insertions, it may seem that there's little to look at in this case.

    Planet MySQL

  • It attempts to index according to the best use for a given database, instead of defaulting to B-tree sorting.

    MacNN | The Macintosh News Network

  • A nonclustered index is a smaller ancillary index (also a B-tree) that is used to store the clustered index key and any other columns that are needed to provide quick retrieval.

    Site Home

  • In SQL Server, a clustered index is a B-tree (a storage algorithm for optimal retrieval) of the keys that are used in the clustered index definition, with the data stored at the bottom or leaf level of the B-tree.

    Site Home

  • If you know the order of a B-tree, how do you figure out the maximum number of descendants from a page?

    Yahoo! Answers: Latest Questions

  • Unfortunately XtraDB is not yet so popular as InnoDB, and actually in this case I do not expect big difference, as B-tree on disk is B-tree on disk.

    Jeremy Zawodny's linkblog


Log in or sign up to get involved in the conversation. It's quick and easy.