nowfound

Alternatives

Products that do what OctaneDB – Fast, Open-Source Vector Database for Python does

OctaneDB is an open-source vector database for Python that focuses on ultra-fast similarity search for high-dimensional data—perfect for AI/ML, semantic search, and large-scale document or embedding retrieval. What does it do? Store, index, and search millions of embeddings (text, images, etc.) with sub-millisecond query time. Supports in-memory and efficient HDF5 persistent storage. Integrates seamlessly with sentence-transformers for automatic text embedding. Key Features: 10x faster than Pinecone or ChromaDB for vector search and batch insertions. Advanced indexing: HNSW (approximate…

  1. 1PA
  2. 2

    An open-source database for machine learning

    2021

  3. 3HA

    Hey HN, it’s been just over a year since we launched HelixDB (https://news.ycombinator.com/item?id=43975423), a project a friend and I started in college. It’s an OLTP graph database built on object-storage, with native vector search and full-text search (FTS). Why graph, vector and FTS? Graph databases provide a natural cognitive model for data, vectors allow for a semantic understanding of the entities and relationships in the graph, and FTS provides more specific filtering. Many AI-driven applications attempt to combine all of these functionalities by stitching together…

    Jun 2026 · github.com

  4. 4

    We have been using graph DBs more and more at work. I found them painful to work with locally and decided to try and build something better.

    12d ago · github.com

  5. 5
    QuestDB194

    Fastest open source database for time-series and analytics

    2020

  6. 6AP
  7. 7BA
  8. 8
    MindsDB235

    In-database machine learning

    2022

  9. 9

    Massive internet datasets, embedded, open-sourced and free

    2023

  10. 10

    Bring AI to your database

    2023

  11. 11
    HelixDB105

    An open-source OLTP graph-vector database built in Rust.

    Feb 2026

  12. 12PV

    Search a 100,000-article ParqDB index directly in the browser with MiniLM, HTTP Range, Parquet, and WebAssembly.

    16d ago · search.parqdb.io

  13. 13ZP
  14. 14BA
  15. 15EA
  16. 16MM
  17. 17II

    Two weeks ago I was on my babymoon in Corfu, Greece. While in transit, I was overseeing a GSoC intern submit an important feature to my array database library, Xarray-SQL. He added `to_dataset()`, which completed the roundtrip between thinking of array data in a tabular model simultaneously as gridded rasters (the premise of the project is that every Nd array can be mapped to 2d, where orthogonal dims of the Nd array are just primary keys of a tabular representation). We discussed in chat, now that this feature existed, what demos could we make that would prove this data model works? With…

    Jul 2026 · github.com

  18. 18TS
  19. 19
    SemaDB109

    No fuss vector database for AI

    2023

  20. 20AD

    Hey HN, I’m excited to share Antfly: a distributed document database and search engine written in Go that combines full-text, vector, and graph search. Use it for distributed multimodal search and memory, or for local dev and small deployments. I built this to give developers a single-binary deployment with native ML inference (via a built-in service called Termite), meaning you don't need external API calls for vector search unless you want to use them. Some things that might interest this crowd: Capabilities: Multimodal indexing (images, audio, video), MongoDB-style in-place updates, and…

    Mar 2026 · github.com

  21. 21AM

    Vector databases store memories. They don't manage them. After 10k memories, recall quality degrades because there's no consolidation, no forgetting, no conflict resolution. Your AI agent just gets noisier. YantrikDB is a cognitive memory engine — embed it, run it as a server, or connect via MCP. It thinks about what it stores: consolidation collapses duplicate memories, contradiction detection flags incompatible facts, temporal decay with configurable half-life lets unimportant memories fade like human memory does. Single Rust binary. HTTP + binary wire protocol. 2-voter + 1-witness HA…

    Apr 2026 · github.com

  22. 22IW

    Input a SMILES string (or pick one molecule from the examples) and it returns up to 100k molecules closest in 3-D shape or electrostatic similarity – from 10+ billion scale databases — typically in under 5-10 s. *Why it might interest HN* * Entire index lives on disk — no GPU at query-time, less than ~10 GB RAM total. * Built from scratch (no FAISS index / Milvus / Pinecone). * Index-build cost: one Nvidia T4 (~ 300USD) for one 5.5B database. * Open to anyone, predict ADMET, export results as CSV/SDF. Full write-up & benchmarks (DUD-E, LIT-PCBA, SVS) in the pre-print:…

    2025 · cheese-new.deepmedchem.com

  23. 23XE

    Hey everyone! This is XTrace. Wanted to share what we’ve been working on for the past year. We built a private vector database from the ground up that performs similarity search on encrypted vectors. The server never sees your plaintext embeddings or documents. The problem we’re trying to solve: every vector DB today requires plaintext on the server. If you're doing RAG over sensitive data (medical, legal, financial), your embeddings — which researchers have shown can be inverted to recover original text — sit exposed on someone else's infrastructure. XTrace encrypts everything on your…

    Apr 2026 · github.com

  24. 24ZI

Ranked by how close each launch is in meaning, then by votes. Refine with a description →