|
B-Trees for BASIC | 
| Author: Ray Robertson
Publisher: Ross Books
Category: Book
Buy New: $14.95
Rating:  1 reviews
Sales Rank: 2760516
Media: Paperback
Pages: 260
Number Of Items: 1
Shipping Weight (lbs): 1
Dimensions (in): 9.1 x 7.2 x 0.7
ISBN: 0894960083
Dewey Decimal Number: 005.74
EAN: 9780894960086
ASIN: 0894960083
Shipping: Eligible for Super Saver Shipping
Availability: Usually ships in 24 hours
| |
| Editorial Reviews:
Product Description
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.
|
| Customer Reviews:
Review in progress January 31, 2000
Alonzo Hosford (Clinton, New Jersey United States)
5 out of 5 found this review helpful
I bought this book to learn B-Trees on my own and to apply the data examples (not program examples) and flow charts using Perl. The author has simplified the concept of B-trees very well. The material however is burdened by data examples filled with too many numbers that the author too has had a problem keeping track of. Page 38 figure 5.7 Step 7 and page 39 Figure 5.9 Step 8(b) both have errors in the data. Respectively key value 20 appears from nowhere and the key value 48 is duplicated losing value 47. The important definition of leaf page is not in index. I succeeded to create a Perl search tree equivalent to chapter 3 and am thankful. I am struggling to complete the add program. But I can tell you that the author and publisher have committed the error of arrogance of documenting programs without verifying by running the code.
|
|
|
| | iPod Batteries |  |
|
|
| MacMall |
 |
|
|
| Partners |
 |
|
|
|
|
