{"data":{"slug":"hora-search-hora","name":"hora","tagline":"efficient approximate nearest neighbor search algorithm collections library written in Rust","github_url":"https://github.com/hora-search/hora","owner":"hora-search","repo":"hora","owner_avatar_url":"https://avatars.githubusercontent.com/u/84223129?v=4","primary_language":"Rust","stars":2659,"forks":77,"topics":["algorithm","approximate-nearest-neighbor-search","artificial-intelligence","data-structures","high-performance","hnsw","image-search","k-nearest-neighbors","machine-learning","neural-network","numeric","recommender-system","rust","rust-sci","search-engine","simd","similarity-search","vector-search"],"archived":false,"github_pushed_at":"2026-02-17T13:34:53+00:00","maintenance_label":"Slowing","stars_delta_30d":-4,"url":"https://www.graphcanon.com/tools/hora-search-hora","markdown_url":"https://www.graphcanon.com/tools/hora-search-hora.md","api_url":"https://www.graphcanon.com/api/graphcanon/tools/hora-search-hora","graph_url":"https://www.graphcanon.com/api/graphcanon/graph?tool=hora-search-hora","description":"🚀  efficient approximate nearest neighbor search algorithm collections library written in Rust 🦀 . ","homepage_url":"http://horasearch.com/","license":"Apache-2.0","open_issues":26,"watchers":47,"ai_summary":"A high-performance Rust library for efficient approximate nearest neighbor search algorithms useful for similarity-search across various machine-learning applications.","readme_excerpt":"# Installation\n\n**`Rust`**\n\nin `Cargo.toml`\n\n```toml\n[dependencies]\nhora = \"0.1.1\"\n```\n\n**`Python`**\n\n```Bash\n$ pip install horapy\n```\n\n**`Javascript (WebAssembly)`**\n\n```Bash\n$ npm i horajs\n```\n\n**`Building from source`**\n\n```bash\n$ git clone https://github.com/hora-search/hora\n$ cargo build\n```\n\n---\n\n# License\n\nThe entire repository is licensed under the [Apache License](https://github.com/hora-search/hora/blob/main/LICENSE).","github_created_at":"2021-05-15T07:46:32+00:00","created_at":"2026-07-11T11:33:32.529377+00:00","updated_at":"2026-08-23T00:01:28.049287+00:00","categories":[{"slug":"data-retrieval","name":"Data & Retrieval","url":"https://www.graphcanon.com/categories/data-retrieval","markdown_url":"https://www.graphcanon.com/categories/data-retrieval.md","api_url":"https://www.graphcanon.com/api/graphcanon/categories/data-retrieval"},{"slug":"vector-databases","name":"Vector Databases","url":"https://www.graphcanon.com/categories/vector-databases","markdown_url":"https://www.graphcanon.com/categories/vector-databases.md","api_url":"https://www.graphcanon.com/api/graphcanon/categories/vector-databases"}],"tags":[{"slug":"algorithm","name":"algorithm"},{"slug":"approximate-nearest-neighbor-search","name":"approximate-nearest-neighbor-search"},{"slug":"artificial-intelligence","name":"artificial-intelligence"},{"slug":"data-structures","name":"data-structures"},{"slug":"high-performance","name":"high-performance"},{"slug":"hnsw","name":"hnsw"},{"slug":"image-search","name":"image-search"},{"slug":"k-nearest-neighbors","name":"k-nearest-neighbors"}],"trust":{"provenance":{"is_fork":false,"github_id":367571115,"owner_type":"Organization","methodology":"github_public_v1","parent_repo":null,"near_duplicate_slugs":[]},"computed_at":"2026-08-23T00:01:27.300Z","maintenance":{"label":"Slowing","score":36,"methodology":"github_public_v1","releases_90d":0,"days_since_push":186,"last_release_at":null,"stars_delta_30d":-4,"open_issues_delta_30d":0},"security_summary":{"status":"no_lockfile","scanner":null,"low_count":0,"high_count":0,"last_scan_at":"2026-07-11T11:33:33.641Z","medium_count":0,"scan_profile":"none","critical_count":0}},"capability_facts":{"scan":{"source":"repo_scan","observed_at":"2026-08-23T00:01:27.750Z"},"languages":{"value":["rust"],"source":"github.language","observed_at":"2026-08-23T00:01:27.750Z"},"license_spdx":{"value":"Apache-2.0","source":"github.license","observed_at":"2026-08-23T00:01:27.750Z"}},"decision_facts":{"hosting":null,"pricing":null,"requirements":null,"constraints":null,"when_to_use":["When you require a high-speed library written in Rust to implement an efficient similarity-search solution","For developing machine-learning projects that specifically need fast approximate nearest neighbor searches, leveraging the SIMD capabilities of modern hardware"],"when_not_to_use":["If your project is restricted to languages other than Rust and you cannot work with Rust bindings or require a more general-purpose vector database library","When exact nearest neighbor search accuracy is preferred over the speed provided by approximate algorithms, as Hora specializes in sacrificing minimal precision for significant performance gains"],"source":"enrich:decision_facts","observed_at":"2026-07-15T09:19:27.865Z"},"constraint_facets":null,"decision_summary":[{"label":"Adopt for","value":"Hora is a Rust-based library for high-performance approximate nearest neighbor search algorithms critical in applications such as image and recommender systems where speed and efficiency are paramount."}]}}