Organization of associative memory operations with lattice structures

Presents a simple and effective method of organization of a content-addressable access to dynamic sets using lattice structures. Various software components of this organization are described in the literature in a scattered form using the terminology of Young tableaux, sorted matrices, and biparental heaps. The practicality of the developed technique is novel. Although the presented organization has an overall O( square root N) performance, it works faster than the arrangements based on balancing binary search trees for sets of up to a thousand or so elements and remains competitive for sets of up to tens of thousands of elements where these arrangements may be expected to benefit from the asymptotic superiority of their O(log N) performance.< >