Method of querying a structure of compressed data
AssigneeQinetiq Limited
InventorThomas Benjamin Longshaw
Life of this patent
Estimating the term…
Abstract
A method of querying a structure of compressed data comprising records stored as a forest of binary includes the step of generating an instruction set allowing a specified data value with a binary tree to be retrieved, given input of an address in memory that identifies the binary tree. Further querying functions which utilise the instruction set allow selection of records on the basis of one or more specified data values, or ranges of data values, statistical analysis of records and grouping of records on the basis of common data values within fields of records.
Claims10
A method of querying a data structure which comprises a plurality of records;
- each record comprising a plurality of nodes structured as a binary tree, wherein the method comprises the operation of creating an instruction set for accessing a data value stored at a leaf node of the binary tree by the steps of:
- (a) determining the leaf node's position address within a binary tree to which the node belongs;
- (b) establishing the leaf node's lateral position index, and
- (c) entering an instruction in an instruction set, the instruction depending on the node's lateral position index.
A method according to claim 5 further comprising the steps of:
- (a) specifying an order for the data values in the list;
- and
- (b) arranging the tables in an order corresponding to the order of the data values.
A method according to any preceding claim wherein the steps of the method are implemented by arranging graphical elements in a graphical user interface.
Dependencies are inferred from the claim text.