Search Optimization With Query Likelihood Boosting And Two-level Approximate Search For Edge Devices
2023 · Jianwei Zhang, Helian Feng, Xin He, et al.
Abstract
We present a novel search optimization solution for approximate nearest neighbor (ANN) search on resource-constrained edge devices. Traditional ANN approaches fall short in meeting the specific demands of real-world scenarios, e.g., skewed query likelihood distribution and search on large-scale indices with a low latency and small footprint. To address these limitations, we introduce two key components: a Query Likelihood Boosted Tree (QLBT) to optimize average search latency for frequently used small datasets, and a two-level approximate search algorithm to enable efficient retrieval with large datasets on edge devices. We perform thorough evaluation on simulated and real data and demonstrate QLBT can significantly reduce latency by 15% on real data and our two-level search algorithm successfully achieve deployable accuracy and latency on a 10 million dataset for edge devices. In addition, we provide a comprehensive protocol for configuring and optimizing on-device search algorithm th
Authors
(none)
Tags
Stats
Related papers
- Experimental Comparison Of Graph-based Approximate Nearest Neighbor Search Algorithms On Edge Devices (2024)0.00
- Automating Nearest Neighbor Search Configuration With Constrained Optimization (2023)0.00
- DEG: Efficient Hybrid Vector Search Using The Dynamic Edge Navigation Graph (2025)6.34
- A Scalable Solution To The Nearest Neighbor Search Problem Through Local-search Methods On Neighbor Graphs (2017)3.58
- Aisaq: All-in-storage ANNS With Product Quantization For Dram-free Information Retrieval (2024)0.00
- Random Binary Trees For Approximate Nearest Neighbour Search In Binary Space (2017)2.26
- Frequency-aware Graph Construction And Search For Dynamic Vector Databases (2025)0.00
- Symphonyqg: Towards Symphonious Integration Of Quantization And Graph For Approximate Nearest Neighbor Search (2024)7.50