home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.databases.theory
- Path: sparky!uunet!wupost!gumby!destroyer!ubc-cs!newsserver.sfu.ca!sfu.ca!naran
- From: naran@fraser.sfu.ca (Travers Naran)
- Subject: Any example of actual implementations of B-Tree's?
- Message-ID: <naran.712476183@sfu.ca>
- Keywords: b-tree indexes indexing
- Sender: news@sfu.ca
- Organization: Simon Fraser University, Burnaby, B.C., Canada
- Date: Thu, 30 Jul 1992 06:03:03 GMT
- Lines: 23
-
- I am writing a database program for myself and is going to be mostly
- disk-based. But now, I have the theory for B-Trees (Not binary trees, the B
- stands for something else) but no algorithms or any books that even talk about
- using it. All the books I have found so far are concerned about normalization
- and other stuff I already know about.
-
- How are B-Trees actually implemented? Data structures, algorithms, etc.
- Any examples by FTP or on the Net in general? Pieces of code, database sourcee
- codes, etc.
-
- Thanks in advance.
-
- Also, is there any books out there that talks to us people who actually write
- the down and dirty code for databases? :-)
-
- --
- --------------------------------------------------------------------------
- Travers Naran | "We don't like
- Mail address: naran@fraser.sfu.ca or naran@sfu.ca | change. WHACK!
- Simon Fraser University, British Columbia, Canada | WHACK! WHACK!"
- Cmpt. Science student wanna-be | -Garth
- Trekker, Leaper, Red Dwarf'er, Prober, etc. | "Wayne's World"
- --------------------------------------------------------------------------
-