Hierarchical Navigable Small Worlds: Efficient Algorithm for Finding Approximate Nearest Neighbors in Graphs