On the public citation graph

How to improve the pruning ability of dynamic metric access methods

0 signed · 57 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-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/bf01231606openalex-snapshot
The TV-tree: An index structure for high-dimensional data
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/b978-155860651-7/50124-8openalex-snapshot
The X-tree: An Index Structure for High-Dimensional Data Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and…
inferredcites →https://doi.org/10.1109/icde.1999.754960openalex-snapshot
The hybrid tree: an index structure for high dimensional feature spaces
inferredcites →https://doi.org/10.1109/icde.2000.839409openalex-snapshot
Distance Exponent: A New Concept for Selectivity Estimation in Metric Trees
inferredcites →https://doi.org/10.1109/icde.2001.914877openalex-snapshot
Similarity search without tears: the OMNI-family of all-purpose access methods
inferredcites →https://doi.org/10.1145/253260.253345openalex-snapshot
Distance-based indexing for high-dimensional metric spaces
inferredcites →https://doi.org/10.1145/253260.253347openalex-snapshot
The SR-tree
inferredcites →https://doi.org/10.1145/253262.253345openalex-snapshot
Distance-based indexing for high-dimensional metric spaces
inferredcites →https://doi.org/10.1145/253262.253347openalex-snapshot
The SR-tree
inferredcites →https://doi.org/10.1145/280277.280279openalex-snapshot
Multidimensional access methods
inferredcites →https://doi.org/10.1145/335191.335412openalex-snapshot
Spatial join selectivity using power laws
inferredcites →https://doi.org/10.1145/342009.335412openalex-snapshot
Spatial join selectivity using power laws
inferredcites →https://doi.org/10.1145/362003.362025openalex-snapshot
Some approaches to best-match file searching
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

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11569596_86openalex-snapshot
Recursive Lists of Clusters: A Dynamic Data Structure for Range Queries in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-1-4471-4890-6_2openalex-snapshot
Related Work and Concepts
inferred← citeshttps://doi.org/10.1007/978-3-030-02224-2_9openalex-snapshot
Metric Indexing Assisted by Short-Term Memories
inferred← citeshttps://doi.org/10.1007/978-3-319-23135-8_2openalex-snapshot
Improving the Pruning Ability of Dynamic Metric Access Methods with Local Additional Pivots and Anticipation of Information
inferred← citeshttps://doi.org/10.1007/978-3-540-39984-1_28openalex-snapshot
Memory-Adaptative Dynamic Spatial Approximation Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-75185-4_13openalex-snapshot
The MM-Tree: A Memory-Based Metric Tree Without Overlap Between Nodes
inferred← citeshttps://doi.org/10.1007/978-3-540-75767-2_12openalex-snapshot
Efficiency and Scalability Issues in Metric Access Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-03625-5_9openalex-snapshot
The Basic Principles of Metric Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-39640-3_42openalex-snapshot
MX-tree: A Double Hierarchical Metric Index with Overlap Reduction
inferred← citeshttps://doi.org/10.1007/s00778-007-0062-1openalex-snapshot
Reference-based indexing for metric spaces with costly distance measures
inferred← citeshttps://doi.org/10.1016/j.datak.2004.06.015openalex-snapshot
Array-index: a plug&search K nearest neighbors method for high-dimensional data
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/j.is.2017.10.003openalex-snapshot
CLAP, ACIR and SCOOP: Novel techniques for improving the performance of dynamic Metric Access Methods
inferred← citeshttps://doi.org/10.1016/j.is.2020.101492openalex-snapshot
A comprehensive analysis of delayed insertions in metric access methods
inferred← citeshttps://doi.org/10.1016/j.patrec.2014.12.004openalex-snapshot
A novel indexing scheme for similarity search in metric spaces
inferred← citeshttps://doi.org/10.1080/00288230709510325openalex-snapshot
An efficient method for processing a large‐scale motion database in agriculture informatisation
inferred← citeshttps://doi.org/10.1109/icassp.2009.4959788openalex-snapshot
MOBHRG: Fast k-nearest-neighbor search by overlap reduction of hyperspherical regions
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498351openalex-snapshot
Effective use of space for pivot-based metric indexing structures
inferred← citeshttps://doi.org/10.1109/iri.2004.1431440openalex-snapshot
Component retrieval using metric indexing
inferred← citeshttps://doi.org/10.1109/sisap.2008.22openalex-snapshot
Effective Use of Space for Pivot-Based Metric Indexing Structures
inferred← citeshttps://doi.org/10.1142/s0218001410008044openalex-snapshot
DOUBLE-REFERENCE INDEX FOR MOTION RETRIEVAL BY ISOMAP DIMENSIONALITY REDUCTION
inferred← citeshttps://doi.org/10.1145/3534963openalex-snapshot
Indexing Metric Spaces for Exact Similarity Search
inferred← citeshttps://doi.org/10.11606/d.55.2004.tde-27072004-141623openalex-snapshot
DBM-tree: método de acesso métrico sensível à densidade local
inferred← citeshttps://doi.org/10.11606/d.55.2005.tde-21112014-172348openalex-snapshot
Desenvolvimento de algoritmos genéticos para consultas por similaridade em domínios métricos
inferred← citeshttps://doi.org/10.11606/d.55.2008.tde-06052008-095020openalex-snapshot
Análise da influência de funções de distância para o processamento de consultas por similaridade em recuperação de imagens por conteúdo
inferred← citeshttps://doi.org/10.11606/d.55.2020.tde-09102020-153743openalex-snapshot
Indexação Eficiente de Múltiplos Espaços Métricos para Otimização de Consultas por Similaridade
inferred← citeshttps://doi.org/10.11606/d.55.2021.tde-27012022-123001openalex-snapshot
VD-Tree: Uma estratégia para redução da sobreposição de nós em Métodos de Acesso Métricos utilizando o Diagrama de Voronoi
inferred← citeshttps://doi.org/10.11606/t.55.2004.tde-20082015-105153openalex-snapshot
Recuperação de informação por similaridade utilizando técnicas inteligentes
inferred← citeshttps://doi.org/10.11606/t.55.2006.tde-28092006-151225openalex-snapshot
Operações de consulta por similaridade em grandes bases de dados complexos
inferred← citeshttps://doi.org/10.11606/t.55.2008.tde-16022009-144432openalex-snapshot
Suporte a sistemas de auxílio ao diagnóstico e de recuperação de imagens por conteúdo usando mineração de regras de associação
inferred← citeshttps://doi.org/10.11606/t.55.2009.tde-30032010-142105openalex-snapshot
Tratamento de tempo e dinamicidade em dados representados em espaços métricos
inferred← citeshttps://doi.org/10.11606/t.55.2010.tde-22092010-144202openalex-snapshot
Explorando conceitos da teoria de espaços métricos em consultas por similaridade sobre dados complexos
inferred← citeshttps://doi.org/10.11606/t.55.2012.tde-25012013-153055openalex-snapshot
Arcabouço para recuperação de imagens por conteúdo visando à percepção do usuário
inferred← citeshttps://doi.org/10.11606/t.55.2014.tde-16052014-154931openalex-snapshot
Sistematização da percepção médica na construção de sistemas para recuperação de imagens por conteúdo
inferred← citeshttps://doi.org/10.14393/ufu.di.2017.295openalex-snapshot
Exploração do uso de short-term memory na construção de métodos de acesso métricos dinâmicos sobre a perspectiva de diferentes políticas de divisão de nós
inferred← citeshttps://doi.org/10.3233/ifs-151808openalex-snapshot
A new set of pivot elimination schemes for increasing the query performance
inferred← citeshttps://doi.org/10.5555/1182635.1164205openalex-snapshot
Reference-based indexing of sequence databases
inferred← citeshttps://doi.org/10.5753/jidm.2010.1279openalex-snapshot
An Adaptive Multi-level Hashing Structure for Fast Approximate Similarity Search
inferred← citeshttps://doi.org/10.5753/jidm.2013.1465openalex-snapshot
The Images and Data Bases Group at University of São Paulo
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.