On the public citation graph
Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities
0 signed · 66 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-01258-8_13openalex-snapshot
Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
inferredcites →https://doi.org/10.1007/978-3-030-89657-7_3openalex-snapshot
A Triangle Inequality for Cosine Similarity
inferredcites →https://doi.org/10.1037//1076-898x.6.4.322openalex-snapshot
Milliseconds matter: An introduction to microstrategies and to their use in describing and predicting interactive behavior.
inferredcites →https://doi.org/10.1109/ccgrid51090.2021.00023openalex-snapshot
TiAcc: Triangle-inequality based Hardware Accelerator for K-means on FPGAs
inferredcites →https://doi.org/10.1109/cvpr.2012.6247790openalex-snapshot
Scalable k-NN graph construction for visual descriptors
inferredcites →https://doi.org/10.1109/cvpr.2014.298openalex-snapshot
Locally Optimized Product Quantization for Approximate Nearest Neighbor Search
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/cvpr12618.2008openalex-snapshot
2008 IEEE Conference on Computer Vision and Pattern Recognition
inferredcites →https://doi.org/10.1109/fccm.2019.00061openalex-snapshot
KPynq: A Work-Efficient Triangle-Inequality Based K-Means on FPGA
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/iccv.2009.5459466openalex-snapshot
Kernelized locality-sensitive hashing for scalable image search
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/icde53745.2022.00268openalex-snapshot
Fast Adaptive Similarity Search through Variance-Aware Quantization
inferredcites →https://doi.org/10.1109/ijcnn.2011.6033373openalex-snapshot
A fast exact k-nearest neighbors algorithm for high dimensional search using k-means clustering and triangle inequality
inferredcites →https://doi.org/10.1109/tpami.2010.57openalex-snapshot
Product Quantization for Nearest Neighbor Search
inferredcites →https://doi.org/10.1109/tpami.2013.125openalex-snapshot
Trinary-Projection Trees for Approximate Nearest Neighbor Search
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.1137/22m1525193openalex-snapshot
On the Approximability and Curse of Dimensionality of Certain Classes of High-Dimensional Functions
inferredcites →https://doi.org/10.1145/177424.177609openalex-snapshot
An algorithm for approximate closest-point queries
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/2396761.2396831openalex-snapshot
Efficient retrieval of recommendations in a matrix factorization framework
inferredcites →https://doi.org/10.1145/2534169.2486028openalex-snapshot
Speeding up distributed request-response workflows
inferredcites →https://doi.org/10.1145/3140587.3062377openalex-snapshot
Generalizations of the theory and deployment of triangular inequality for compiler-based strength reduction
inferredcites →https://doi.org/10.1145/3284028.3284030openalex-snapshot
The Design and Implementation of a Real Time Visual Search System on JD E-commerce Platform
inferredcites →https://doi.org/10.1145/3366423.3380151openalex-snapshot
LightRec: A Memory and Search-Efficient Recommender System
inferredcites →https://doi.org/10.1145/3447548.3467101openalex-snapshot
Embedding-based Product Retrieval in Taobao Search
inferredcites →https://doi.org/10.1145/3485447.3511957openalex-snapshot
Progressively Optimized Bi-Granular Document Representation for Scalable Embedding Based Retrieval
inferredcites →https://doi.org/10.1145/3539618.3591651openalex-snapshot
Constructing Tree-based Index for Efficient and Effective Dense Retrieval
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/3600006.3613166openalex-snapshot
SPFresh: Incremental In-Place Update for Billion-Scale Vector Search
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/3613424.3614292openalex-snapshot
DF-GAS: a Distributed FPGA-as-a-Service Architecture towards Billion-Scale Graph-based Approximate Nearest Neighbor Search
inferredcites →https://doi.org/10.1145/3620665.3640360openalex-snapshot
JUNO: Optimizing High-Dimensional Approximate Nearest Neighbour Search with Sparsity-Aware Algorithm and Ray-Tracing Core Mapping
inferredcites →https://doi.org/10.1145/3626765openalex-snapshot
Homomorphic Compression: Making Text Processing on Compression Unlimited
inferredcites →https://doi.org/10.1145/3677134openalex-snapshot
Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality
inferredcites →https://doi.org/10.14778/2556549.2556574openalex-snapshot
Streaming similarity search over one billion tweets using parallel locality-sensitive hashing
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/3665844.3665852openalex-snapshot
Improving Graph Compression for Efficient Resource-Constrained Graph Analytics
inferredcites →https://doi.org/10.14778/3681954.3681979openalex-snapshot
Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries
inferredcites →https://doi.org/10.1609/aaai.v24i1.7683openalex-snapshot
Non-Metric Locality-Sensitive Hashing
inferredcites →https://doi.org/10.1609/aaai.v38i18.29960openalex-snapshot
How to Overcome Curse-of-Dimensionality for Out-of-Distribution Detection?
inferredcites →https://doi.org/10.48550/arxiv.1412.8690openalex-snapshot
Breaking the Curse of Dimensionality with Convex Neural Networks
inferredcites →https://doi.org/10.48550/arxiv.1609.07228openalex-snapshot
EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00042openalex-snapshot
cuFHEDB: GPU-Accelerated Fully Homomorphic Encryption Database
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.00159openalex-snapshot
Improving GPU Tensor Query Processing for Resource-Constrained Environments
inferred← citeshttps://doi.org/10.1145/3736227.3736233openalex-snapshot
Bang for the Buck: Vector Search on Cloud CPUs
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/3769783openalex-snapshot
Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3785021.3787994openalex-snapshot
Reproducibility Report for ACM SIGMOD 2025 Paper: 'Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities'
inferred← citeshttps://doi.org/10.1145/3788853.3801879openalex-snapshot
Vector Search for the Future: From Memory-Resident, Static Heterogeneous Storage, to Cloud-Native Architectures
inferred← citeshttps://doi.org/10.1145/3801359.3801360openalex-snapshot
From Theory to Practice: Optimization Framework and Performance Evaluation of Mobile HNSW
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.14778/3749646.3749666openalex-snapshot
Cracking Vector Search Indexes
inferred← citeshttps://doi.org/10.14778/3750601.3750700openalex-snapshot
Filtered Vector Search: State-of-the-Art and Research Opportunities
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/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.