Abstract
In this paper, we focus on the problem of content-oriented retrieval in an image database. This problem can be interpreted as the search and the selection of images containing whichever pattern introduced beforehand by the user. We propose a data structure valid for this kind of manipulation, the Full Inverted Quadtree (FI-Quadtree). The structure represents a set of images within a single quadtree. We analyze the distribution of the data in the base, the operations of insertion, selection and we report some experimental results.