Article View: comp.lang.c.moderated
Article #2110Re: Tree Data Structure on Disk?
From: Warren Young
Date: Thu, 29 Feb 1996 14:36
Date: Thu, 29 Feb 1996 14:36
19 lines
1205 bytes
1205 bytes
Robert Krynicki <krynicki@cs.bris.ac.uk> wrote: >Does any one know of a fast tree data structure for disk storage? A lot of the >structures in 'c' books are for memory storage. Any sources code would be >appreciated. That's a B-tree, of course. B-trees were designed for that sort of thing, and many database systems use them. (That's probably where the name Btrieve came from, for what it's worth.) I would think that any decent book on data structures would have info on them. As I recall, Bryan Flamig's _Practical Data Structures in C++_ covers them (the book's at work, sorry), and if it does, it comes with the code to implement one. Publisher is John Wiley, and that's about all I know about it. Good luck, = Warren --
Technical Details
Message-ID:
<4h4dlr$8k6@solutions.solon.com>Path:
arc1-ca.pugleaf.net!solon.com!not-for-mailReferences:
<4gnb51$bdv@solutions.solon.com>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!solon.com!not-for-mail From: tangent@cyberport.com (Warren Young) Newsgroups: comp.lang.c.moderated Subject: Re: Tree Data Structure on Disk? Date: 29 Feb 1996 08:36:43 -0600 Organization: none Sender: clc@solutions.solon.com Approved: clc@solutions.solon.com Message-ID: <4h4dlr$8k6@solutions.solon.com> References: <4gnb51$bdv@solutions.solon.com> NNTP-Posting-Host: solutions.solon.com X-Newsreader: Forte Agent .99d/32.182