On the public citation graph

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search

0 signed · 83 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/s00778-024-00864-xopenalex-snapshot

Survey of vector database management systems

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.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/focs.2017.64openalex-snapshot

Optimality of the Johnson-Lindenstrauss Lemma

inferredcites →https://doi.org/10.1109/focs.2017.65openalex-snapshot

Optimal Compression of Approximate Inner Products and Dimension Reduction

inferredcites →https://doi.org/10.1109/icde53745.2022.00268openalex-snapshot

Fast Adaptive Similarity Search through Variance-Aware Quantization

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/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.2019.2952606openalex-snapshot

Quicker ADC : Unlocking the Hidden Potential of Product Quantization With SIMD

inferredcites →https://doi.org/10.1137/20m1371324openalex-snapshot

Optimal (Euclidean) Metric Compression

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/276698.276876openalex-snapshot

Approximate nearest neighbors

inferredcites →https://doi.org/10.1145/276698.276877openalex-snapshot

Efficient search for approximate nearest neighbor in high dimensional spaces

inferredcites →https://doi.org/10.1145/3078971.3078992openalex-snapshot

Accelerated Nearest Neighbor Search with Quick ADC

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/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/3448016.3457550openalex-snapshot

Milvus

inferredcites →https://doi.org/10.1145/354756.354820openalex-snapshot

Vector approximation based indexing for non-uniform high dimensional data sets

inferredcites →https://doi.org/10.1145/3581784.3607045openalex-snapshot

Co-design Hardware and Algorithm for Vector Search

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/3639269openalex-snapshot

Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment

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/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/509907.509965openalex-snapshot

Similarity estimation techniques from rounding algorithms

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/2856318.2856324openalex-snapshot

Cache locality is not enough

inferredcites →https://doi.org/10.14778/3282495.3282498openalex-snapshot

The lernaean hydra of data series similarity 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

inferredcites →https://doi.org/10.14778/3554821.3554843openalex-snapshot

Manu

inferredcites →https://doi.org/10.14778/3611479.3611537openalex-snapshot

Similarity Search in the Blink of an Eye with Compressed Indices

inferredcites →https://doi.org/10.18653/v1/2022.naacl-main.272openalex-snapshot

ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction

inferredcites →https://doi.org/10.3169/mta.6.2openalex-snapshot

[Invited Paper] A Survey of Product Quantization

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-37670-1_25openalex-snapshot

DalQ: Reconciling Accuracy and Efficiency in Vector Quantization

inferred← citeshttps://doi.org/10.1109/access.2026.3713412openalex-snapshot

Hybrid Scalar-Product Compression (HSPC): Optimizing Quantization in Vector Retrieval via Hot-Cold Separation

inferred← citeshttps://doi.org/10.1109/bigdata66926.2025.11402214openalex-snapshot

Functional Programming Meets Pinecone: Recommending Graph Structured Documents

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.00033openalex-snapshot

Federated Retrieval Over Embedding-Heterogeneous Vector Databases

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.00265openalex-snapshot

QPAD: Quantile-Preserving Approximate Dimension Reduction for Nearest Neighbors Preservation in High-Dimensional Vector Search

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/3749167openalex-snapshot

HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search

inferred← citeshttps://doi.org/10.1145/3769780openalex-snapshot

DiskJoin: Large-scale Vector Similarity Join with SSD

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/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/3786645openalex-snapshot

Efficient Vector Index Merging in Vector Databases

inferred← citeshttps://doi.org/10.1145/3786690openalex-snapshot

Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis]

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/3802060openalex-snapshot

FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances

inferred← citeshttps://doi.org/10.1145/3802065openalex-snapshot

GEM: A Native Graph-based Index for Multi-Vector Retrieval

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/3802120openalex-snapshot

Through the Lens of Hubness: A Revisit on Graph-Based Approximate Nearest Neighbor Search: [Experiments & Analysis]

inferred← citeshttps://doi.org/10.1145/3805712.3808484openalex-snapshot

All the News That Fits in Bits: Learned Rotation-Aware Binary Projections for Efficient News Retrieval at NDTV

inferred← citeshttps://doi.org/10.1145/3806645.3807575openalex-snapshot

SIVF: GPU-Resident IVF Index for Streaming Vector Analytics

inferred← citeshttps://doi.org/10.14778/3801059.3801067openalex-snapshot

JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional 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.14778/3836663.3836702openalex-snapshot

BBC: Improving Large- k Approximate Nearest Neighbor Search with a Bucket-Based Result Collector

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

inferred← citeshttps://doi.org/10.59982/18294359-26.1-nv-36openalex-snapshot

ԻՄԱՍՏԱԲԱՆԱԿԱՆ ՆՄԱՆՈՒԹՅԱՆ ԵՎ ՎԵԿՏՈՐԱՅԻՆ ՏՎՅԱԼՆԵՐԻ ԿԻՐԱՌՄԱՆ ՈՒՂՂՈՒԹՅԱՆ ՀԱՄԱԿԱՐԳԱՅԻՆ ՎԵՐԱԿՈՂՄՆՈՐՈՇՈՒՄ / THE PARADIGM SHIFT TOWARD SEMANTIC SIMILARITY AND VECTOR DATA STORES

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.