On the public citation graph
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
0 signed · 124 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-41062-8_28openalex-snapshot
Engineering Efficient and Effective Non-metric Space Library
inferredcites →https://doi.org/10.1016/j.is.2013.10.006openalex-snapshot
Approximate nearest neighbor algorithm based on navigable small world graphs
inferredcites →https://doi.org/10.1016/j.is.2019.02.006openalex-snapshot
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
inferredcites →https://doi.org/10.1016/j.jda.2008.09.014openalex-snapshot
Approximate similarity search: A multi-faceted problem
inferredcites →https://doi.org/10.1016/j.patcog.2006.04.045openalex-snapshot
A survey of content-based image retrieval with high-level semantics
inferredcites →https://doi.org/10.1109/cvpr.2010.5540039openalex-snapshot
Aggregating local descriptors into a compact image representation
inferredcites →https://doi.org/10.1109/cvpr.2013.379openalex-snapshot
Optimized Product Quantization for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/cvpr.2014.124openalex-snapshot
Additive Quantization for Extreme Vector Compression
inferredcites →https://doi.org/10.1109/jproc.2015.2487976openalex-snapshot
Learning to Hash for Indexing Big Data—A Survey
inferredcites →https://doi.org/10.1109/sisap.2008.18openalex-snapshot
The Many Facets of Approximate Similarity Search
inferredcites →https://doi.org/10.1109/tbdata.2019.2921572openalex-snapshot
Billion-Scale Similarity Search with GPUs
inferredcites →https://doi.org/10.1109/tit.1967.1053964openalex-snapshot
Nearest neighbor pattern classification
inferredcites →https://doi.org/10.1109/tit.1982.1056489openalex-snapshot
Least squares quantization in PCM
inferredcites →https://doi.org/10.1109/tkde.2019.2909204openalex-snapshot
Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement
inferredcites →https://doi.org/10.1109/tpami.2010.57openalex-snapshot
Product Quantization for Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/tpami.2012.193openalex-snapshot
Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval
inferredcites →https://doi.org/10.1109/tpami.2014.2321376openalex-snapshot
Scalable Nearest Neighbor Algorithms for High Dimensional Data
inferredcites →https://doi.org/10.1109/tpami.2017.2699960openalex-snapshot
A Survey on Learning to Hash
inferredcites →https://doi.org/10.1109/tpami.2018.2889473openalex-snapshot
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
inferredcites →https://doi.org/10.1109/tpami.2021.3067706openalex-snapshot
High Dimensional Similarity Search with Satellite System Graph: Efficiency, Scalability, and Unindexed Query Compatibility
inferredcites →https://doi.org/10.1137/060673096openalex-snapshot
The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
inferredcites →https://doi.org/10.1145/1143844.1143857openalex-snapshot
Cover trees for nearest neighbor
inferredcites →https://doi.org/10.1145/1374376.1374452openalex-snapshot
Random projection trees and low dimensional manifolds
inferredcites →https://doi.org/10.1145/1806907.1806912openalex-snapshot
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space
inferredcites →https://doi.org/10.1145/2213836.2213898openalex-snapshot
Locality-sensitive hashing scheme based on dynamic collision counting
inferredcites →https://doi.org/10.1145/2559902openalex-snapshot
Sparser Johnson-Lindenstrauss Transforms
inferredcites →https://doi.org/10.1145/2736277.2741665openalex-snapshot
Sequential Hypothesis Tests for Adaptive Locality Sensitive Hashing
inferredcites →https://doi.org/10.1145/3183713.3183750openalex-snapshot
A General and Efficient Querying Method for Learning to Hash
inferredcites →https://doi.org/10.1145/3292500.3330875openalex-snapshot
Revisiting kd-tree for Nearest Neighbor Search
inferredcites →https://doi.org/10.1145/3318464.3380600openalex-snapshot
Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination
inferredcites →https://doi.org/10.1145/3318464.3386131openalex-snapshot
PASE: PostgreSQL Ultra-High-Dimensional Approximate Nearest Neighbor Search Extension
inferredcites →https://doi.org/10.1145/3447548.3470811openalex-snapshot
High-Dimensional Similarity Query Processing for Data Science
inferredcites →https://doi.org/10.1145/3512767openalex-snapshot
Reinforcement Routing on Proximity Graph for Efficient Recommendation
inferredcites →https://doi.org/10.1145/956750.956758openalex-snapshot
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
inferredcites →https://doi.org/10.1145/997817.997857openalex-snapshot
Locality-sensitive hashing scheme based on p-stable distributions
inferredcites →https://doi.org/10.1214/22-aap1784openalex-snapshot
Fast and memory-optimal dimension reduction using Kac’s walk
inferredcites →https://doi.org/10.14778/2140436.2140440openalex-snapshot
Bayesian locality sensitive hashing for fast similarity search
inferredcites →https://doi.org/10.14778/2850469.2850470openalex-snapshot
Query-aware locality-sensitive hashing for approximate nearest neighbor search
inferredcites →https://doi.org/10.14778/3303753.3303754openalex-snapshot
Fast approximate nearest neighbor search with the navigating spreading-out graph
inferredcites →https://doi.org/10.14778/3476249.3476255openalex-snapshot
A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search
inferredcites →https://doi.org/10.14778/3476311.3476407openalex-snapshot
New trends in high-D vector similarity search
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-46994-7_9openalex-snapshot
Turbo Scan: Fast Sequential Nearest Neighbor Search in High Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-032-34377-2_2openalex-snapshot
Improving IO Efficiency for Storage-Scale Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/978-981-95-8405-5_3openalex-snapshot
Scalable Distributed Index Construction for Large-Scale Graph-Based ANNS
inferred← citeshttps://doi.org/10.1007/978-981-96-2054-8_25openalex-snapshot
Dynamic Exploration Graph: A Novel Approach for Efficient Nearest Neighbor Search in Evolving Multimedia Datasets
inferred← citeshttps://doi.org/10.1007/978-981-97-7238-4_24openalex-snapshot
Tree and Graph Based Two-Stages Routing for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/s11432-025-4793-9openalex-snapshot
MSG: a unified multi-space graph index for efficient high-dimensional multi-vector search
inferred← citeshttps://doi.org/10.1007/s42452-025-08033-7openalex-snapshot
Design and implementation of smart elderly care health monitoring system based on deep belief network with improved bayesian optimization
inferred← citeshttps://doi.org/10.1109/2575-8411.2026.00115openalex-snapshot
PARS: Optimizing High-Dimensional Vector Search with Dimensional Reduction and Ray Tracing Core
inferred← citeshttps://doi.org/10.1109/acie64499.2025.00026openalex-snapshot
Hybrid Query of Boolean Filter and Vector Similarity Search: Benchmark, Comparison and Direction
inferred← citeshttps://doi.org/10.1109/bibm66473.2025.11356641openalex-snapshot
Semantic-Aware Hierarchical Index Construction Based on Large-Scale Medical Textual Multi-Themes Complex Graphs
inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11401069openalex-snapshot
Let them have CAKES: A Cutting-Edge Algorithm for Scalable, Efficient, and Exact Search on Big Data
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00361openalex-snapshot
MUST: An Effective and Scalable Framework for Multimodal Search of Target Modality
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00032openalex-snapshot
Boosting Accuracy and Efficiency for Vector Retrieval with Local Scaling Graph
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00087openalex-snapshot
Effective and General Distance Computation for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00180openalex-snapshot
Towards Accurate Distance Estimation for Distribution-Aware c-ANN Search
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00053openalex-snapshot
Trading Vector Data in Vector Databases
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00156openalex-snapshot
Distance Comparison Operations are not Silver Bullets in Vector Similarity Search: A Benchmark Study on their Merits and Limits
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00251openalex-snapshot
Fast $k$-Means via Data-Aware Grouping and Gap-Optimized Lower Bound
inferred← citeshttps://doi.org/10.1109/icftic68075.2025.11324666openalex-snapshot
Optimizing Graph Navigability in Dynamic Environments: Local Connectivity Repair and Incremental Sampling
inferred← citeshttps://doi.org/10.1109/icraic61978.2023.00013openalex-snapshot
Which performs better, linear scanning or the KNN searching algorithm based on 2D grids?
inferred← citeshttps://doi.org/10.1109/informatics62280.2024.10900871openalex-snapshot
Prototype of Domain-Specific Language for Uniform Access to Vector Databases
inferred← citeshttps://doi.org/10.1109/isca66397.2026.00105openalex-snapshot
NasZip: Software and Hardware Co-Design to Accelerate Approximate Nearest Neighbor Search with DIMM-Based Near-Data Processing
inferred← citeshttps://doi.org/10.1109/mlcad62225.2024.10740216openalex-snapshot
High-Dimensional Yield Analysis Using Sparse Representation for Long-Tailed Distribution
inferred← citeshttps://doi.org/10.1109/tbdata.2026.3689013openalex-snapshot
Representation Decorrelation Guided Robust Image Retrieval Against Label Noise
inferred← citeshttps://doi.org/10.1109/tkde.2024.3381111openalex-snapshot
DForest: A Minimal Dimensionality-Aware Indexing for High-Dimensional Exact Similarity Search
inferred← citeshttps://doi.org/10.1145/3620665.3640360openalex-snapshot
JUNO: Optimizing High-Dimensional Approximate Nearest Neighbour Search with Sparsity-Aware Algorithm and Ray-Tracing Core Mapping
inferred← citeshttps://doi.org/10.1145/3654970openalex-snapshot
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3670474.3685954openalex-snapshot
High-Dimensional Yield Analysis Using Sparse Representation for Long-Tailed Distribution
inferred← citeshttps://doi.org/10.1145/3695053.3731013openalex-snapshot
ANSMET: Approximate Nearest Neighbor Search with Near-Memory Processing and Hybrid Early Termination
inferred← citeshttps://doi.org/10.1145/3696410.3714870openalex-snapshot
Angular Distance-Guided Neighbor Selection for Graph-Based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3698814openalex-snapshot
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3709729openalex-snapshot
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3709730openalex-snapshot
SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3709743openalex-snapshot
Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities
inferred← citeshttps://doi.org/10.1145/3712285.3759777openalex-snapshot
UpANNS: Enhancing Billion-Scale ANNS Efficiency with Real-World PIM Architecture
inferred← citeshttps://doi.org/10.1145/3725260openalex-snapshot
Accelerating Graph Indexing for ANNS on Modern CPUs
inferred← citeshttps://doi.org/10.1145/3725325openalex-snapshot
MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3725333openalex-snapshot
PDX: A Data Layout for Vector Similarity Search
inferred← citeshttps://doi.org/10.1145/3725413openalex-snapshot
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3736227.3736233openalex-snapshot
Bang for the Buck: Vector Search on Cloud CPUs
inferred← citeshttps://doi.org/10.1145/3746027.3754945openalex-snapshot
Graph-based Approximate Nearest Neighbor Search by Deep Reinforcement Routing
inferred← citeshttps://doi.org/10.1145/3746252.3761421openalex-snapshot
InstANNS: Scalable Approximate Nearest Neighbor Search via Cost-Efficient In-Storage Processing
inferred← citeshttps://doi.org/10.1145/3749116.3749122openalex-snapshot
Graph Data Management and Graph Machine Learning: Synergies and Opportunities
inferred← citeshttps://doi.org/10.1145/3749167openalex-snapshot
HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3767695.3769495openalex-snapshot
On the Interplay Between Graph Quality, Traversal Strategies, and Performance of ANN Retrieval Methods
inferred← citeshttps://doi.org/10.1145/3767716openalex-snapshot
Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation
inferred← citeshttps://doi.org/10.1145/3768585openalex-snapshot
JUNO++: Optimizing ANNS and Enabling Efficient Sparse Attention in LLM via Ray Tracing Core
inferred← citeshttps://doi.org/10.1145/3769783openalex-snapshot
Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3769824openalex-snapshot
SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation
inferred← citeshttps://doi.org/10.1145/3770855.3817657openalex-snapshot
Pick Up Where You Left Off: An Efficient Solution for Continuous Vector Similarity Search
inferred← citeshttps://doi.org/10.1145/3770855.3817671openalex-snapshot
Beyond Structure-Driven Tuning: Cost-Aligned Graph Optimization for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3786630openalex-snapshot
CANDOR-Bench: Benchmarking In-Memory Continuous ANNS under Dynamic Open-World Streams [Experiments & Analysis]
inferred← citeshttps://doi.org/10.1145/3786643openalex-snapshot
Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph
inferred← citeshttps://doi.org/10.1145/3789265openalex-snapshot
Efficient Time-Restricted k NN Search in High-Dimensional Data Using Multi-Level Block Indexing, with Extensions to Multi-Attribute Filtering
inferred← citeshttps://doi.org/10.1145/3793926openalex-snapshot
Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD
inferred← citeshttps://doi.org/10.1145/3797905.3807855openalex-snapshot
GAAF: Fast and Scalable Graph-based Vector Similarity Search with Any-Match Label Filtering
inferred← citeshttps://doi.org/10.1145/3802045openalex-snapshot
Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search
inferred← citeshttps://doi.org/10.1145/3802069openalex-snapshot
GPS: Revisiting the Data Layout for Disk-based High-Dimensional Vector Search
inferred← citeshttps://doi.org/10.1145/3802098openalex-snapshot
PathSeer: Adaptive Neighbor Handling for Efficient Filtered ANN Search
inferred← citeshttps://doi.org/10.1145/3802120openalex-snapshot
Through the Lens of Hubness: A Revisit on Graph-Based Approximate Nearest Neighbor Search: [Experiments & Analysis]
inferred← citeshttps://doi.org/10.14778/3681954.3681959openalex-snapshot
RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3696435.3696439openalex-snapshot
Chameleon: A Heterogeneous and Disaggregated Accelerator System for Retrieval-Augmented Language Models
inferred← citeshttps://doi.org/10.14778/3704965.3704974openalex-snapshot
Steiner -Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
inferred← citeshttps://doi.org/10.14778/3712221.3712244openalex-snapshot
Efficient Data-Aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3746405.3746427openalex-snapshot
HAKES : Scalable Vector Database for Embedding Search Service
inferred← citeshttps://doi.org/10.14778/3749646.3749655openalex-snapshot
Fast Graph Vector Search via Hardware Acceleration and Delayed-Synchronization Traversal
inferred← citeshttps://doi.org/10.14778/3749646.3749725openalex-snapshot
SIEVE: Effective Filtered Vector Search with Collection of Indexes
inferred← citeshttps://doi.org/10.14778/3750601.3750624openalex-snapshot
VSAG: An Optimized Search Framework for Graph-Based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3772181.3772184openalex-snapshot
ConANN: Conformal Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3785297.3785304openalex-snapshot
Elastic Index Selection for Label-Hybrid AKNN Search
inferred← citeshttps://doi.org/10.14778/3827998.3828146openalex-snapshot
Advances of Query Processing in Vector Databases
inferred← citeshttps://doi.org/10.14778/3836663.3836728openalex-snapshot
ANNiE: A Learned Query Cost Estimator for Graph-Based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1515/comp-2025-0036openalex-snapshot
Interacting with vector databases by means of domain-specific language
inferred← citeshttps://doi.org/10.32657/10356/181650openalex-snapshot
Efficient approximate nearest neighbor search on high-dimensional vectors by graph and quantization
inferred← citeshttps://doi.org/10.4018/jcit.335945openalex-snapshot
Selecting Indispensable Edge Patterns With Adaptive Sampling and Double Local Analysis for Data Description
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.