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 Paperback / softback - 1992

by Ray Robertson

Add to wish list
  • New
  • Paperback
New

Description

Paperback / softback. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; 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 dis
Ask the seller a question Add to wish list
A$32.87
A$15.26 Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Ships from Ria Christie Collections (Greater London, United Kingdom)
The BIBLIO Guarantee

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-04-02
  • Illustrated Yes
  • Features Illustrated
  • Bookseller's Inventory # ria9780894960086_inp
  • 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 136

About Ria Christie Collections Greater London, United Kingdom

Specialising in: Books, Calendars, Fiction Books, Non- Fiction Books, Textbooks
Biblio member since 2014

Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections

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 Ria Christie Collections

Reader reviews for B-Trees for BASIC

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

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.

Please wait a moment while we load the requested page.

tracking-