On the public citation graph

Indexing Metric Spaces for Exact Similarity Search

0 signed · 181 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/11408079_36openalex-snapshot
BM + -Tree: A Hyperplane-Based Index Method for High-Dimensional Metric Spaces
inferredcites →https://doi.org/10.1007/11575832_14openalex-snapshot
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
inferredcites →https://doi.org/10.1007/11764298_26openalex-snapshot
On the Least Cost for Proximity Searching in Metric Spaces
inferredcites →https://doi.org/10.1007/11795131_64openalex-snapshot
A Bottom-Up Distance-Based Index Tree for Metric Space
inferredcites →https://doi.org/10.1007/3-540-45151-x_34openalex-snapshot
MB+tree: A Dynamically Updatable Metric Index for Similarity Search
inferredcites →https://doi.org/10.1007/3-540-45735-6_23openalex-snapshot
Fully Dynamic Spatial Approximation Trees
inferredcites →https://doi.org/10.1007/3-540-46439-5_4openalex-snapshot
Slim-Trees: High Performance Metric Trees Minimizing Overlap between Nodes
inferredcites →https://doi.org/10.1007/3-540-49257-7_15openalex-snapshot
When Is “Nearest Neighbor” Meaningful?
inferredcites →https://doi.org/10.1007/3-540-55488-2_27openalex-snapshot
Monotonous Bisector* Trees — a tool for efficient partitioning of complex scenes of geometric objects
inferredcites →https://doi.org/10.1007/3-540-58094-8_18openalex-snapshot
Proximity matching using fixed-queries trees
inferredcites →https://doi.org/10.1007/978-3-030-02224-2_2openalex-snapshot
Performance Analysis of Graph-Based Methods for Exact and Approximate Similarity Search in Metric Spaces
inferredcites →https://doi.org/10.1007/978-3-030-02224-2_3openalex-snapshot
Querying Metric Spaces with Bit Operations
inferredcites →https://doi.org/10.1007/978-3-030-02224-2_9openalex-snapshot
Metric Indexing Assisted by Short-Term Memories
inferredcites →https://doi.org/10.1007/978-3-030-27615-7_8openalex-snapshot
HGraph: A Connected-Partition Approach to Proximity Graphs for Similarity Search
inferredcites →https://doi.org/10.1007/978-3-030-32047-8_14openalex-snapshot
Permutation’s Signatures for Proximity Searching in Metric Spaces
inferredcites →https://doi.org/10.1007/978-3-030-32047-8_2openalex-snapshot
Storing Data Once in M-tree and PM-tree
inferredcites →https://doi.org/10.1007/978-3-030-32047-8_4openalex-snapshot
SPLX-Perm: A Novel Permutation-Based Representation for Approximate Metric Search
inferredcites →https://doi.org/10.1007/978-3-030-60936-8_19openalex-snapshot
Local Intrinsic Dimensionality III: Density and Similarity
inferredcites →https://doi.org/10.1007/978-3-319-11988-5_8openalex-snapshot
Large-Scale Distributed Locality-Sensitive Hashing for General Metric Data
inferredcites →https://doi.org/10.1007/978-3-319-25087-8_26openalex-snapshot
Regrouping Metric-Space Search Index for Search Engine Size Adaptation
inferredcites →https://doi.org/10.1007/978-3-319-46759-7openalex-snapshot
Similarity Search and Applications
inferredcites →https://doi.org/10.1007/978-3-319-46759-7_5openalex-snapshot
Reference Point Hyperplane Trees
inferredcites →https://doi.org/10.1007/978-3-319-68474-1_1openalex-snapshot
The Power of Distance Distributions: Cost Models and Scheduling Policies for Quality-Controlled Similarity Queries
inferredcites →https://doi.org/10.1007/978-3-319-68474-1_4openalex-snapshot
Sketches with Unbalanced Bits for Similarity Search
inferredcites →https://doi.org/10.1007/978-3-319-68474-1_5openalex-snapshot
Local Intrinsic Dimensionality I: An Extreme-Value-Theoretic Foundation for Similarity Applications
inferredcites →https://doi.org/10.1007/978-3-319-68474-1_6openalex-snapshot
Local Intrinsic Dimensionality II: Multivariate Analysis and Distributional Support
inferredcites →https://doi.org/10.1007/978-3-540-30192-9_13openalex-snapshot
An Access Structure for Similarity Search in Metric Spaces
inferredcites →https://doi.org/10.1007/978-3-540-39403-7_13openalex-snapshot
Revisiting M-Tree Building Principles
inferredcites →https://doi.org/10.1007/978-3-540-45227-0_48openalex-snapshot
Similarity Join in Metric Spaces Using eD-Index
inferredcites →https://doi.org/10.1007/978-3-540-69507-3_37openalex-snapshot
Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
inferredcites →https://doi.org/10.1007/978-3-540-72584-8_30openalex-snapshot
Searching and Updating Metric Space Databases Using the Parallel EGNAT
inferredcites →https://doi.org/10.1007/978-3-540-75185-4_13openalex-snapshot
The MM-Tree: A Memory-Based Metric Tree Without Overlap Between Nodes
inferredcites →https://doi.org/10.1007/978-3-540-75185-4_14openalex-snapshot
Improving the Performance of M-Tree Family by Nearest-Neighbor Graphs
inferredcites →https://doi.org/10.1007/978-3-540-85654-2_30openalex-snapshot
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
inferredcites →https://doi.org/10.1007/978-3-540-85654-2_7openalex-snapshot
HRG: A Graph Structure for Fast Similarity Search in Metric Spaces
inferredcites →https://doi.org/10.1007/978-3-642-03625-5_9openalex-snapshot
The Basic Principles of Metric Indexing
inferredcites →https://doi.org/10.1007/978-3-642-03973-7_18openalex-snapshot
The Onion-Tree: Quick Indexing of Complex Data in the Main Memory
inferredcites →https://doi.org/10.1007/978-3-642-32153-5_6openalex-snapshot
Efficient Similarity Search in Metric Spaces with Cluster Reduction
inferredcites →https://doi.org/10.1007/978-3-642-32153-5_9openalex-snapshot
DSACL+-tree: A Dynamic Data Structure for Similarity Search in Secondary Memory
inferredcites →https://doi.org/10.1007/978-3-642-32597-7_41openalex-snapshot
Indexing Metric Spaces with Nested Forests
inferredcites →https://doi.org/10.1007/978-3-642-39640-3_42openalex-snapshot
MX-tree: A Double Hierarchical Metric Index with Overlap Reduction
inferredcites →https://doi.org/10.1007/978-3-642-41062-8_12openalex-snapshot
Extreme Pivots for Faster Metric Indexes
inferredcites →https://doi.org/10.1007/978-3-642-41062-8_3openalex-snapshot
Rank Cover Trees for Nearest Neighbor Search
inferredcites →https://doi.org/10.1007/978-3-642-83462-2_12openalex-snapshot
Voronoi Trees and Clustering Problems
inferredcites →https://doi.org/10.1007/978-3-662-49214-7_2openalex-snapshot
PPP-Codes for Large-Scale Similarity Searching
inferredcites →https://doi.org/10.1007/bf01231606openalex-snapshot
The TV-tree: An index structure for high-dimensional data
inferredcites →https://doi.org/10.1007/pl00010672openalex-snapshot
Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances
inferredcites →https://doi.org/10.1007/s00285-019-01348-1openalex-snapshot
Low-dimensional representation of genomic sequences
inferredcites →https://doi.org/10.1007/s00778-005-0178-0openalex-snapshot
The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient
inferredcites →https://doi.org/10.1007/s00778-017-0465-6openalex-snapshot
Indexing metric uncertain data for range queries and range joins
inferredcites →https://doi.org/10.1007/s007780050069openalex-snapshot
Approximate similarity retrieval with M-trees
inferredcites →https://doi.org/10.1007/s007780200060openalex-snapshot
Searching in metric spaces by spatial approximation
inferredcites →https://doi.org/10.1007/s10115-008-0190-yopenalex-snapshot
Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
inferredcites →https://doi.org/10.1007/s10559-017-9966-yopenalex-snapshot
Distance-Based Index Structures for Fast Similarity Search
inferredcites →https://doi.org/10.1007/s11042-010-0614-zopenalex-snapshot
Dynamic optimization of queries in pivot-based indexing
inferredcites →https://doi.org/10.1007/s11042-012-1271-1openalex-snapshot
MI-File: using inverted files for scalable approximate similarity search
inferredcites →https://doi.org/10.1007/s41019-021-00173-1openalex-snapshot
Efficient Indexing of Top-k Entities in Systems of Engagement with Extensions for Geo-tagged Entities
inferredcites →https://doi.org/10.1016/0020-0190(91)90074-ropenalex-snapshot
Satisfying general proximity / similarity queries with metric trees
inferredcites →https://doi.org/10.1016/0020-0190(95)00161-xopenalex-snapshot
Reducing the overhead of the AESA metric-space nearest neighbour searching algorithm
inferredcites →https://doi.org/10.1016/0167-8655(86)90013-9openalex-snapshot
An algorithm for finding nearest neighbours in (approximately) constant average time
inferredcites →https://doi.org/10.1016/0167-8655(94)90095-7openalex-snapshot
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements
inferredcites →https://doi.org/10.1016/0167-8655(96)00032-3openalex-snapshot
A fast branch & bound nearest neighbour classifier in metric spaces
inferredcites →https://doi.org/10.1016/0306-4379(87)90041-xopenalex-snapshot
Voronoi trees and clustering problems
inferredcites →https://doi.org/10.1016/0893-9659(91)90146-mopenalex-snapshot
Metric trees
inferredcites →https://doi.org/10.1016/j.datak.2007.06.001openalex-snapshot
CM-tree: A dynamic clustered index for similarity search in metric databases
inferredcites →https://doi.org/10.1016/j.ipl.2005.03.007openalex-snapshot
Exploiting distance coherence to speed up range queries in metric indexes
inferredcites →https://doi.org/10.1016/j.is.2010.06.004openalex-snapshot
Slicing the metric space to provide quick indexing of complex data in the main memory
inferredcites →https://doi.org/10.1016/j.is.2010.10.002openalex-snapshot
Metric Index: An efficient and scalable solution for precise and approximate similarity search
inferredcites →https://doi.org/10.1016/j.is.2011.01.002openalex-snapshot
Fully dynamic metric access methods based on hyperplane partitioning
inferredcites →https://doi.org/10.1016/j.is.2012.05.011openalex-snapshot
Ptolemaic access methods: Challenging the reign of the metric space model
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.2014.01.007openalex-snapshot
On indexing metric spaces using cut-regions
inferredcites →https://doi.org/10.1016/j.is.2015.01.009openalex-snapshot
Quantized ranking for permutation-based indexing
inferredcites →https://doi.org/10.1016/j.is.2015.10.014openalex-snapshot
Faster proximity searching with the distal SAT
inferredcites →https://doi.org/10.1016/j.is.2016.03.009openalex-snapshot
New dynamic metric indices for secondary memory
inferredcites →https://doi.org/10.1016/j.is.2016.06.004openalex-snapshot
An empirical evaluation of intrinsic dimension estimators
inferredcites →https://doi.org/10.1016/j.is.2018.01.002openalex-snapshot
Supermetric search
inferredcites →https://doi.org/10.1016/j.jda.2008.09.013openalex-snapshot
New dynamic construction techniques for M-tree
inferredcites →https://doi.org/10.1016/j.jda.2011.10.002openalex-snapshot
Indexability, concentration, and VC theory
inferredcites →https://doi.org/10.1016/j.jda.2011.10.004openalex-snapshot
Pivot selection: Dimension reduction for distance-based indexing
inferredcites →https://doi.org/10.1016/j.patrec.2004.11.014openalex-snapshot
A compact space decomposition for effective metric indexing
inferredcites →https://doi.org/10.1016/j.patrec.2006.06.012openalex-snapshot
Engineering efficient metric indexes
inferredcites →https://doi.org/10.1016/s0167-8655(03)00065-5openalex-snapshot
Pivot selection techniques for proximity searching in metric spaces
inferredcites →https://doi.org/10.1017/s1351324916000334openalex-snapshot
Word2Vec
inferredcites →https://doi.org/10.1023/a:1025026030880openalex-snapshot
D-Index: Distance Searching Index for Metric Data Sets
inferredcites →https://doi.org/10.1023/a:1026543900054openalex-snapshot
The Earth Mover's Distance as a Metric for Image Retrieval
inferredcites →https://doi.org/10.1109/iccv.2001.937632openalex-snapshot
The Earth Mover's distance is the Mallows distance: some insights from statistics
inferredcites →https://doi.org/10.1109/icde.2008.4497441openalex-snapshot
Nearest Neighbor Retrieval Using Distance-Based Hashing
inferredcites →https://doi.org/10.1109/icde.2012.79openalex-snapshot
Efficient Exact Similarity Searches Using Multiple Token Orderings
inferredcites →https://doi.org/10.1109/icde.2015.7113317openalex-snapshot
Efficient metric indexing for similarity search
inferredcites →https://doi.org/10.1109/icde.2016.7498318openalex-snapshot
Indexing multi-metric data
inferredcites →https://doi.org/10.1109/icdmw.2013.139openalex-snapshot
Dimensionality, Discriminability, Density and Distance Distributions
inferredcites →https://doi.org/10.1109/sccc.2001.972650openalex-snapshot
Dynamic spatial approximation trees
inferredcites →https://doi.org/10.1109/sccc.2003.1245441openalex-snapshot
Improved deletions in dynamic spatial approximation trees
inferredcites →https://doi.org/10.1109/sisap.2009.21openalex-snapshot
Optimal Pivots to Minimize the Index Size for Metric Access Methods
inferredcites →https://doi.org/10.1109/sisap.2009.28openalex-snapshot
Dynamic Spatial Approximation Trees for Massive Data
inferredcites →https://doi.org/10.1109/sisap.2009.9openalex-snapshot
Curse of Dimensionality in Pivot Based Indexes
inferredcites →https://doi.org/10.1109/spire.1999.796589openalex-snapshot
Searching in metric spaces by spatial approximation
inferredcites →https://doi.org/10.1109/spire.2000.878182openalex-snapshot
An effective clustering algorithm to index high dimensional metric spaces
inferredcites →https://doi.org/10.1109/tkde.2005.53openalex-snapshot
Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces
inferredcites →https://doi.org/10.1109/tkde.2011.93openalex-snapshot
Indexing Uncertain Data in General Metric Spaces
inferredcites →https://doi.org/10.1109/tkde.2015.2506556openalex-snapshot
Efficient Metric Indexing for Similarity Search and Similarity Joins
inferredcites →https://doi.org/10.1109/tpami.2007.1140openalex-snapshot
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
inferredcites →https://doi.org/10.1109/tpami.2007.70815openalex-snapshot
Effective Proximity Retrieval by Ordering Permutations
inferredcites →https://doi.org/10.1109/tse.1983.235263openalex-snapshot
A Data Structure and an Algorithm for the Nearest Point Problem
inferredcites →https://doi.org/10.1117/1.2819119openalex-snapshot
Book Review: Pattern Recognition and Machine Learning
inferredcites →https://doi.org/10.1137/1.9781611975673.21openalex-snapshot
Intrinsic Dimensionality Estimation within Tight Localities
inferredcites →https://doi.org/10.1145/1071610.1071612openalex-snapshot
iDistance
inferredcites →https://doi.org/10.1145/1143844.1143857openalex-snapshot
Cover trees for nearest neighbor
inferredcites →https://doi.org/10.1145/1166074.1166077openalex-snapshot
Theory of nearest neighbors indexability
inferredcites →https://doi.org/10.1145/1178677.1178698openalex-snapshot
Dynamic similarity search in multi-metric spaces
inferredcites →https://doi.org/10.1145/1327452.1327492openalex-snapshot
MapReduce
inferredcites →https://doi.org/10.1145/1498698.1564506openalex-snapshot
Speeding up spatial approximation search in metric spaces
inferredcites →https://doi.org/10.1145/1807167.1807266openalex-snapshot
Bed-tree
inferredcites →https://doi.org/10.1145/1862344.1862351openalex-snapshot
Enlarging nodes to improve dynamic spatial approximation trees
inferredcites →https://doi.org/10.1145/1871437.1871622openalex-snapshot
BP-tree
inferredcites →https://doi.org/10.1145/1989323.1989431openalex-snapshot
Efficient exact edit similarity query processing with the asymmetric signature scheme
inferredcites →https://doi.org/10.1145/1995412.1995418openalex-snapshot
Clustered pivot tables for I/O-optimized similarity search
inferredcites →https://doi.org/10.1145/2000486.2000490openalex-snapshot
Selecting vantage objects for similarity indexing
inferredcites →https://doi.org/10.1145/253260.253345openalex-snapshot
Distance-based indexing for high-dimensional metric spaces
inferredcites →https://doi.org/10.1145/2723372.2723728openalex-snapshot
Indexing Metric Uncertain Data for Range Queries
inferredcites →https://doi.org/10.1145/3001583openalex-snapshot
Hilbert Exclusion
inferredcites →https://doi.org/10.1145/3226595.3226636openalex-snapshot
"One size fits all": an idea whose time has come and gone
inferredcites →https://doi.org/10.1145/3226595.3226637openalex-snapshot
The end of an architectural era: it's time for a complete rewrite
inferredcites →https://doi.org/10.1145/328939.328959openalex-snapshot
Indexing large metric spaces for similarity search queries
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/362003.362025openalex-snapshot
Some approaches to best-match file searching
inferredcites →https://doi.org/10.1145/375663.375668openalex-snapshot
Outlier detection for high dimensional data
inferredcites →https://doi.org/10.1145/502807.502808openalex-snapshot
Searching in metric spaces
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/584792.584831openalex-snapshot
How to improve the pruning ability of dynamic metric access methods
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/958942.958948openalex-snapshot
Index-driven similarity search in metric spaces (Survey Article)
inferredcites →https://doi.org/10.1186/1471-2164-16-s3-s5openalex-snapshot
Similarity evaluation of DNA sequences based on frequent patterns and entropy
inferredcites →https://doi.org/10.14778/2824032.2824059openalex-snapshot
Permutation search methods are efficient, yet faster search is possible
inferredcites →https://doi.org/10.14778/3115404.3115411openalex-snapshot
Pivot-based metric indexing
inferredcites →https://doi.org/10.1587/transinf.2017edp7077openalex-snapshot
Pivot Generation Algorithm with a Complete Binary Tree for Efficient Exact Similarity Search
inferredcites →https://doi.org/10.5555/1182635.1164206openalex-snapshot
Efficient exact set-similarity joins
inferredcites →https://doi.org/10.5555/313559.313789openalex-snapshot
Data structures and algorithms for nearest neighbor search in general metric spaces
inferredcites →https://doi.org/10.5555/615204.615210openalex-snapshot
The TV-tree
inferredcites →https://doi.org/10.5753/jidm.2010.1280openalex-snapshot
DAHC-tree: An Effective Index for Approximate Search in High-Dimensional Metric Spaces
inferredcites →https://doi.org/10.5753/jidm.2010.948openalex-snapshot
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
inferredcites →https://doi.org/10.7551/mitpress/4908.003.0005openalex-snapshot
Nearest-Neighbor Searching and Metric Space Dimensions

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-031-34147-2_12openalex-snapshot
Dynamic Distal Spatial Approximation Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-39847-6_5openalex-snapshot
Adding Result Diversification to $$k$$NN-Based Joins in a Map-Reduce Framework
inferred← citeshttps://doi.org/10.1007/978-3-031-46994-7_5openalex-snapshot
Unbiased Similarity Estimators Using Samples
inferred← citeshttps://doi.org/10.1007/978-3-031-75823-2_1openalex-snapshot
An Efficient Framework for Approximate Nearest Neighbor Search on High-Dimensional Multi-metric Data
inferred← citeshttps://doi.org/10.1007/978-3-032-08573-3_6openalex-snapshot
A Novel Approach to Reduce the Financial and Computational Costs of Similarity Queries over Document Collections in NoSQL Databases
inferred← citeshttps://doi.org/10.1007/978-981-95-5716-5_34openalex-snapshot
Continuous Top-k Skyline Pairs Query Over Data Stream
inferred← citeshttps://doi.org/10.1007/978-981-95-5722-6_4openalex-snapshot
QUEST: Query-Aware Learned Metric Index for Similarity Search
inferred← citeshttps://doi.org/10.1007/978-981-97-5569-1_29openalex-snapshot
bSAX: A Novel Sketch for Efficient Data Series Similarity Search
inferred← citeshttps://doi.org/10.1007/s00778-021-00691-4openalex-snapshot
Pivot selection algorithms in metric spaces: a survey and experimental study
inferred← citeshttps://doi.org/10.1007/s00778-024-00864-xopenalex-snapshot
Survey of vector database management systems
inferred← citeshttps://doi.org/10.1016/j.inffus.2025.103708openalex-snapshot
Improving deepfake detection with predictive inter-modal alignment and feature reconstruction in audio–visual asynchrony scenarios
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120546openalex-snapshot
FLEX: A fast and light-weight learned index for kNN search in high-dimensional space
inferred← citeshttps://doi.org/10.1038/s41598-025-93366-xopenalex-snapshot
A data driven approach to urban area delineation using multi source geospatial data
inferred← citeshttps://doi.org/10.1109/access.2021.3075766openalex-snapshot
Content-Based Management of Human Motion Data: Survey and Challenges
inferred← citeshttps://doi.org/10.1109/clei67442.2025.11420313openalex-snapshot
Compact Data Structures for the Metric Suffix Array
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00326openalex-snapshot
HJG: An Effective Hierarchical Joint Graph for ANNS in Multi-Metric Spaces
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00101openalex-snapshot
A Length Enhanced B + -Tree Based Index for Efficient Set Similarity Query
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00156openalex-snapshot
Distance Comparison Operations are not Silver Bullets in Vector Similarity Search: A Benchmark Study on their Merits and Limits
inferred← citeshttps://doi.org/10.1109/icdew61823.2024.00026openalex-snapshot
Towards Ptolemaic metric properties of the z-normalized Euclidean distance for multivariate time series indexing
inferred← citeshttps://doi.org/10.1109/isads66912.2025.00014openalex-snapshot
Efficient Optimization of Hierarchical Joint Graph for Multi-Metric Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/ojcs.2026.3687006openalex-snapshot
Include-Slim: Supporting Similarity Retrieval Variants With a Metric Access Method
inferred← citeshttps://doi.org/10.1109/tkde.2023.3323535openalex-snapshot
Spatio-Temporal Trajectory Similarity Measures: A Comprehensive Survey and Quantitative Study
inferred← citeshttps://doi.org/10.1109/tkde.2024.3381111openalex-snapshot
DForest: A Minimal Dimensionality-Aware Indexing for High-Dimensional Exact Similarity Search
inferred← citeshttps://doi.org/10.1109/tkde.2024.3487759openalex-snapshot
DIMS: Distributed Index for Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1145/3617326openalex-snapshot
Closest Pairs Search Over Data Stream
inferred← citeshttps://doi.org/10.1145/3698194openalex-snapshot
Efficient Distance Queries on Non-point Data
inferred← citeshttps://doi.org/10.1145/3716825openalex-snapshot
Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries
inferred← citeshttps://doi.org/10.1145/3746027.3755455openalex-snapshot
Audio-Visual Asynchrony Mitigation: Cross-Modal Alignment and Feature Reconstruction for Deepfake Detection
inferred← citeshttps://doi.org/10.1145/3786665openalex-snapshot
LM-Tree: A Hybrid Learned Index for Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.11606/d.55.2023.tde-15022024-122742openalex-snapshot
Desenvolvimento de Método de Acesso Métrico com Calibração de Distância Perceptual para Consultas por Similaridade de Imagens Médicas
inferred← citeshttps://doi.org/10.14393/ufu.di.2023.656openalex-snapshot
Compact data structures for the metric suffix array
inferred← citeshttps://doi.org/10.14393/ufu.di.2024.619openalex-snapshot
Estruturas de indexação métricas em operações distribuídas de agrupamento por similaridade em dados de alta dimensionalidade
inferred← citeshttps://doi.org/10.14393/ufu.di.2025.149openalex-snapshot
SQLSIM: Consultas analíticas por similaridade em SGBD Relacionais
inferred← citeshttps://doi.org/10.14778/3665844.3665851openalex-snapshot
DIDS: Double Indices and Double Summarizations for Fast Similarity Search
inferred← citeshttps://doi.org/10.5753/bresci.2024.243330openalex-snapshot
Consultas analíticas por similaridade em SGBD Relacionais
inferred← citeshttps://doi.org/10.5753/sbbd.2025.247069openalex-snapshot
Efficient Reuse of Metric Indexes for Multi-resolution Queries
inferred← citeshttps://doi.org/10.5753/sbbd.2026.249668openalex-snapshot
Realimentação de Relevância em Memória para Consultas por Similaridade em Espaços Métricos
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.