Similarity search over high-dimensional sparse feature vectors is a fundamental problem in applications such as information retrieval, data mining, and machine learning. In this paper, we present PreFast, a scalable parallel prefix-filtering framework for top-k similarity search over non-negative weighted feature vecto...
S. Pokharel, A. Subedi, Elizabeth Oluwadamilola Durowoju et al.· Proceedings of the Internati...· 0 citations
Similarity search over high-dimensional sparse feature vectors is a fundamental problem in applications such as information retrieval, data mining, and machine learning. In this paper, we present PreFast, a scalable parallel prefix-filtering framework for top-k similarity search over non-negative weighted feature vecto...
S. Pokharel, A. Subedi, Elizabeth Oluwadamilola Durowoju et al.· 0 citations
The challenges of scaling R-tree spatial search on a commercial Processing-in-Memory (PIM) system are studied, and parallel host-side aggregation, efficient result handling, and query-aware DPU assignment for scalable PIM-based spatial search are motivated.
Tasmia Jannat, Michael Gowanlock, S. Puri· IEEE International Symposium...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
