On the public citation graph
D-Cache: Universal Distance Cache for Metric Access Methods
0 signed · 58 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.1002/spe.4380200302openalex-snapshot
A system for adaptive disk rearrangement
inferredcites →https://doi.org/10.1006/cviu.2001.0934openalex-snapshot
Empirical Evaluation of Dissimilarity Measures for Color and Texture
inferredcites →https://doi.org/10.1007/11764298_8openalex-snapshot
Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
inferredcites →https://doi.org/10.1007/978-3-540-24768-5_93openalex-snapshot
An Efficient Cache Conscious Multi-dimensional Index Structure
inferredcites →https://doi.org/10.1007/978-3-642-03573-9_44openalex-snapshot
On Index-Free Similarity Search in Metric Spaces
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-007-0062-1openalex-snapshot
Reference-based indexing for metric spaces with costly distance measures
inferredcites →https://doi.org/10.1007/s10115-006-0018-6openalex-snapshot
Extending metric index structures for efficient range query processing
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0167-8655(94)90094-9openalex-snapshot
New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)
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/j.future.2007.07.012openalex-snapshot
Scalability comparison of Peer-to-Peer similarity search structures
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/s0167-8655(03)00065-5openalex-snapshot
Pivot selection techniques for proximity searching in metric spaces
inferredcites →https://doi.org/10.1016/s1570-8667(03)00067-4openalex-snapshot
Probabilistic proximity searching algorithms based on compact partitions
inferredcites →https://doi.org/10.1109/34.232073openalex-snapshot
Comparing images using the Hausdorff distance
inferredcites →https://doi.org/10.1109/34.391417openalex-snapshot
Efficient color histogram indexing for quadratic form distance functions
inferredcites →https://doi.org/10.1109/69.908982openalex-snapshot
Multiple similarity queries: a basic DBMS operation for mining in metric databases
inferredcites →https://doi.org/10.1109/icdew.2008.4498340openalex-snapshot
The many facets of approximate similarity search
inferredcites →https://doi.org/10.1109/icpr.1992.201840openalex-snapshot
An algorithm for finding nearest neighbours in constant average time with a linear space complexity
inferredcites →https://doi.org/10.1109/sc.2006.44openalex-snapshot
Multiple Range Query Optimization with Distributed Cache Indexing
inferredcites →https://doi.org/10.1109/sisap.2008.18openalex-snapshot
The Many Facets of Approximate Similarity Search
inferredcites →https://doi.org/10.1109/sisap.2009.27openalex-snapshot
Parallel Dynamic Batch Loading in the M-tree
inferredcites →https://doi.org/10.1109/spire.1999.796576openalex-snapshot
Spaghettis: an array based algorithm for similarity queries in metric spaces
inferredcites →https://doi.org/10.1145/1188455.1188560openalex-snapshot
Data management and query---Multiple range query optimization with distributed cache indexing
inferredcites →https://doi.org/10.1145/1458469.1458473openalex-snapshot
A metric cache for similarity search
inferredcites →https://doi.org/10.1145/1516360.1516450openalex-snapshot
Caching content-based queries for robust and efficient image retrieval
inferredcites →https://doi.org/10.1145/1994.2022openalex-snapshot
Principles of database buffer management
inferredcites →https://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferredcites →https://doi.org/10.1145/502807.502809openalex-snapshot
Searching in high-dimensional spaces
inferredcites →https://doi.org/10.1145/958942.958948openalex-snapshot
Index-driven similarity search in metric spaces (Survey Article)
inferredcites →https://doi.org/10.48550/arxiv.0905.4627openalex-snapshot
CoPhIR: a Test Collection for Content-Based Image 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-06069-3_4openalex-snapshot
Efficient Local Intrinsic Dimensionality Estimation in Evolving Deep Representations
inferred← citeshttps://doi.org/10.1007/978-3-319-44039-2_5openalex-snapshot
Optimizing Query Performance with Inverted Cache in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-319-66917-5_18openalex-snapshot
Towards High Similarity Search Throughput by Dynamic Query Reordering and Parallel Processing
inferred← citeshttps://doi.org/10.1007/978-3-319-68474-1_2openalex-snapshot
Cache and Priority Queue Based Approximation Technique for a Stream of Similarity Search Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-32153-5_3openalex-snapshot
Snake Table: A Dynamic Pivot Table for Streams of k-NN Searches
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_40openalex-snapshot
Efficient Similarity Search by Combining Indexing and Caching Strategies
inferred← citeshttps://doi.org/10.1007/978-3-662-49192-8_50openalex-snapshot
Evaluation of Static/Dynamic Cache for Similarity Search Engines
inferred← citeshttps://doi.org/10.1007/978-3-662-58384-5_3openalex-snapshot
Towards Faster Similarity Search by Dynamic Reordering of Streamed Queries
inferred← citeshttps://doi.org/10.1007/s11042-014-2251-4openalex-snapshot
Approximating adaptive distance measures using scalable feature signatures
inferred← citeshttps://doi.org/10.1007/s11227-017-2207-3openalex-snapshot
A graph-based cache for large-scale similarity search engines
inferred← citeshttps://doi.org/10.1007/s13222-015-0210-5openalex-snapshot
Using Summaries to Search and Visualize Distributed Resources Addressing Spatial and Multimedia Features
inferred← citeshttps://doi.org/10.1016/j.datak.2014.09.001openalex-snapshot
The NOBH-tree: Improving in-memory metric access methods by using metric hyperplanes with non-overlapping nodes
inferred← citeshttps://doi.org/10.1016/j.ins.2022.11.024openalex-snapshot
Unconventional application of k-means for distributed approximate similarity search
inferred← citeshttps://doi.org/10.1016/j.is.2013.05.010openalex-snapshot
Analyzing and dynamically indexing the query set
inferred← citeshttps://doi.org/10.1016/j.is.2014.01.007openalex-snapshot
On indexing metric spaces using cut-regions
inferred← citeshttps://doi.org/10.1016/j.is.2014.09.006openalex-snapshot
Quicker range- and k-NN joins in metric spaces
inferred← citeshttps://doi.org/10.1109/cic.2015.44openalex-snapshot
Hike: A High Performance kNN Query Processing System for Multimedia Data
inferred← citeshttps://doi.org/10.1109/fskd.2018.8687208openalex-snapshot
Combining Cache and Priority Queue to Enhance Evaluation of Similarity Search Queries
inferred← citeshttps://doi.org/10.1109/icdew.2018.00020openalex-snapshot
Towards Artificial Priority Queues for Similarity Query Execution
inferred← citeshttps://doi.org/10.1109/tkde.2016.2515603openalex-snapshot
Exploit Every Bit: Effective Caching for High-Dimensional Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3022227.3022291openalex-snapshot
An efficient similar image search framework for large-scale data on cloud
inferred← citeshttps://doi.org/10.1186/1477-5956-9-s1-s20openalex-snapshot
SProt: sphere-based protein structure similarity algorithm
inferred← citeshttps://doi.org/10.15388/informatica.2017.118openalex-snapshot
Popularity-Based Ranking for Fast Approximate kNN Search
inferred← citeshttps://doi.org/10.3233/jifs-181760openalex-snapshot
Joint index and cache technique for improving the effectiveness of a similar image search in big data framework
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.