{"id":34208865,"url":"https://github.com/kpetridis24/k-nearest-vectors","last_synced_at":"2026-05-29T22:31:10.545Z","repository":{"id":173189489,"uuid":"650368152","full_name":"kpetridis24/k-nearest-vectors","owner":"kpetridis24","description":"Parallel-Indexed multi-dimensional query engine for efficient vector search","archived":false,"fork":false,"pushed_at":"2023-09-05T14:33:01.000Z","size":118,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-19T00:41:41.328Z","etag":null,"topics":["euclidean-distances","golang","goroutines","high-performance-computing","index","k-nearest-neighbours","parallel-programming","vectors","vptree"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kpetridis24.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-06-06T23:34:13.000Z","updated_at":"2023-09-05T14:33:27.000Z","dependencies_parsed_at":"2023-10-19T10:15:10.511Z","dependency_job_id":null,"html_url":"https://github.com/kpetridis24/k-nearest-vectors","commit_stats":{"total_commits":21,"total_committers":1,"mean_commits":21.0,"dds":0.0,"last_synced_commit":"ce0c9910efdd7f6be08ce6e738c5536f0dc5d680"},"previous_names":["kpetridis24/k-nearest-vectors"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/kpetridis24/k-nearest-vectors","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kpetridis24%2Fk-nearest-vectors","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kpetridis24%2Fk-nearest-vectors/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kpetridis24%2Fk-nearest-vectors/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kpetridis24%2Fk-nearest-vectors/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kpetridis24","download_url":"https://codeload.github.com/kpetridis24/k-nearest-vectors/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kpetridis24%2Fk-nearest-vectors/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33673627,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-05-29T02:00:06.066Z","response_time":107,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["euclidean-distances","golang","goroutines","high-performance-computing","index","k-nearest-neighbours","parallel-programming","vectors","vptree"],"created_at":"2025-12-15T20:27:28.726Z","updated_at":"2026-05-29T22:31:10.540Z","avatar_url":"https://github.com/kpetridis24.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# k-nearest-vectors\n\nParallel-Indexed multi-dimensional query engine for efficient vector search \n\n## Motivation\n\nComputing the **distance between high dimensional vectors** is widely applicable in modern technologies. It is used extensively in\nvector embeddings databases, like **Weaviate**, when performing queries. Although approximate methods, like **Locality Sensitive Hashing\n(LSM)** are useful and make the applications scalable when increase in data occurs, deterministic/brute force implementations are also handy\nin smaller datasets.\n\n## Content\n\nI have 3 major implementations in this codebase:\n\n- **Naive approach** to compute the k nearest vectors to a given query\n- **Parallel approach** using **Go routines**, parallelizing the naive approach\n- **Hybrid Indexed-Parallel approach** using **Vantage Point Tree** structure, optimised for space efficiency and branch pruning with parallelized search across branches\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkpetridis24%2Fk-nearest-vectors","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkpetridis24%2Fk-nearest-vectors","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkpetridis24%2Fk-nearest-vectors/lists"}