https://github.com/cmuparlay/ParlayANN

A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such algorithms.
https://github.com/cmuparlay/ParlayANN

Last synced: about 1 year ago
JSON representation

A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such algorithms.

• Host: GitHub
• URL: https://github.com/cmuparlay/ParlayANN
• Owner: cmuparlay
• License: mit
• Created: 2023-04-12T15:42:55.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2024-06-02T19:16:39.000Z (about 2 years ago)
• Last Synced: 2024-06-04T21:10:11.052Z (about 2 years ago)
• Language: C++
• Size: 3.85 MB
• Stars: 78
• Watchers: 5
• Forks: 19
• Open Issues: 3
• Metadata Files:
  • License: LICENSE

Awesome Lists containing this project

• awesome-vector-databases - ParlayANN - ParlayANN is a scalable and deterministic parallel graph-based approximate nearest neighbor (ANN) search library. It provides parallel algorithms and implementations for high-dimensional vector similarity search, suitable as a core search component in large-scale vector database and retrieval systems. ([Read more](/details/parlayann.md)) `ANN` `parallel` `scalable` (Sdks & Libraries)