Building multi-dimensional indexing structure for use with linear optimising requests involves forming two convex envelopes of input data sets, some representing envelope apex points

摘要

The method involves forming a first convex envelope of N input data sets, whereby M data sets represent apex points of the first convex envelope and are associated with a first plane of the indexing structure and forming a second convex envelope of the rest of the N -M data sets, whereby P data sets represent apex points of the second envelope and are associated with a second plane and at least part of one plane is located geometrically in another plane. An Independent claim is also included for an arrangement for building a multi-dimensional indexing structure for use with linear optimising requests and for a product for processing a request.