FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2009, VOLUME 15, NUMBER 3, PAGES 49-73

Information storage and search complexity theory

E. E. Gasanov

Abstract

View as HTML     View as gif image

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.

Main page Contents of the journal News Search

Location: http://mech.math.msu.su/~fpm/eng/k09/k093/k09306h.htm
Last modified: January 13, 2010