Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/index-driven-similarity-search-in-metric-spaces-survey-article-UYi4THhXx2
References (109)
-
G. Navarro (1999)
Searching in metric spaces by spatial approximationThe VLDB Journal, 11
-
J. Mcnames (2000)
A Nearest Trajectory Strategy for Time Series Prediction -
C. Faloutsos, King-Ip Lin (1995)
FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets -
B. Kamgar-Parsi, L. Kanal (1985)
An improved branch and bound algorithm for computing k-nearest neighborsPattern Recognit. Lett., 3
-
J. Shafer, R. Agrawal (1997)
Parallel Algorithms for High-dimensional Similarity Joins for Data Mining Applications -
J. Mcnames, J. Suykens, J. Vandewalle (1999)
WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITIONInternational Journal of Bifurcation and Chaos, 09
-
M. Carey, Donald Kossmann (1997)
On saying “Enough already!” in SQL, 26
-
Hans-Peter Lenhof, M. Smid (1992)
Enumerating the k closest pairs optimallyProceedings., 33rd Annual Symposium on Foundations of Computer Science
-
V. Gaede, O. Günther (1998)
Multidimensional access methodsACM Comput. Surv., 30
-
≤ d (q, p) where d lo (q, p) = max i {|d (q, p i ) − d ( p i -
P. Ciaccia, M. Patella, P. Zezula (1997)
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces -
J. Wang, D. Shasha (1990)
Query Processing for Distance Metrics -
H. Samet (1989)
The Design and Analysis of Spatial Data Structures -
C. Traina, A. Traina, C. Faloutsos, B. Seeger (2002)
Fast Indexing and Visualization of Metric Data Sets using Slim-TreesIEEE Trans. Knowl. Data Eng., 14
-
Flip Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, Z. Protopapas (1996)
Fast Nearest Neighbor Search in Medical Image Databases -
Sameer Nene, S. Nayar (1997)
A simple algorithm for nearest neighbor search in high dimensionsIEEE Transactions on Pattern Analysis and Machine Intelligence, 19
-
P. Ciaccia, M. Patella, P. Zezula (1998)
A cost model for similarity queries in metric spacesProceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
-
S. Brin (1995)
Near Neighbor Search in Large Metric Spaces -
A. Guttman (1984)
R-trees: a dynamic index structure for spatial searching -
F. Dehne, H. Noltemeier (1987)
Voronoi trees and clustering problemsInf. Syst., 12
-
E. Ruiz (1986)
An algorithm for finding nearest neighbours in (approximately) constant average timePattern Recognition Letters, 4
-
Tolga Bozkaya, Meral Ozsoyoglu (1997)
Distance-based indexing for high-dimensional metric spaces -
Stefan Berchtold, C. Böhm, D. Keim, H. Kriegel (1997)
A cost model for nearest neighbor search in high-dimensional data space -
Jau-Yuen Chen, C. Bouman, J. Dalton (2000)
Hierarchical browsing and search of large image databasesIEEE transactions on image processing : a publication of the IEEE Signal Processing Society, 9 3
-
T. Ertl (1997)
Computer graphics—principles and practice -
(1987)
Spatial k-d-tree: an indexing mechanism for spatial database -
Samet -
W. Burkhard, R. Keller (1973)
Some approaches to best-match file searchingCommunications of the ACM, 16
-
P. Ciaccia, M. Patella (2001)
Bulk Loading the M-tree -
Edgar Chávez, G. Navarro (2000)
An effective clustering algorithm to index high dimensional metric spacesProceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000
-
Ronald Fagin, A. Lotem, M. Naor (2001)
Optimal aggregation algorithms for middlewareProceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
-
J. Shafer, R. Agrawal (1998)
Parallel Algorithms for High-Dimensional Proximity Joins -
K. Chakrabarti, S. Mehrotra (1999)
The hybrid tree: an index structure for high dimensional feature spacesProceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)
-
S. Maneewongvatana, D. Mount (2001)
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching -
(1990)
Orientation insensitive indexing methods for geometric objects -
G. isli, R. Hjaltason, H. Samet (2000)
Incremental Similarity Search in Multimedia Databases -
(1993)
A spatial index for approximate multiple string matching -
L. Micó, J. Oncina, Rafael Carrasco (1996)
A fast branch & bound nearest neighbour classifier in metric spacesPattern Recognit. Lett., 17
-
Edgar Chávez, J. Marroquín, Ricardo Baeza-Yates (1999)
Spaghettis: an array based algorithm for similarity queries in metric spaces6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)
-
Marvin Shapiro (1977)
The choice of reference points in best-match file searchingCommun. ACM, 20
-
N. Vasconcelos, A. Lippman (2000)
Statistical models of video structure for content analysis and characterizationIEEE transactions on image processing : a publication of the IEEE Signal Processing Society, 9 1
-
S. Maneewongvatana, D. Mount (2001)
An Empirical Study of a New Approach to Nearest Neighbor Searching -
December 2003. Index-Driven Similarity Search in Metric Spaces @BULLET 579 -
H. Fuchs, Z. Kedem, B. Naylor (1980)
On visible surface generation by a priori tree structures -
G. Navarro, Nora Reyes (2002)
Fully Dynamic Spatial Approximation Trees -
S. Dasgupta, Philip Long (2002)
Performance guarantees for hierarchical clustering -
Gísli Hjaltason, H. Samet (1999)
Distance browsing in spatial databasesACM Trans. Database Syst., 24
-
T. Chiueh (1994)
Content-Based Image Indexing -
P. Yianilos (1993)
Data structures and algorithms for nearest neighbor search in general metric spaces -
T. Gonzalez (1985)
Clustering to Minimize the Maximum Intercluster DistanceTheor. Comput. Sci., 38
-
D. Knuth (1998)
The art of computer programming, volume 3: (2nd ed.) sorting and searching -
C. Duncan, M. Goodrich, S. Kobourov (1999)
Balanced aspect ratio trees: combining the advantages of k-d trees and octreesJ. Algorithms, 38
-
K. Chakrabarti, S. Mehrotra (1998)
High dimensional feature indexing using hybrid trees -
P. Yianilos (1998)
Excluded middle vantage point forests for nearest neighbor search -
D. Knuth (1973)
The art of computer programming: sorting and searching (volume 3) -
TLAESA uses the distance matrix pivots to compute lower bounds on the distances of the tree pivots from q, rather than computing their actual distances from q -
(1996)
Similarity indexing with the SS-tree -
J. Bentley (1975)
Multidimensional binary search trees used for associative searchingCommun. ACM, 18
-
J. Vilar (1995)
Reducing the Overhead of the AESA Metric-Space Nearest Neighbour Searching AlgorithmInf. Process. Lett., 56
-
Gísli Hjaltason, H. Samet (2003)
Improved search heuristics for the sa-treePattern Recognit. Lett., 24
-
Tolga Bozkaya, Meral Ozsoyoglu (1999)
Indexing large metric spaces for similarity search queriesACM Trans. Database Syst., 24
-
Gísli Hjaltason, H. Samet (1995)
Ranking in Spatial Databases -
H. Gabriela, F. Martín (1999)
Cluster-preserving Embedding of Proteins -
L. Micó, J. Oncina, E. Vidal (1994)
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirementsPattern Recognit. Lett., 15
-
(1994)
Artificial Intelligence: A Modern Approach -
N. Roussopoulos, Stephen Kelley, F. Vincent (1995)
Nearest neighbor queries -
N. Linial, E. London, Y. Rabinovich (1994)
The geometry of graphs and some of its algorithmic applicationsCombinatorica, 15
-
H. Samet (1995)
Spatial Data Structures -
E. Vidal (1994)
New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)Pattern Recognit. Lett., 15
-
H. Noltemeier, K. Verbarg, C. Zirkelbach (1993)
A Data Structure for Representing and Efficient Querying Large Scenes of Geometric Objects: MB* Trees -
Enrique Vidal-Ruiz (1986)
An algorithm for finding nearest neighbours in (approximately) constant average timePattern Recognit. Lett., 4
-
H. Noltemeier, K. Verbarg, C. Zirkelbach (1992)
Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects -
J. Friedman, J. Bentley, R. Finkel (1976)
An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Trans. Math. Softw., 3
-
Edgar Chávez, G. Navarro, Ricardo Baeza-Yates, J. Marroquín (2001)
Searching in metric spacesACM Comput. Surv., 33
-
S. Arya, D. Mount, N. Netanyahu, R. Silverman, A. Wu (1998)
An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJ. ACM, 45
-
J. Uhlmann (1991)
Satisfying General Proximity/Similarity Queries with Metric TreesInf. Process. Lett., 40
-
Jack Orenstein (1982)
Multidimensional Tries Used for Associative SearchingInf. Process. Lett., 14
-
T. Seidl, H. Kriegel (1998)
Optimal multi-step k-nearest neighbor search -
N. Beckmann, H. Kriegel, R. Schneider, B. Seeger (1990)
The R*-tree: an efficient and robust access method for points and rectangles -
Dan Suciu, G. Weikum (2005)
ACM Transactions on Database SystemsACM Transactions on Database Systems, 30
-
J. Wang, Xiong Wang, King-Ip Lin, D. Shasha, B. Shapiro, Kaizhong Zhang (1999)
Evaluating a class of distance-mapping algorithms for data mining and clustering -
C. Böhm, Stefan Berchtold, D. Keim (2001)
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databasesACM Comput. Surv., 33
-
(1990)
identify four heuristics for picking the next candidate object during search. The next object o i for which to compute d (q, o i ) is chosen as the object in S u (as defined in Section 9.1) having -
I. Kalantari, G. McDonald (1983)
A Data Structure and an Algorithm for the Nearest Point ProblemIEEE Transactions on Software Engineering, SE-9
-
Georges Voronoi
Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs.Journal für die reine und angewandte Mathematik (Crelles Journal), 1908
-
S. Arya, D. Mount, N. Netanyahu, R. Silverman, Angela Wu (1994)
An optimal algorithm for approximate nearest neighbor searching -
A. Henrich (1994)
A Distance Scan Algorithm for Spatial Access Structures -
A. Fu, P. Chan, Yin-Ling Cheung, Y. Moon (2000)
Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distancesThe VLDB Journal, 9
-
Gísli Hjaltason, H. Samet (1998)
Incremental distance join algorithms for spatial databases -
Soren Larsen, L. Kanal (1986)
Analysis of k-nearest neighbor branch and bound rulesPattern Recognit. Lett., 4
-
V. Ramasubramanian, K. Paliwal (1992)
An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulationPattern Recognit. Lett., 13
-
P. Ciaccia, M. Patella (2002)
Searching in metric spaces with user-defined and approximate distancesACM Trans. Database Syst., 27
-
J. Friedman, F. Baskett, L. Shustek (1975)
An Algorithm for Finding Nearest NeighborsIEEE Transactions on Computers, C-24
-
L. Micó, J. Oncina, E. Vidal (1992)
An algorithm for finding nearest neighbours in constant average time with a linear space complexityProceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems
-
Philip Hubbard (1996)
Approximating polyhedra with spheres for time-critical collision detectionACM Trans. Graph., 15
-
H. Samet (1989)
Hierarchical Spatial Data Structures -
Thomas Brinkhoff, H. Kriegel, B. Seeger (1993)
Efficient processing of spatial joins using R-treesProceedings of the 1993 ACM SIGMOD international conference on Management of data
-
Edgar Chávez, J. Marroquín, G. Navarro (2001)
Fixed Queries Array: A Fast and Economical Data Structure for Proximity SearchingMultimedia Tools and Applications, 14
-
C. Merkwirth, U. Parlitz, W. Lauterborn (2000)
Fast nearest-neighbor searching for nonlinear signal processingPhysical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics, 62 2 Pt A
-
C. Gennaro, P. Savino, P. Zezula (2001)
Similarity search in metric databases through hashing -
Ricardo Baeza-Yates, W. Cunto, U. Manber, Sun Wu (1994)
Proximity Matching Using Fixed-Queries Trees -
Temple Smith, M. Waterman (1981)
Identification of common molecular subsequences.Journal of molecular biology, 147 1
-
J. Foley, A. Dam, Steven Feiner, J. Hughes (1990)
Computer graphics: principles and practice (2nd ed.) -
A. Moore (2000)
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data -
Hyoseop Shin, Bongki Moon, Sukho Lee (2000)
Adaptive multi-stage distance join processing -
D. Knuth (1998)
The Art of Computer Programming: Volume 3: Sorting and Searching -
K. Fukunaga, P. Narendra (1975)
A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, C-24
-
P. Oosterom (1993)
Reactive Data Structures for Geographic Information Systems -
Gísli Hjaltason, H. Samet (2003)
Properties of Embedding Methods for Similarity Searching in Metric SpacesIEEE Trans. Pattern Anal. Mach. Intell., 25
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2003 by ACM Inc.
- ISSN
- 0362-5915
- DOI
- 10.1145/958942.958948
- Publisher site
- See Article on Publisher Site
Abstract
Similarity search is a very important operation in multimedia databases and other database applications involving complex objects, and involves finding objects in a data set S similar to a query object q , based on some similarity measure. In this article, we focus on methods for similarity search that make the general assumption that similarity is represented with a distance metric d . Existing methods for handling similarity search in this setting typically fall into one of two classes. The first directly indexes the objects based on distances (distance-based indexing), while the second is based on mapping to a vector space (mapping-based approach). The main part of this article is dedicated to a survey of distance-based indexing methods, but we also briefly outline how search occurs in mapping-based methods. We also present a general framework for performing search based on distances, and present algorithms for common types of queries that operate on an arbitrary "search hierarchy." These algorithms can be applied on each of the methods presented, provided a suitable search hierarchy is defined.
Journal
ACM Transactions on Database Systems (TODS) – Association for Computing Machinery
Published: Dec 1, 2003