arXiv (All)
open access
AiSAQ-in-Filtering for DRAM-free Filtered Information Retrieval
Filtering search is one of the crucial applications of approximate nearest neighbor search (ANNS). In filtering search, label information is used in conjunction with unstructured vector data. ANNS provides efficient similarity search in large-scale datasets, however, the memory footprint of storing
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
- VectorMaton: Efficient Vector Search with Pattern Constraints via an Enhanced Suffix Automaton#1049761
- Cached LLM Probability Retrieval for Speech Recognition#617696
- Cached LLM Probability Retrieval for Speech Recognition#617196
Record · ID 1342839
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