On the public citation graph

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search

https://doi.org/10.1145/3698814
0 signed · 79 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11795490_19openalex-snapshot
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph
inferredcites →https://doi.org/10.1007/3-540-47724-1_14openalex-snapshot
Constrained Nearest Neighbor Queries
inferredcites →https://doi.org/10.1007/3-540-58094-8_18openalex-snapshot
Proximity matching using fixed-queries trees
inferredcites →https://doi.org/10.1007/978-3-319-46759-7_2openalex-snapshot
Pruned Bi-directed K-nearest Neighbor Graph for Proximity Search
inferredcites →https://doi.org/10.1007/978-3-540-85654-2_7openalex-snapshot
HRG: A Graph Structure for Fast Similarity Search in Metric Spaces
inferredcites →https://doi.org/10.1007/978-3-662-04245-8openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/s00778-021-00691-4openalex-snapshot
Pivot selection algorithms in metric spaces: a survey and experimental study
inferredcites →https://doi.org/10.1007/s007780050069openalex-snapshot
Approximate similarity retrieval with M-trees
inferredcites →https://doi.org/10.1007/s007780200060openalex-snapshot
Searching in metric spaces by spatial approximation
inferredcites →https://doi.org/10.1016/0167-8655(86)90013-9openalex-snapshot
An algorithm for finding nearest neighbours in (approximately) constant average time
inferredcites →https://doi.org/10.1016/0306-4379(87)90041-xopenalex-snapshot
Voronoi trees and clustering problems
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.2015.10.014openalex-snapshot
Faster proximity searching with the distal SAT
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/s0020-0190(02)00344-7openalex-snapshot
Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces
inferredcites →https://doi.org/10.1109/adc.2001openalex-snapshot
Proceedings 12th Australasian Database Conference. ADC 2001
inferredcites →https://doi.org/10.1109/cvpr.2014.124openalex-snapshot
Additive Quantization for Extreme Vector Compression
inferredcites →https://doi.org/10.1109/cvpr.2016.616openalex-snapshot
FANNG: Fast Approximate Nearest Neighbour Graphs
inferredcites →https://doi.org/10.1109/sisap.2008.18openalex-snapshot
The Many Facets of Approximate Similarity Search
inferredcites →https://doi.org/10.1109/tkde.2015.2506556openalex-snapshot
Efficient Metric Indexing for Similarity Search and Similarity Joins
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.2013.240openalex-snapshot
Optimized Product Quantization
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.1109/tse.1983.235263openalex-snapshot
A Data Structure and an Algorithm for the Nearest Point Problem
inferredcites →https://doi.org/10.1109/tsmcb.2005.848489openalex-snapshot
MetricMap: An Embedding Technique for Processing Distance-Based Queries in Metric Spaces
inferredcites →https://doi.org/10.1145/1143844.1143857openalex-snapshot
Cover trees for nearest neighbor
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/1995412.1995418openalex-snapshot
Clustered pivot tables for I/O-optimized similarity search
inferredcites →https://doi.org/10.1145/2213836.2213898openalex-snapshot
Locality-sensitive hashing scheme based on dynamic collision counting
inferredcites →https://doi.org/10.1145/223784.223812openalex-snapshot
FastMap
inferredcites →https://doi.org/10.1145/258533.258655openalex-snapshot
Nearest neighbor queries in metric spaces
inferredcites →https://doi.org/10.1145/276698.276876openalex-snapshot
Approximate nearest neighbors
inferredcites →https://doi.org/10.1145/3188745.3188916openalex-snapshot
Hardness of approximate nearest neighbor search
inferredcites →https://doi.org/10.1145/3240508.3240630openalex-snapshot
Reconfigurable Inverted Index
inferredcites →https://doi.org/10.1145/3284028.3284030openalex-snapshot
The Design and Implementation of a Real Time Visual Search System on JD E-commerce Platform
inferredcites →https://doi.org/10.1145/3447548.3470811openalex-snapshot
High-Dimensional Similarity Query Processing for Data Science
inferredcites →https://doi.org/10.1145/3448016.3457550openalex-snapshot
Milvus
inferredcites →https://doi.org/10.1145/3490148.3538581openalex-snapshot
Parallel Cover Trees and their Applications
inferredcites →https://doi.org/10.1145/3511808.3557610openalex-snapshot
HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints
inferredcites →https://doi.org/10.1145/3530812openalex-snapshot
Machine Learning-Enabled IoT Security: Open Issues and Challenges Under Advanced Persistent Threats
inferredcites →https://doi.org/10.1145/3543507.3583552openalex-snapshot
Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters
inferredcites →https://doi.org/10.1145/3589282openalex-snapshot
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
inferredcites →https://doi.org/10.1145/3589777openalex-snapshot
High-Throughput Vector Similarity Search in Knowledge Graphs
inferredcites →https://doi.org/10.1145/362003.362025openalex-snapshot
Some approaches to best-match file searching
inferredcites →https://doi.org/10.1145/3639324openalex-snapshot
SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1145/3654970openalex-snapshot
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1145/958942.958948openalex-snapshot
Index-driven similarity search in metric spaces (Survey Article)
inferredcites →https://doi.org/10.1145/997817.997857openalex-snapshot
Locality-sensitive hashing scheme based on p-stable distributions
inferredcites →https://doi.org/10.14778/2735461.2735462openalex-snapshot
SRS
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/3415478.3415541openalex-snapshot
AnalyticDB-V
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
inferredcites →https://doi.org/10.48550/arxiv.2005.11401openalex-snapshot
Affordance-Compiled Intelligence: Observable-Only Cognitive Impedance Matching for No-Meta LLM-Integrated Systems
inferredcites →https://doi.org/10.52202/085713openalex-snapshot
Advances in Neural Information Processing Systems 19
inferredcites →https://doi.org/10.5555/313559.313789openalex-snapshot
Data structures and algorithms for nearest neighbor search in general metric spaces

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11402093openalex-snapshot
IVF++: A Flexible and Efficient Algorithm for Approximate Nearest Neighbor Search under Attribute Constraint
inferred← citeshttps://doi.org/10.1109/icdcsw72724.2026.00026openalex-snapshot
Predicate-Agnostic Filtered ANNS for Low-Selectivity Hybrid Queries in FAISS
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00228openalex-snapshot
Timestamp Approximate Nearest Neighbor Search Over High-Dimensional Vector Data
inferred← citeshttps://doi.org/10.1109/tkde.2026.3667997openalex-snapshot
Geometric Partition for Billion-Scale Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/tkde.2026.3722749openalex-snapshot
Approximate Nearest Neighbor Search Over Temporal Vector Data
inferred← citeshttps://doi.org/10.1145/3711896.3736958openalex-snapshot
FedVS: Towards Federated Vector Similarity Search with Filters
inferred← citeshttps://doi.org/10.1145/3711896.3736997openalex-snapshot
Hi-PNG: Efficient Interval-Filtering ANNS via Hierarchical Interval Partition Navigating Graph
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/3725399openalex-snapshot
DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter
inferred← citeshttps://doi.org/10.1145/3736716openalex-snapshot
Graph Based K-Nearest Neighbor Search Revisited
inferred← citeshttps://doi.org/10.1145/3769763openalex-snapshot
Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study
inferred← citeshttps://doi.org/10.1145/3786635openalex-snapshot
Curator: Efficient Vector Search with Low-Selectivity Filters
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/3802060openalex-snapshot
FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances
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/3802118openalex-snapshot
TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3805712.3809731openalex-snapshot
Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
inferred← citeshttps://doi.org/10.1145/3828820.3828830openalex-snapshot
Label-Balanced Graph Index for Filtered Approximate Nearest Neighbor Search with Low-Frequency Labels
inferred← citeshttps://doi.org/10.14778/3748191.3748193openalex-snapshot
Dynamic Range-Filtering Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3828612.3828636openalex-snapshot
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search
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.