A method of organising a database, wherein the key used to navigate an index (2) is a composite key, and one or more of the keys therein are represented in a compressed form.

A method of organising a database comprising navigating the database with a range of keys between a first key and a second key representing limits of the range, and wherein the keys mapped to a reduced range, and if the order of the keys is not preserved during the mapping a search is made of the mapped space gr...

A method of organising a database comprising querying the database having an index (2) and data (16), and wherein the index is queried using a search key in order to locate data matching the search criteria, characterized in that the index is a hierarchical structure of decision nodes (100,104, 108), the structur...

A method of organising a database comprising managing keys within a database, characterised in that the keys include a data field indicating the duration for which the keys and its associated data should be maintained within the database.

TITLE: A METHOD OF QUERYING DATABASE. A method of querying a database with a processor, wherein the database comprises an index, associated with one or more physical storage devices and data associated with one or more physical storage devices,wherein the index is queried by the processor using a search key comp...

The invention relates to a method of organizing storage of data in a dababase (2), the database (2) having conclusion sets (20, 24, 26, 28, 30; 40, 50, 60) arranged in a hierachical structure, the conclusion sets being arranged such that items are inserted into a selected conclusion set at a first level of s...