Information storage and search complexity theory

E. E. Gasanov

M. V. Lomonosov Moscow State University

Abstract: We propose a new information-graph model for information storage and search. This model generalizes a number of known data representation models. We study the main properties of the proposed model. We solve the problem of optimal informational graph synthesis for a wide class of search problems including the most acute database search problems.

UDC: 519.95

 English version: Journal of Mathematical Sciences (New York), 2010, 168:1, 32–48

Bibliographic databases:

• 
•