On the public citation graph

DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search

0 signed · 68 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/3-540-45113-7_47openalex-snapshot
Fast Search in Large-Scale Image Database Using Vector Quantization
inferredcites →https://doi.org/10.1007/s00778-018-0513-xopenalex-snapshot
Generating data series query workloads
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.1007/s00778-024-00864-xopenalex-snapshot
Survey of vector database management systems
inferredcites →https://doi.org/10.1007/s00778-024-00874-9openalex-snapshot
DumpyOS: A data-adaptive multi-ary index for scalable data series similarity search
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.2021.101807openalex-snapshot
The role of local dimensionality measures in benchmarking nearest neighbor search
inferredcites →https://doi.org/10.1016/j.is.2023.102166openalex-snapshot
Pushing diversity into higher dimensions: The LID effect on diversified similarity searching
inferredcites →https://doi.org/10.1016/s0304-4076(96)01818-0openalex-snapshot
An R-squared measure of goodness of fit for some common nonlinear regression models
inferredcites →https://doi.org/10.1109/bigdia60676.2023.10429609openalex-snapshot
A Brief Survey of Vector Databases
inferredcites →https://doi.org/10.1109/cvpr.1993openalex-snapshot
Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
inferredcites →https://doi.org/10.1109/icassp.2011.5946540openalex-snapshot
Searching in one billion vectors: Re-rank with source coding
inferredcites →https://doi.org/10.1109/icde.2001.914864openalex-snapshot
Approximate nearest neighbor searching in multimedia databases
inferredcites →https://doi.org/10.1109/icde48307.2020.00036openalex-snapshot
MESSI: In-Memory Data Series Indexing
inferredcites →https://doi.org/10.1109/icde51399.2021.00171openalex-snapshot
SING: Sequence Indexing Using GPUs
inferredcites →https://doi.org/10.1109/icde60146.2024.00045openalex-snapshot
Optimizing Context-Enhanced Relational Joins
inferredcites →https://doi.org/10.1109/icdm.2010.124openalex-snapshot
iSAX 2.0: Indexing and Mining One Billion Time Series
inferredcites →https://doi.org/10.1109/icdm.2017.151openalex-snapshot
DPiSAX: Massively Distributed Partitioned iSAX
inferredcites →https://doi.org/10.1109/sisap.2008.18openalex-snapshot
The Many Facets of Approximate Similarity Search
inferredcites →https://doi.org/10.1109/srds60354.2023.00029openalex-snapshot
FreSh: A Lock-Free Data Series Index
inferredcites →https://doi.org/10.1109/tkde.2018.2880215openalex-snapshot
Massively Distributed Time Series Indexing and Querying
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.1145/1242572.1242610openalex-snapshot
Google news personalization
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/2020408.2020578openalex-snapshot
Fast locality-sensitive hashing
inferredcites →https://doi.org/10.1145/2623330openalex-snapshot
Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
inferredcites →https://doi.org/10.1145/2628071.2628092openalex-snapshot
OpenTuner
inferredcites →https://doi.org/10.1145/2783258.2783382openalex-snapshot
Query Workloads for Data Series Indexes
inferredcites →https://doi.org/10.1145/2939672openalex-snapshot
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
inferredcites →https://doi.org/10.1145/2939672.2939785openalex-snapshot
XGBoost
inferredcites →https://doi.org/10.1145/3035918.3064029openalex-snapshot
Automatic Database Management System Tuning Through Large-scale Machine Learning
inferredcites →https://doi.org/10.1145/3132847openalex-snapshot
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management
inferredcites →https://doi.org/10.1145/3132847.3133104openalex-snapshot
Language Modeling by Clustering with Word Embeddings for Text Readability Assessment
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/3394486.3403305openalex-snapshot
Embedding-based Retrieval in Facebook Search
inferredcites →https://doi.org/10.1145/3405962.3405989openalex-snapshot
Scalable Machine Learning on High-Dimensional Vectors
inferredcites →https://doi.org/10.1145/3448016.3457550openalex-snapshot
Milvus
inferredcites →https://doi.org/10.1145/3511808.3557098openalex-snapshot
Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation
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/3588965openalex-snapshot
Dumpy: A Compact and Adaptive Index for Large Data Series Collections
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/3709701openalex-snapshot
LeaFi: Data Series Indexes on Steroids with Learned Filters
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/3579075.3579087openalex-snapshot
Odyssey: A Journey in the Land of Distributed Data Series 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/3665844.3665854openalex-snapshot
DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.14778/3704965.3704974openalex-snapshot
Steiner -Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
inferredcites →https://doi.org/10.3115/1613715openalex-snapshot
Proceedings of the Conference on Empirical Methods in Natural Language Processing - EMNLP '08
inferredcites →https://doi.org/10.3115/v1/d14-1162openalex-snapshot
Glove: Global Vectors for Word Representation
inferredcites →https://doi.org/10.3169/mta.6.2openalex-snapshot
[Invited Paper] A Survey of Product Quantization
inferredcites →https://doi.org/10.3390/info12110440openalex-snapshot
RDFsim: Similarity-Based Browsing over DBpedia Using Embeddings
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.48550/arxiv.2006.05078openalex-snapshot
Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization
inferredcites →https://doi.org/10.52202/075280-0452openalex-snapshot
Recommender Systems with Generative Retrieval

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.1007/978-981-92-3432-5_33openalex-snapshot
TADA: An Efficient Hybrid-Storage Query-Adaptive Framework for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1017/s1743921325104389openalex-snapshot
Easy, Accurate, and Fast Machine Learning on Very Large Data Series Collections: Similarity Search and Subsequence Anomaly Detection
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.1145/3769753openalex-snapshot
Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations
inferred← citeshttps://doi.org/10.1145/3770855.3817686openalex-snapshot
Recall-Aware Early Termination in Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3786639openalex-snapshot
Distribution-Aware Exploration for Adaptive HNSW 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/3836663.3836675openalex-snapshot
QBAT: Model-Based Query Budget Autotuner for Clustering-Based Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.14778/3836663.3836728openalex-snapshot
ANNiE: A Learned Query Cost Estimator for Graph-Based 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.