초록 ▼

A database is stored in a mass memory. For this purpose, it is first divided into main cells and then into base cells according to a predetermined regular division pattern. Each base cell is then checked to see whether its data content is sufficient to occupy substantially completely a storage parce

A database is stored in a mass memory. For this purpose, it is first divided into main cells and then into base cells according to a predetermined regular division pattern. Each base cell is then checked to see whether its data content is sufficient to occupy substantially completely a storage parcel having a predetermined capacity. If this is the case, the base cell is thus accommodated in a storage parcel; if this is not the case, adjacent base cells are grouped until a storage parcel is occupied substantially completely. The operation of addressing a storage parcel is effected by the use of a main cell table in which address pointers are stored, each of which points to a base cell table. In the base cell table, an index is given for each base cell and this index indicates in which storage parcel the relevant base cell is accommodated. Each of these indices indicates a location in a data paracel list at which an address indicator is present, which indicates the location at which the relevant parcel is stored in the mass memory.

대표청구항 ▼

A method for storing a digital data base in a memory whose capacity is divided into a number of storage parcels each having a predetermined storage capacity, said method comprising the following steps: dividing the data base into a number of main cells according to a predetermined regular division p

A method for storing a digital data base in a memory whose capacity is divided into a number of storage parcels each having a predetermined storage capacity, said method comprising the following steps: dividing the data base into a number of main cells according to a predetermined regular division pattern; dividing each main cell into a further number of data parcels , so that each data parcel covers a respective part of the main cel, which part has a data content occupying substantially completely the storage capacity of a storage parcel; setting up an identifier table comprising: (a) a first identifier identifying said predetermined pattern; (b) a second identifier identifying said division into a data parcel; and (c) for each main cell a data parcel list which comprises for each data parcel of that main cell an address pointer indicating at which memory location the respective data parcel is stored; and loading into said memory the data content of each data parcel at the address indicated by its address pointer and loading said identifier table; wherein main cells which comprise more than one data parcel are divided according to a further predetermined regular division pattern into such a nuber of base cells that the data content of each base cell is storable in a storage parcel, said parcels being formed by combining each time one or more adjacent base cellls of a same main cell, so that each base cell only belongs to one and the same data parcel, the method further comprising the following steps for setting up said identifier table: (a) compiling a main cell table comprising said first identifier and further for each main cell divided into base cells a further address pointer indicating a memory location at which a base cell table for that main cell is stored; (b) forming each main cell divided into base cells said second identifier by forming a number of indices, each index indicating a respective data parcel of its appertaining main cell; (c) assigning to each base cell the index of the respective data parcel in which it is accommodated; and (d) compiling for each main cell divided into base cells a base cell table comprising a base cell identifier and a list of the base cells with their assigned index; each base cell table being loaded at its respective address indicated by its respective further address pointer.