This repository implements a C-based SQLite loadable extension that adds vector search capabilities directly within SQLite databases. It enables similarity search using distance metrics (L2, Cosine, Dot, L1, Hamming) on various vector types (F32, F16, BF16, I8, U8, BIT) without requiring virtual tables. The core architecture is a modular C extension with runtime SIMD dispatch for hardware-accelerated distance calculations, supporting platforms including Linux, macOS, Windows, Android, iOS, and RISC-V. The project provides official language bindings for Python, Node.js, Swift, Flutter, and Android, facilitating integration into diverse application stacks. It includes a TurboQuant implementation for compact 2/3/4-bit quantization, allowing for reduced memory footprint and approximate search with high recall. The codebase demonstrates high craftsmanship in low-level optimization, particularly in its SIMD intrinsics handling and cross-platform binary distribution strategy. While the repository contains benchmarking scripts and quantization research documentation, its primary function is as a production-ready library for edge AI and mobile workloads. It is designed for offline, on-device AI with a low memory footprint (~30MB default). The zero open issues and recent commit activity indicate a stable and actively maintained codebase with low technical drift.
SeekStorm is a high-performance search engine library and multi-tenancy server implemented in Rust. It provides both lexical (BM25F with proximity) and vector (ANN with IVF clustering and scalar/Turbo quantization) search capabilities, supporting real-time indexing, faceted search, spelling correction, query auto-completion, highlighting, and hybrid result fusion via RRF. The architecture consists of a core library (`seekstorm`), a RESTful server (`seekstorm_server`) with embedded web UI, and a Rust client SDK (`seekstorm_client`). The server uses memory-mapped files for persistence, supports per-index configuration of tokenizers, stemmers, stop words, and compression, and enforces multi-tenant isolation via API keys with resource quotas. Search performance is enhanced with SIMD acceleration (AVX2/NEON) for posting list intersection, vector quantization, and distance computations. The codebase is well-tested with extensive integration and consistency tests, and follows an explicit commit model for durability.
This repository is a curated collection of machine unlearning research, combining a comprehensive survey paper (in the form of a Kaggle notebook) with executable implementations of several unlearning algorithms across different domains. It includes code for graph neural network unlearning (GraphProjector), federated learning unlearning (FedEraser), and approximate nearest neighbor search with unlearning (UnfoldedSelf-ReconstructionHashing, a fork of ann-benchmarks). The repo serves both as a literature index (taxonomy, evaluation metrics, datasets) and a benchmark hub for reproducing and comparing unlearning methods. While the survey is actively maintained, the algorithm codebases are research prototypes with varying levels of polish and portability.