Store ATD in files

Question

I study algorithms and ATD (abstract data types). And suddenly it dawned on me: what about ADT stored on the HDD? For example, a linked list:

struct Node { Item item; Node *next; }

After all, it is only a pointer in the memory pointer. Honestly, I could not correctly formulate the question and, accordingly, find the literature on this issue. Tell me. According to the databases in the literature, this issue, it seems, is not covered. As trees, lists and TP structures are displayed in files. Where, in what book is this question covered in detail?

You need technical documentation for each individual database.
In Oracle, for example, records are addressed to rowid, which includes the number of the data file, the block normal in the file, and the record number in the block.
With indices, roughly the same pointer to the block and the address / offset inside the block.
I somehow did the data storage with reflection on the mmap memory at fixed addresses, it was convenient, the usual pointers continued to work after the application was restarted
different is different, but there is a certain set of techniques.
Common algorithms - for example, MSD, LSD or QSort are common ... yes, someone else has InsertSort for QSort and so on.
start by searching for the topic of ISAM (which was already on the EU computer already in the 60s and is still used today) en.wikipedia.org/wiki/ISAM Although this is not specifically about your ADT.
But the approach can be only one address in the RAM during operation when writing to a disk should be converted to a certain address on the disk.
when they were addresses of the type cylinder-head-sector, then they replaced the files.
And in the file there is also an offset from the beginning or a number (with a fixed record size) and a pointer to the file itself, if necessary, even with an abstract number, even though (although it’s expensive to store).

Store ATD in files

0

More articles: