Ascent Similarity Caching with Approximate Indexes - Archive ouverte HAL
Article Dans Une Revue IEEE/ACM Transactions on Networking Année : 2022

Ascent Similarity Caching with Approximate Indexes

Résumé

Similarity search is a key operation in multimedia retrieval systems and recommender systems, and it will play an important role also for future machine learning and augmented reality applications. When these systems need to serve large objects with tight delay constraints, edge servers close to the enduser can operate as similarity caches to speed up the retrieval. In this paper we present AC ¸AI, a new similarity caching policy which improves on the state of the art by using (i) an (approximate) index for the whole catalog to decide which objects to serve locally and which to retrieve from the remote server, and (ii) a mirror ascent algorithm to update the set of local objects with strong guarantees even when the request process does not exhibit any statistical regularity.
Fichier principal
Vignette du fichier
Ascent_Similarity_Caching_with_Approximate_Indexes__ToN_-1.pdf (3.39 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03906085 , version 1 (19-12-2022)

Identifiants

Citer

Tareq Si Salem, Giovanni Neglia, Damiano Carra. Ascent Similarity Caching with Approximate Indexes. IEEE/ACM Transactions on Networking, 2022, pp.1. ⟨10.1109/TNET.2022.3217012⟩. ⟨hal-03906085⟩
34 Consultations
53 Téléchargements

Altmetric

Partager

More