On the public citation graph

DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter

https://doi.org/10.1145/3725399
0 signed · 38 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.1016/j.is.2013.10.006openalex-snapshot
Approximate nearest neighbor algorithm based on navigable small world graphs
inferredcites →https://doi.org/10.1109/cvpr.2015.7298930openalex-snapshot
Learning descriptors for object recognition and 3D pose estimation
inferredcites →https://doi.org/10.1109/iccv.2015.19openalex-snapshot
Local Convolutional Features with Unsupervised Training for Image Retrieval
inferredcites →https://doi.org/10.1109/sisap13879.2008openalex-snapshot
First International Workshop on Similarity Search and Applications (sisap 2008)
inferredcites →https://doi.org/10.1109/tbdata.2019.2921572openalex-snapshot
Billion-Scale Similarity Search with GPUs
inferredcites →https://doi.org/10.1109/tpami.2010.57openalex-snapshot
Product Quantization for Nearest Neighbor Search
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.1137/s009753970240481xopenalex-snapshot
Optimal External Memory Interval Management
inferredcites →https://doi.org/10.1145/1327452.1327494openalex-snapshot
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
inferredcites →https://doi.org/10.1145/1963405.1963487openalex-snapshot
Efficient k-nearest neighbor graph construction for generic similarity measures
inferredcites →https://doi.org/10.1145/276698.276876openalex-snapshot
Approximate nearest neighbors
inferredcites →https://doi.org/10.1145/2939672.2939754openalex-snapshot
node2vec
inferredcites →https://doi.org/10.1145/3375395.3387641openalex-snapshot
word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data
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/3639324openalex-snapshot
SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1145/3654923openalex-snapshot
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data
inferredcites →https://doi.org/10.1145/3698814openalex-snapshot
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
inferredcites →https://doi.org/10.1145/997817.997857openalex-snapshot
Locality-sensitive hashing scheme based on p-stable distributions
inferredcites →https://doi.org/10.14778/2856318.2856324openalex-snapshot
Cache locality is not enough
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/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/3665844.3665854openalex-snapshot
DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.18653/v1/2022.findings-acl.47openalex-snapshot
Fast Nearest Neighbor Machine Translation
inferredcites →https://doi.org/10.18653/v1/2023.acl-long.10openalex-snapshot
Subset Retrieval Nearest Neighbor Machine Translation

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103771openalex-snapshot
CD-ANN: Scalable Approximate Nearest Neighbor search on client-side devices
inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00032openalex-snapshot
GPU-Accelerated Approximate Nearest Neighbor Search via PCA-Augmented Graph Indexing for Vector Databases
inferred← citeshttps://doi.org/10.1109/tkde.2026.3722749openalex-snapshot
Approximate Nearest Neighbor Search Over Temporal Vector Data
inferred← citeshttps://doi.org/10.1145/3770855.3817986openalex-snapshot
Generalized Range Filtering Approximate Nearest Neighbor Search: Containment and Overlap
inferred← citeshttps://doi.org/10.1145/3786635openalex-snapshot
Curator: Efficient Vector Search with Low-Selectivity Filters
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/3805712.3809731openalex-snapshot
Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
inferred← citeshttps://doi.org/10.1145/3806645.3807575openalex-snapshot
SIVF: GPU-Resident IVF Index for Streaming Vector Analytics
inferred← citeshttps://doi.org/10.1145/3816782.3819219openalex-snapshot
CleanANN: Efficient and Robust Full Dynamism in Graph-based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3827998.3828146openalex-snapshot
Advances of Query Processing in Vector Databases
inferred← citeshttps://doi.org/10.14778/3828612.3828636openalex-snapshot
RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.21203/rs.3.rs-9916583/v1openalex-snapshot
When Does a Partitioned ANN Index Need Active Re-Partitioning Under Drift? A Characterization and Benchmark
inferred← citeshttps://doi.org/10.3390/s25206461openalex-snapshot
ON-NSW: Accelerating High-Dimensional Vector Search on Edge Devices with GPU-Optimized NSW
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.