|
|
|
|
|||||||
| Forums | Portal | Register | Forum Rules | FAQ | Contribute | Members List | Arcade | Search | Today's Posts | Mark Forums Read |
| High Level Programming Post questions about C, C++, Java, SQL, and other programming languages here. |
More UNIX and Linux Forum Topics You Might Find Helpful
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Search attributes in one structure using the values from another structure | dhanamurthy | High Level Programming | 3 | 03-27-2008 12:37 AM |
| tree structure of the data | ThobiasVakayil | Shell Programming and Scripting | 2 | 03-26-2008 10:15 PM |
| inode data structure | anwerreyaz | Filesystems, Disks and Memory | 4 | 11-19-2006 11:34 PM |
| disk space used for files with in a directory structure. | kasala | Shell Programming and Scripting | 8 | 01-14-2005 01:26 PM |
| what data structure for polinomial | xli3 | High Level Programming | 0 | 10-07-2002 12:27 PM |
 |
|
|
Submit Tools | LinkBack | Thread Tools | Search this Thread | Display Modes |
|
#1
08-09-2007
|
|||
|
|||
|
How to implement an on-disk data structure
I have heard about on-disk data structures, but I am trying to understand how to implement it.
I want to write a program which is going to make use of a B-Tree which is so huge that whole of it cannot sit in memory. Lets take a simple case of a linked list. Suppose I want to have a linked list which is going to be very big ! How do I implement that. In normal cases, to insert a new node to the list I will use malloc() to dynamically allocate memory for the node. Now how do I write this node to the disk ? Does this mean I create a file and write the node to it or something ? hmm I dont think so... My program is in C. btw, Is there an on-disk implementation of b-tree available ? (on unix in C) Thanks !! 
|
| Forum Sponsor | ||
|
|
Linear Mode
