I’m a student planning a semester project around building a vector search engine from scratch. The core scope is exact search, HNSW, IVF, product quantization, save/load support, and reproducible comparisons against FAISS. I’d then use the engine for a small lecture video search demo. I’m trying to keep the scope manageable: pretrained embeddings, local execution, a minimal UI, and no distributed indexing. A Rust rewrite is a stretch goal. If time gets tight, I’ll reduce the video demo’s scope and keep the index benchmarks. Does this seem realistic for a semester? If you’ve implemented these algorithms, which one took substantially longer than you expected, and why?   submitted by   /u/Reasonable_Action608 [link]   [comments]

  • 情报分类：技术学习与提效
  • 分类依据：向量检索算法做学期项目的可行性讨论
  • 信息来源：Reddit · SideProject
  • 发布时间：2026/10/7 03:09:57