Modern B-Tree Techniques Goetz GraefePaperback softback
Modern B-Tree Techniques Goetz GraefePaperback softback 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…
Specifikacia Modern B-Tree Techniques Goetz GraefePaperback softback
Modern B-Tree Techniques Goetz GraefePaperback softback
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. 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. Over the years, many techniques have been added to the basic design in order to improve efficiency or to add functionality.
It is intended both as a tutorial and as a reference, enabling researchers to compare 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.