VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning

• Lu, Kejing

• Wang, Hongya

• Wang, Wei

• Kudo, Mineichi

Bibliographic Information

Other Title

• VHP

Abstract

Locality sensitive hashing (LSH) is a widely practiced c-approximate nearest neighbor(c-ANN) search algorithm in high dimensional spaces. The state-of-the-art LSH based algorithm searches an unbounded and irregular space to identify candidates, which jeopardizes the efficiency. To address this issue, we introduce the concept of virtual hypersphere partitioning. The core idea is to impose a virtual hypersphere, centered at the query, in the original feature space and only examine points inside the hypersphere. The search space of a hypersphere is isotropic and bounded, and thus more efficient than the existing one. In practice, we use multiple physical hyperspheres with different radii in corresponding projection subspaces to emulate the single virtual hypersphere. We also developed a principled method to compute the hypersphere radii for given success probability. Based on virtual hypersphere partitioning, we propose a novel disk-based indexing and searching scheme VHP to answer c-ANN queries. In the indexing phase, VHP stores LSH projections with independent B+-trees. To process a query, VHP keeps increasing the radii of physical hyperspheres coordinately, which in effect amounts to enlarging the virtual hypersphere, to accommodate more candidates until the success probability is met. Rigorous theoretical analysis shows that the proposed algorithm supports c-ANN search for arbitrarily small c >= 1 with probability guarantee. Extensive experiments on a variety of datasets, including the billion-scale ones, demonstrate that VHP could achieve different tradeoffs between efficiency and accuracy, and achieves up to 2x speedup in running time over the state-of-the-art methods.

Journal

• Proceedings Of The Vldb Endowment

  Proceedings Of The Vldb Endowment 13 (9), 1443-1455, 2020-05

  Association for Computing Machinery (ACM)

Keywords

• General Engineering

Details

• CRID: 1050849378454815872
• NII Article ID: 120006896741
• DOI: 10.14778/3397230.3397240
• HANDLE: 2115/79717
• ISSN: 21508097
• Web Site: https://dl.acm.org/doi/pdf/10.14778/3397230.3397240
• Text Lang: en
• Article Type: journal article
• Data Source:
  • IRDB
  • Crossref
  • CiNii Articles
  • KAKEN