In this paper, we introduce a new generalized scheme to resolve the trade-off between the identification rate, search and memory complexities in large-scale identification systems. The main contribution of this paper consists in a special database organization based on assigning entries of a database to a set of predefined and possibly overlapping clusters, where the cluster representative points are generated based on statistics of both entries of the database and queries. The decoding procedure is accomplished in two stages: At the first stage, a list of clusters related to the query is estimated, then refinement checks are performed to all members of these clusters to produce a unique index at the second stage. The proposed scheme generalizes several practical searching in identification systems as well as makes it possible to approach a new achievable region of search- memory complexity trade-off.
Farhadzadeh, F., Willems, F. M. J., & Voloshynovskiy, S. (2013). Fundamental limits of identification : identification rate, search and memory complexity trade-off. In 2013 IEEE International Symposium on Information Theory (ISIT) (blz. 1252-1256). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT.2013.6620427