Search Results for author:
Found 1 papers, 0 papers with code
HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints
The in-memory approximate nearest neighbor search (ANNS) algorithms have achieved great success for fast high-recall query processing, but are extremely inefficient when handling hybrid queries with unstructured (i. e., feature vectors) and structured (i. e., related attributes) constraints.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
