This is a preliminary release of an article accepted by ACM Transactions on Database Systems. The definitive version is currently in production at ACM and, when released, will supersede this version.
|
3033
|
Pattern Classification and Scene Analysis
– Duda, Hart
- 1973
|
|
1712
|
Introduction to Statistical Pattern Recognition
– Fukunaga
- 1990
|
|
1261
|
Basic local alignment search tool
– Altschul, Gish, et al.
- 1990
|
|
722
|
The R*-tree: An efficient and robust access method for points and rectangles
– BECKMANN, KRIEGEL, et al.
- 1990
|
|
719
|
The fractal geometry of nature
– Mandelbrot
- 1982
|
|
434
|
Multidimensional access methods
– Gaede, Gunther
- 1998
|
|
428
|
An algorithm for finding best matches in logarithmic expected time
– Friedman, Bentley, et al.
- 1977
|
|
389
|
Automatic subspace clustering of high dimensional data for data mining applications
– Agrawal, Gehrke, et al.
- 1998
|
|
386
|
Efficient and Effective Querying by Image Content
– Faloutsos, Barber, et al.
- 1994
|
|
330
|
A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
– Weber, Schek, et al.
- 1998
|
|
319
|
FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
– Faloutsos, Lin
- 1995
|
|
318
|
Fast subsequence matching in time-series databases
– Faloutsos, Ranganathan, et al.
- 1994
|
|
309
|
The SR-tree: An index structure for high-dimensional nearest neighbor queries
– Katayama, Satoh
- 1997
|
|
309
|
The R + -tree: A dynamic index for multi-dimensional objects
– Sellis, Roussopoulos, et al.
- 1987
|
|
258
|
Similarity indexing with the SS-tree
– White, Jain
- 1996
|
|
174
|
Fast similarity search in the presence of noise, scaling, and translation in time-series database
– Agrawal, Sawhney, et al.
- 1995
|
|
170
|
A cost model for nearest neighbor search in high-dimensional data spaces
– Berchtold, Bo¨hm, et al.
- 1997
|
|
153
|
Ranking in spatial databases
– Hjaltason, Samet
- 1995
|
|
133
|
Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension
– Faloutsos, Kamel
- 1994
|
|
129
|
V.: ‘A Retrieval Technique for Similar Shapes
– Jagadish
- 1991
|
|
127
|
T.K.: A Model for the Prediction of R-tree Performance
– Theodoridis, Sellis
- 1996
|
|
104
|
Jain,R.: Similarity Indexing: Algorithms and Performance
– White
|
|
103
|
Active storage for large-scale data mining and multimedia
– Riedel, Gibson, et al.
- 1998
|
|
101
|
Estimating the selectivity of spatial queries using the ‘correlation’ fractal dimension
– Belussi, Faloutsos
- 1995
|
|
94
|
Refinements to nearest-neighbor searching in kdimensional trees
– Sproull
- 1991
|
|
90
|
Fast nearest neighbor search in medical image databases
– Korn, Sidiropoulos, et al.
- 1996
|
|
82
|
The Basics of Monte Carlo Methods
– Kalos
- 1985
|
|
81
|
Declustering using fractals
– Faloutsos, Bhagwat
- 1993
|
|
71
|
Towards an analysis of range query performance in spatial data structures
– Pagel, Six, et al.
- 1993
|
|
70
|
Content-based image indexing
– Chiueh
- 1994
|
|
58
|
Fast parallel similarity search in multimedia databases
– Berchtoll, Bohm, et al.
- 1997
|
|
56
|
Optimization strategies for spatial query processing
– AREF, SAMET
- 1991
|
|
56
|
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces
– Berchtold, Bohm, et al.
- 2000
|
|
53
|
Matrix Computations 2nd Edition
– Golub, Loan
- 1989
|
|
52
|
A generic approach to bulk loading multidimensional index structures
– Bercken, Seeger, et al.
- 1997
|
|
44
|
Improving the query performance of highdimensional index structures by bulk-load operations
– Berchtold, Bohm, et al.
- 1998
|
|
41
|
E.: ‘Feature-Based Retrieval of Similar Shapes
– Mehrotra, Gary
- 1993
|
|
38
|
Optimal Redundancy in Spatial Database Systems
– GAEDE
- 1995
|
|
36
|
A cost model for similarity queries in metric spaces
– Ciaccia, Patella, et al.
|
|
33
|
Laws: Minutes From an Infinite Paradise
– Fractals, Power
- 1991
|
|
32
|
Accounting for boundary effects in nearest-neighbor searching. Discrete and Computational Geometry
– Arya, Mount, et al.
|
|
30
|
J.: ‘Efficient Color Histogram Indexing
– Shawney, Hafner
- 1994
|
|
28
|
H.-P.: S3: Similarity Search in CAD Database Systems
– Berchtold, Kriegel
- 1997
|
|
25
|
A Distance-Scan Algorithm for Spatial Access Structures
– Henrich
- 1994
|
|
23
|
Nearest neighbor searching and applications
– Arya
- 1995
|
|
21
|
Using extended feature objects for partial similarity retrieval
– Berchtold, DA, et al.
- 1997
|
|
21
|
The LSD h -tree: an access structure for feature vectors
– Henrich
- 1998
|
|
17
|
Similar shape retrieval using a structural feature index
– Gary, Mehrotra
- 1990
|
|
17
|
E.: ‘Feature-Index-Based Similar Shape Retrieval
– Mehrotra, Gary
- 1995
|
|
15
|
Analysis of n-dimensional quadtrees using the Hausdorff fractal dimension
– Faloutsos, Gaede
- 1996
|
|
