On the public citation graph

SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search

https://doi.org/10.1145/3709730
0 signed · 71 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/0-387-29151-2openalex-snapshot
Similarity Search The Metric Space Approach
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-72079-9openalex-snapshot
The adaptive web: methods and strategies of web personalization
inferredcites →https://doi.org/10.1007/s00778-022-00771-zopenalex-snapshot
ProS: data series progressive k-NN similarity search and classification with probabilistic quality guarantees
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.is.2020.101507openalex-snapshot
A survey on graph-based methods for similarity searches in metric spaces
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.2019.106970openalex-snapshot
Hierarchical Clustering-Based Graphs for Large Scale 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/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.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.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/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/276698.276876openalex-snapshot
Approximate nearest neighbors
inferredcites →https://doi.org/10.1145/3078971.3078992openalex-snapshot
Accelerated Nearest Neighbor Search with Quick ADC
inferredcites →https://doi.org/10.1145/3397271.3401075openalex-snapshot
ColBERT
inferredcites →https://doi.org/10.1145/3447548.3470811openalex-snapshot
High-Dimensional Similarity Query Processing for Data Science
inferredcites →https://doi.org/10.1145/3448016openalex-snapshot
Proceedings of the 2021 International Conference on Management of Data
inferredcites →https://doi.org/10.1145/3477495.3536324openalex-snapshot
Applications and Future of Dense Retrieval in Industry
inferredcites →https://doi.org/10.1145/3490148.3538581openalex-snapshot
Parallel Cover Trees and their Applications
inferredcites →https://doi.org/10.1145/3539618.3591831openalex-snapshot
Integrity and Junkiness Failure Handling for Embedding-based Retrieval: A Case Study in Social Network Search
inferredcites →https://doi.org/10.1145/3543507.3583318openalex-snapshot
FINGER: Fast Inference for Graph-based Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1145/3588908openalex-snapshot
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases
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/3626246.3654691openalex-snapshot
Vector Database Management Techniques and Systems
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/3654990openalex-snapshot
Vexless: A Serverless Vector Data Management System Using Cloud Functions
inferredcites →https://doi.org/10.1145/582410.582412openalex-snapshot
Searching in metric spaces with user-defined and approximate distances
inferredcites →https://doi.org/10.1145/641007.641117openalex-snapshot
VQ-index
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.14778/3583140.3583166openalex-snapshot
ELPIS: Graph-Based Similarity Search for Scalable Data Science
inferredcites →https://doi.org/10.14778/3594512.3594527openalex-snapshot
Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces
inferredcites →https://doi.org/10.14778/3681954.3681959openalex-snapshot
RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.14778/3685800.3685805openalex-snapshot
SingleStore-V: An Integrated Vector Database System in SingleStore
inferredcites →https://doi.org/10.18653/v1/2023.acl-tutorials.6openalex-snapshot
Retrieval-based Language Models and Applications
inferredcites →https://doi.org/10.48550/arxiv.2005.11401openalex-snapshot
Affordance-Compiled Intelligence: Observable-Only Cognitive Impedance Matching for No-Meta LLM-Integrated Systems

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-032-39820-8_27openalex-snapshot
Navigating the Vector Search Landscape: ANN Indexes for Modern AI Systems
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00125openalex-snapshot
Overcoming the Sync-Compute Dilemma in Parallel Graph-Based Vector Retrieval
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00309openalex-snapshot
The Virtuous Cycle: AI-Powered Vector Search and Vector Search-Augmented AI
inferred← citeshttps://doi.org/10.1109/tccn.2026.3705821openalex-snapshot
An Efficient Privacy-Preserving Retrieval Scheme for Cloud-Based Retrieval-Augmented Generation
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/3769753openalex-snapshot
Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations
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/3769799openalex-snapshot
High-Throughput, Cost-Effective Billion-Scale Vector Search with a Single GPU
inferred← citeshttps://doi.org/10.1145/3770855.3817681openalex-snapshot
NodeBits: A Plug-and-Play Framework for Accelerating Graph Inference by Post-Hoc Binary Quantization
inferred← citeshttps://doi.org/10.1145/3770855.3817891openalex-snapshot
PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing
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/3802027openalex-snapshot
CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute–Memory Disaggregation
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/3802060openalex-snapshot
FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances
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/3806645.3807575openalex-snapshot
SIVF: GPU-Resident IVF Index for Streaming Vector Analytics
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/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.47363/jaicc/2026(5)518openalex-snapshot
Optimizing Vector Embedding Storage and Indexing for AI at Scale: A Unified Framework for Progressive Quantization, Adaptive Indexing, and RAG-Aware Retrieval Evaluation
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.