microsoft / DiskANN

Graph-structured Indices for Scalable, Fast, Fresh and Filtered Approximate Nearest Neighbor Search
Other
1.11k stars 218 forks source link

[Question] About test_concurr_merge_insert in the diskv2 branch #481

Closed Wisgy closed 12 months ago

Wisgy commented 1 year ago

I have been delving into the FreshDiskANN paper and come across some points where I ask for further clarifications:

  1. Could you confirm if the results in Figure 2 are derived from the test_concurr_merge_insert function in the diskv2 branch? Figure2

  2. Additionally, I am interested in understanding how to use the test_concurr_merge_insert function, particularly with the SIFT1M dataset. Could you provide a brief explanation or an example for this? I am also curious about the role of the parameters in this context such as range, search_L1, search_L2.