Instruments and Systems: Monitoring, Control, and Diagnostics Annotation << Back An optimization problem of constructing a function from the stored data on the address space with constant-time search for model of data storage YAKOVLEV A.V. POLYAKOV D.V. MOSKVICHEVA T.I. DIDRIKH V.E. One of the most effective, in terms of access to the data, model is the address’s array. In such arrays, searching for the element is at constant time by computing the address of an stored object based on its value. However, at the real world, characterized by large volumes of data in information files, such model is practically unapplicable, which limits its use. In practice, wide used models with high (logarithmic) access time to the stored elements, but do not require allocation of large amounts of extra memory. In the paper suggested an optimization problem creating of functions which turn a plurality of objects into the address space and adapts to the uneven distribution of the stored data. Presented in the work of the algorithms allow to realize the proposed model, in the form of software for different subject areas, for example, in geographic information systems, critical to computing resources. Keywords: data search, data storage, bijective function, uneven distribution of the stored data, set of stored elements, address’s array, asymptotically complexity. Contacts: E-mail: itizi@bk.ru Pp. 36-41.