Limit the exploration of unordered and / or grouped relationships using near-ordered correspondences

摘要

A procedure implemented by computer to locate desired data in a database (300-1) using an almost ordered correspondence table (400), said procedure comprising sequentially: dividing data from the database (300-1) into a plurality of extensions (300-2); generate statistics of almost ordered correspondences of data included in each extension (300-2), where statistics of almost ordered correspondences comprise one or more intervals of data included in the respective extension, where each of the intervals consists of a minimum value and a maximum value of an attribute of the data of the respective extension, compiling, for all extensions, the minimum value and the maximum value of the attribute of the data of the respective extension, record each extension (300-2) with the statistics of almost ordered correspondences of the data included in the respective extension, where the data ranges associated with the extensions (300-2) are stored in the almost ordered correspondence table; select one or more extensions (300-2) for which the associated data ranges overlap at least partially with a data range of the desired data, depending on the minimum and maximum values of the data ranges stored in the table of almost ordered correspondence, consulting the almost ordered correspondence table to determine a subset of extensions that can hold the desired data; and search the one or more selected extensions to locate the desired data.