On the public citation graph
DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph
0 signed · 65 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-030-58558-7_38openalex-snapshot
Connecting Vision and Language with Localized Narratives
inferredcites →https://doi.org/10.1007/s00778-021-00661-wopenalex-snapshot
Location- and keyword-based querying of geo-textual data: a survey
inferredcites →https://doi.org/10.1007/s00778-021-00680-7openalex-snapshot
PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search
inferredcites →https://doi.org/10.1007/s10707-019-00372-zopenalex-snapshot
S2R-tree: a pivot-based indexing structure for semantic-aware spatial keyword search
inferredcites →https://doi.org/10.1007/s11280-017-0472-yopenalex-snapshot
Semantic-aware top-k spatial keyword queries
inferredcites →https://doi.org/10.1016/0031-3203(80)90066-7openalex-snapshot
The relative neighbourhood graph of a finite planar set
inferredcites →https://doi.org/10.1016/0166-218x(91)90069-9openalex-snapshot
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
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.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1109/bibm47256.2019.8982950openalex-snapshot
Accelerating Large-Scale Molecular Similarity Search through Exploiting High Performance Computing
inferredcites →https://doi.org/10.1109/bibm49941.2020openalex-snapshot
2020 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)
inferredcites →https://doi.org/10.1109/cvpr.2016.616openalex-snapshot
FANNG: Fast Approximate Nearest Neighbour Graphs
inferredcites →https://doi.org/10.1109/cvpr.2017.327openalex-snapshot
Learning Cross-Modal Embeddings for Cooking Recipes and Food Images
inferredcites →https://doi.org/10.1109/cvpr42600.2020.00990openalex-snapshot
End-to-End Learning of Visual Representations From Uncurated Instructional Videos
inferredcites →https://doi.org/10.1109/icde.1998openalex-snapshot
Proceedings 14th International Conference on Data Engineering
inferredcites →https://doi.org/10.1109/tit.1967.1053964openalex-snapshot
Nearest neighbor pattern classification
inferredcites →https://doi.org/10.1109/tkde.2006.185openalex-snapshot
Continuous Skyline Queries for Moving Objects
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/tkde.2023.3295831openalex-snapshot
DB-LSH 2.0: Locality-Sensitive Hashing With Query-Based Dynamic Bucketing
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.2013.240openalex-snapshot
Optimized Product Quantization
inferredcites →https://doi.org/10.1109/tpami.2015.2408363openalex-snapshot
Spherical Hashing: Binary Code Embedding with Hyperspheres
inferredcites →https://doi.org/10.1109/tpami.2017.2699960openalex-snapshot
A Survey on Learning to Hash
inferredcites →https://doi.org/10.1109/tpami.2018.2798607openalex-snapshot
Multimodal Machine Learning: A Survey and Taxonomy
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.1145/1061318.1061320openalex-snapshot
Progressive skyline computation in database systems
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/3123266openalex-snapshot
Proceedings of the 25th ACM international conference on Multimedia
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/3318464openalex-snapshot
Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data
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/3588691openalex-snapshot
Effectiveness Perspectives and a Deep Relevance Model for Spatial Keyword Queries
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/375551.375567openalex-snapshot
Optimal aggregation algorithms for middleware
inferredcites →https://doi.org/10.1145/93597.98741openalex-snapshot
The R*-tree: an efficient and robust access method for points and rectangles
inferredcites →https://doi.org/10.1145/997817.997857openalex-snapshot
Locality-sensitive hashing scheme based on p-stable distributions
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.3169/mta.6.2openalex-snapshot
[Invited Paper] A Survey of Product Quantization
inferredcites →https://doi.org/10.5860/choice.35-5707bopenalex-snapshot
Handbook of discrete and computational geometry
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s44443-026-00983-1openalex-snapshot
STAR: A Long short-term workload-aware optimizer for online layout reorganization
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.1145/3774904.3792208openalex-snapshot
Breaking the Single-Reference-Vector Barrier in Approximate Nearest Neighbor Search
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/3788853.3801586openalex-snapshot
LEGEND: A Learned Explainable Graph-Enhanced Navigable Index for Hybrid Vector-Graph Search
inferred← citeshttps://doi.org/10.1145/3802027openalex-snapshot
CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute–Memory Disaggregation
inferred← citeshttps://doi.org/10.14778/3778092.3778108openalex-snapshot
A Topology-Aware Localized Update Strategy for Graph-Based ANN Index
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/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.