Near neighbor searching with K nearest references. (July 2015)

• Record Type: Journal Article
• Authors: Chávez, E.; Graff, M.; Navarro, G.; Téllez, E.S.
• Is Part Of: Information systems. Volume 51(2015)
• Page Start: 43
• Page End: 61
• Publication Date: 2015-07
• Subjects: Proximity search -- Searching by content in multimedia databases -- k nearest neighbors -- Indexing metric spaces; Database management -- Periodicals; Electronic data processing -- Periodicals; Bases de données -- Gestion -- Périodiques; Informatique -- Périodiques; Database management; Electronic data processing; Periodicals; 005.7
• DOI: 10.1016/j.is.2015.02.001
• Languages: English
• ISSNs: 0306-4379

Abstract

Abstract: Proximity searching is the problem of retrieving, from a given database, those objects closest to a query. To avoid exhaustive searching, data structures called indexes are built on the database prior to serving queries. The curse of dimensionality is a well-known problem for indexes: in spaces with sufficiently concentrated distance histograms, no index outperforms an exhaustive scan of the database. In recent years, a number of indexes for approximate proximity searching have been proposed. These are able to cope with the curse of dimensionality in exchange for returning an answer that might be slightly different from the correct one. In this paper we show that many of those recent indexes can be understood as variants of a simple general model based on K-nearest reference signatures. A set of references is chosen from the database, and the signature of each object consists of the K references nearest to the object. At query time, the signature of the query is computed and the search examines only the objects whose signature is close enough to that of the query. Many known and novel indexes are obtained by considering different ways to determine how much detail the signature records (e.g., just the set of nearest references, or also their proximity order to the object, or also their distances to the object, and so on), how the similarity between signatures is defined, and how the parameters are tuned. In addition, we introduce a space-efficient representation for those families of indexes, making it possible to search very large databases in main memory. Small indexes are cache friendly, inducing faster queries. We perform exhaustive experiments comparing several known and new indexes that derive from our framework, evaluating their time performance, memory usage, and quality of approximation. The best indexes outperform the state of the art, offering an attractive balance between all these aspects, and turn out to be excellent choices in many scenarios. Our framework gives high flexibility to design new indexes. Abstract : Highlights: A general framework to understand and analyze many recent indexes. A space efficient representation based on succinct data structures. An exhaustive experimentation comparing several known and new indexes derived from the framework. The possibility to design new indexes, which can be implemented in a similar way using our framework.