Random-Access Ranked Retrieval and Similarity Search

Read full text
Authors: Mohsen Dehghankar, Abolfazl Asudeh, Raghav Mittal, Suraj Shetiya, Gautam Das
Cited by: 0

Abstract

We extend Random Access, a fundamental operation that enables efficient search and exploration algorithms, to the modern interactive data systems based on Ranked Retrieval and Similarity Search, where orderings are dynamically defined over a high-dimensional feature space. This extension enables efficient solutions for a wide range of applications, from data analytics tools and database systems to recommendation systems and machine learning.

Fields of Study & Subjects

Data Management and Algorithms Advanced Image and Video Retrieval Techniques Information Retrieval and Search Behavior

Publication details

Pages
791–802
Publication date
6 August 2026
Language
EN