Invented about 40 years ago and called ubiquitous less than 10
years later, B-tree indexes have been used in a wide variety of
computing systems from handheld devices to mainframes and server
farms. Over the years, many techniques have been added to the basic
design in order to improve efficiency or to add functionality.
Examples include separation of updates to structure or contents,
utility operations such as non-logged yet transactional index
creation, and robust query processing such as graceful degradation
during index-to-index navigation. Modern B-Tree Techniques reviews
the basics of B-trees and of B-tree indexes in databases,
transactional techniques and query processing techniques related to
B-trees, B-tree utilities essential for database operations, and
many optimizations and improvements. It is intended both as a
tutorial and as a reference, enabling researchers to compare index
innovations with advanced B-tree techniques and enabling
professionals to select features, functions, and tradeoffs most
appropriate for their data management challenges.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
