Abstract
A new method of organizing an information storage and retrieval system is proposed and theoretically evaluated. The method uses a special normal form into which the queries entering the system are transformed. This normal form enables one to determine easily the decomposition of the set of records relevant to a query into the minimal number of segments of records stored in consecutive storage locations, and to compute the addresses of the beginning and end of each of these segments.

This publication has 0 references indexed in Scilit: