B-Trees for Basics: Create Your Own Lightning-Fast Database

Be the first to write a review

Overview

The "heart and soul" of almost all relational database programs is the B-Tree algorithm. In fact may programmers describe a relational database as a B-Tree program with supporting code that simply delivers the query to the B-Tree or displays the results from the B-Tree.

The beauty of this book is that it describes in great detail with lots of diagrams and charts exactly how a B-Tree works. It is one of the clearest explanations on the subject ...

See more details below
Paperback
$14.95
BN.com price
Other sellers (Paperback)
  • All (5) from $9.38   
  • New (3) from $15.56   
  • Used (2) from $9.38   
Sending request ...

More About This Book

Overview

The "heart and soul" of almost all relational database programs is the B-Tree algorithm. In fact may programmers describe a relational database as a B-Tree program with supporting code that simply delivers the query to the B-Tree or displays the results from the B-Tree.

The beauty of this book is that it describes in great detail with lots of diagrams and charts exactly how a B-Tree works. It is one of the clearest explanations on the subject existing and is extremely useful for any person or classroom that is investigating databases.

The number of illustrations in this book are too numerous to list. Diagrams are given showing every major step taken in writing a B-Tree. The diagrams also show exactly how searches are done.

Flow charts are also presented showing how the B-Tree algorithm works.

Tables are presented showing the performance of the B-Tree.

Code is listed for an entire B-Tree program written in simple DOS based BASIC and it is inspected and laboriously explained line-by-line.

Read More Show Less

Product Details

  • ISBN-13: 9780894960086
  • Publisher: Ross Books
  • Publication date: 4/28/1992
  • Pages: 260
  • Product dimensions: 7.50 (w) x 9.25 (h) x 0.55 (d)

Table of Contents


Section I
Introduction
Chapter 1 - Introduction
Overview
Vocabulary
Organization of Book
About Appendix A
The Big Picture
Keywords & Outside Files
Other B-trees
Other Methods
Section II
Defining & constructing A B-tree

Chapter 2 - Defining & Constructing A B-Tree
B-tree Vocabulary
Simplest B-tree
Short Review of Terms
Using the B-tree

Chapter 3 - Searching A B-Tree
Searching a B-tree
Inspecting a B-tree after Entries are made
Short Summary
Search Example

Chapter 4 - Listing Elements On A B-Tree

Chapter 5 - Adding Elements To A B-Tree
Adding Elements to a B-tree
Generating a B-tree of Order 2

Chapter 6 - Deleting Elements From A B-Tree

Section III
Using The TeachBase B-tree System

Chapter 7 - The TeachBase B-Tree System
The Storage File

Chapter 8 - The Teachbase B-Tree System Line-By-Line
Overview
Listing the B-tree in Ascending Order
Listing the B-tree in Descending Order
Searching the B-tree
B-tree Examination Utility
Adding to the B-tree
Deleting from the B-tree

Section IV
Changing the B-tree System

Chapter 9 - Optimizing The B-Tree Performance
Chapter Summary


Chapter 10 - Changing The TeachBase B-Tree System
Change Storage File Use

Section V
Appendices
Review Of Standard File Procedures

Methods That Compete With A B-Tree
The Mailing List Problem
The Performance of B-trees vs. Hashing
Glossary
index
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)
    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)