Abstract
In a multimedia database, similarity searching is the only significant way to retrieve the most similar objects to a given query. The usual approach to efficiently solve this kind of search is building an index, which allows reducing the response time of online queries. Recently, the permutation-based algorithms (PBA) were presented, and from then on, this technique has been very successful. A PBA index consists of storing the permutation of any database element with respect to a set of permutants. If the cardinality of the set of permutants is \(\beta \), any permutation needs storing a sequence of \(\beta \) small integers, whose values are between 1 to \(\beta \). However, if we have space restrictions over the index, the only way of reducing its size is by considering fewer permutants. Hence, the index performance could be severely affected.
We present in this paper a novel way to reduce the index size of PBA, without removing any permutant, by storing instead of the permutation of each element its signature regarding pairs of permutants from the set. Furthermore, our proposal achieves a good search performance, regarding both time and quality of solving a query. We can reduce almost 50% of the space needed for the index. Moreover, according to our experimental evaluation, we can reduce the original technique costs while preserving its exceptional answer quality.
Universidad Michoacana de San Nicolás de Hidalgo.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Amato, G., Savino, P.: Approximate similarity search in metric spaces using inverted files. In: 3rd International ICST Conference on Scalable Information Systems, INFOSCALE 2008, Vico Equense, Italy, 4–6 June 2008, p. 28 (2008)
Brisaboa, N.R., Fariña, A., Pedreira, O., Reyes, N.: Similarity search using sparse pivots for efficient multimedia information retrieval. In: Proceedings of the 8th IEEE International Symposium on Multimedia (ISM 2006), San Diego, USA, pp. 881–888 (2006)
Chávez, E., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 30(9), 1647–1658 (2009)
Chávez, E., Navarro, G.: A probabilistic spell for the curse of dimensionality. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 147–160. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44808-X_12
Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.: Proximity searching in metric spaces. ACM Comput. Surv. 33(3), 273–321 (2001)
Diaconis, P., Graham, R.L.: Spearman’s footrule as a measure of disarray. J. Roy. Stat. Soc.: Ser. B (Methodol.) 39(2), 262–268 (1977)
Esuli, A.: Use of permutation prefixes for efficient and scalable approximate similarity search. Inf. Process. Manag. 48(5), 889–902 (2012)
Naidan, B., Boytsov, L., Nyberg, E.: Permutation search methods are efficient, yet faster search is possible. VLDB 8(12), 1618–1629 (2015)
Téllez, E.S., Chávez, E., Camarena-Ibarrola, A.: A brief index for proximity searching. In: Bayro-Corrochano, E., Eklundh, J.-O. (eds.) CIARP 2009. LNCS, vol. 5856, pp. 529–536. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10268-4_62
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Figueroa, K., Reyes, N. (2019). Permutation’s Signatures for Proximity Searching in Metric Spaces. In: Amato, G., Gennaro, C., Oria, V., Radovanović , M. (eds) Similarity Search and Applications. SISAP 2019. Lecture Notes in Computer Science(), vol 11807. Springer, Cham. https://doi.org/10.1007/978-3-030-32047-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-32047-8_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32046-1
Online ISBN: 978-3-030-32047-8
eBook Packages: Computer ScienceComputer Science (R0)