Help ?

IGMIN: We're glad you're here. Please click 'create a new query' if you are a new visitor to our website and need further information from us.

If you are already a member of our network and need to keep track of any developments regarding a question you have already submitted, click 'take me to my Query.'

Search

Organised by  IgMin Fevicon

Regional sites

Browse by Subjects

Welcome to IgMin Research – an Open Access journal uniting Biology, Medicine, and Engineering. We’re dedicated to advancing global knowledge and fostering collaboration across scientific fields.

Browse by Sections

At IgMin Research, we bridge the frontiers of Biology, Medicine, and Engineering to foster interdisciplinary innovation. Our expanded scope now embraces a wide spectrum of scientific disciplines, empowering global researchers to explore, contribute, and collaborate through open access.

Special Issues

Our mission is to inspire scientific partnerships that contribute to faster advancements.

Members

Our mission is to inspire scientific partnerships that contribute to faster advancements.

Articles

Our mission is to inspire scientific partnerships that contribute to faster advancements.

Explore Content

Our mission is to inspire scientific partnerships that contribute to faster advancements.

Identify Us

Our mission is to inspire scientific partnerships that contribute to faster advancements.

IgMin Corporation

Welcome to IgMin, a leading platform dedicated to enhancing knowledge dissemination and professional growth across multiple fields of science, technology, and the humanities. We believe in the power of open access, collaboration, and innovation. Our goal is to provide individuals and organizations with the tools they need to succeed in the global knowledge economy.

Publications Support
[email protected]
E-Books Support
[email protected]
Webinars & Conferences Support
[email protected]
Content Writing Support
[email protected]
IT Support
[email protected]

Search

Select Language

Explore Section

Content for the explore section slider goes here.

Table of Contents

Table of Contents at IgMin Research

Our mission is to inspire scientific partnerships that contribute to faster advancements.

Article Explorer

Search by
Clear

All Articles
Most Recent Most Viewed Most Downloaded
5 of 254 results
ANNex: Efficient Filtered Approximate Nearest Neighbor Search via Graph-Traversal Metadata Filtering
Review Article September 30, 2026

ANNex: Efficient Filtered Approximate Nearest Neighbor Search via Graph-Traversal Metadata Filtering

Mineral Hydration as a Source of Accessible Water on Mars to Enable Human Missions at Equatorial Sites
Research Article September 14, 2026

Mineral Hydration as a Source of Accessible Water on Mars to Enable Human Missions at Equatorial Sites

The Latin American Chair
Research Article September 10, 2026

The Latin American Chair

Quadimel – A New Concept in Physics and Biology
Research Article September 03, 2026

Quadimel – A New Concept in Physics and Biology

Clinical and Comorbidity Profile of Metabolic Dysfunction-Associated Steatotic Liver Disease in Tertiary Care Setting: A Retrospective Comparative Study
Research Article September 24, 2026

Clinical and Comorbidity Profile of Metabolic Dysfunction-Associated Steatotic Liver Disease in Tertiary Care Setting: A Retrospective Comparative Study

Article Preview Metrics Cite
Published: September 30, 2026 (51d) publication certificate
ANNex: Efficient Filtered Approximate Nearest Neighbor Search via Graph-Traversal Metadata Filtering Review Article

ANNex: Efficient Filtered Approximate Nearest Neighbor Search via Graph-Traversal Metadata Filtering

Danish Nasir Shaikh*

Approximate Nearest Neighbor (ANN) search is a foundational primitive in modern recommendation and retrieval systems. However, production deployments routinely require filtered ANN search-retrieving the top- K nearest neighbors that also satisfy metadata predicates-a requirement that popular highperformance libraries such as FAISS and ScaNN do not natively support without costly post-filtering loops. Existing solutions that support filtering, such as distributed search engines, introduce unacceptable latency and infrastructure overhead for latencysensitive candidate retrieval pipelines. We present ANNex, a production ANN system that integrates metadata filtering directly into HNSW graph traversal, eliminating the need for post-filtering iteration. ANNex introduces a Decreasing- K traversal strategy-the inverse of post-filtering's Increasing- K loop-in which already-visited nodes are tracked and excluded from subsequent traversals, reducing graph search depth with each iteration rather than increasing it. Combined with Product Quantization for memory compression, integer key optimization, and compiled filter functions for sub-millisecond predicate evaluation, ANNex achieves sub-30 ms p99 latency at production scale on 10 million 512-dimensional vectors with up to four concurrent clients per instance. We describe the system architecture, key design tradeoffs, and empirical evaluation results, providing a practical reference for practitioners building filtered ANN systems at scale.