Page Not Found

We could not find the page you have requested.
©2010 Insomniac Games, Inc. All Rights Reserved. Site by Drawbackwards.
Feedback  |  Terms of Service  |  Privacy Policy   Research & Developement
Insomniac Games :: R&D
Insomniac Games - Page Not Found
  • Games
  • Careers
  • Community
  • Blogcast
  • About
  • Join the Insomniac Community Now
    • Already a Member? Login

Page Not Found

We could not find the page you have requested.
©2010 Insomniac Games, Inc. All Rights Reserved. Site by Drawbackwards.
Feedback  |  Terms of Service  |  Privacy Policy   Research & Developement

Introduction to B-Trees

01/23/08 - 18:00 PST - Posted by Dave Schuyler, Multiplayer Principal Programmer

The b-tree data structure is container system somewhat like a binary tree (although the “b” stands for balanced and the tree is not binary). The API to a b-tree is usually similar to other key-to-data systems such as a hash table, dictionary, or associative array. B-trees are often used for file system indexing and database indexing. The performance gains for a b-tree rely on having a block based memory system (such as disk sectors or cache lines) wherein the cost to get another block far outweighs the cost of doing multiple tests on data in the currently accessible block.

B-Trees PDF