arXiv (All)
open access
VectorMaton: Efficient Vector Search with Pattern Constraints via an Enhanced Suffix Automaton
Approximate nearest neighbor search (ANNS) has become a cornerstone in modern vector database systems. Given a query vector, ANNS retrieves the closest vectors from a set of base vectors. In real-world applications, vectors are often accompanied by additional information, such as sequences or struct
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fast Label-Filtering Approximate Nearest Neighbor Search via Progressive Label Set Stratification#1084948
- Fast Label-Filtering Approximate Nearest Neighbor Search via Progressive Label Set Stratification#919515
- Better Nearest Neighbor Graph Indices via (Efficient) LLM-Guided Pruning#1131201
- Index-Free Dynamic Edge Retrieval with Energy-Tail-Aware Partial Scans#822244
- Scalable Maximal Frequent Episode Mining with Desbordante#343445
Record · ID 1049761
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive