The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Density-based indexing for approximate nearest-neighbor queries
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Proceedings of the 17th International Conference on Data Engineering
On the Surprising Behavior of Distance Metrics in High Dimensional Spaces
ICDT '01 Proceedings of the 8th International Conference on Database Theory
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
What Is the Nearest Neighbor in High Dimensional Spaces?
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
An introduction to variable and feature selection
The Journal of Machine Learning Research
Incremental semi-supervised subspace learning for image retrieval
Proceedings of the 12th annual ACM international conference on Multimedia
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Efficient Query Processing in Arbitrary Subspaces Using Vector Approximations
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
The Concentration of Fractional Distances
IEEE Transactions on Knowledge and Data Engineering
Dwarfs in the rearview mirror: how big are they really?
Proceedings of the VLDB Endowment
ACM Transactions on Knowledge Discovery from Data (TKDD)
On High Dimensional Indexing of Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Similarity Search in Arbitrary Subspaces Under Lp-Norm
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
A survey on unsupervised outlier detection in high-dimensional numerical data
Statistical Analysis and Data Mining
| Hi-index | 0.00 |
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. While much research has been done in efficient support of single column similarity queries or of similarity queries in the full space, scarcely any support of similarity search in subspaces has been provided so far. The three existing approaches are variations of the sequential scan. Here, we propose the first index-based solution to subspace similarity search in arbitrary subspaces.