BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

B-Trees for BASIC

B-Trees for BASIC

B-Trees for BASIC
Stock photo: cover may vary

B-Trees for BASIC Paperback - 1992

by Ray Robertson

Add to wish list
  • New
  • Paperback
New

Description

Ross Books, 1992. Paperback. New. 260 pages. 8.00x7.25x0.75 inches.
Ask the seller a question Add to wish list
A$44.04
A$47.74 Delivery to USA
Standard delivery: 7 to 14 days
More delivery options
Ships from Revaluation Books (Devon, United Kingdom)

Details

  • Title B-Trees for BASIC
  • Author Ray Robertson
  • Binding Paperback
  • Condition New
  • Pages 260
  • Volumes 1
  • Language ENG
  • Publisher Ross Books
  • Publication date 1992
  • Illustrated Yes
  • Features Illustrated
  • Bookseller's Inventory # x-0894960083
  • ISBN 9780894960086 / 0894960083
  • Weight 1 lbs (0.45 kg)
  • Dimensions 9.25 x 7.5 x 0.55 in (23.50 x 19.05 x 1.40 cm)
  • Category Computer - Apple/Macintosh
  • Library of Congress subjects BASIC (Computer program language)
  • Library of Congress Catalogue Number 92008469
  • Dewey Decimal Code 005.74
  • Quantity available 2

About Revaluation Books Devon, United Kingdom

Biblio member since 2020

General bookseller of both fiction and non-fiction.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Revaluation Books

Reader reviews for B-Trees for BASIC

From the publisher

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.
tracking-