ArrayStore: a storage manager for complex parallel array processing
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
High-dimensional similarity search using data-sensitive space partitioning
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
The problem of accessing data in high-dimensional spaces has attracted considerable scientific interest. Multi-dimensional access methods typically employ a space-partitioning strategy whose goal is to direct the search toward relevant parts of the space. Unfortunately, monolithic partitioning, whether it is static, dynamic or some hybrid scheme, has serious limitations in high-dimensional situations. This paper presents a new family of indexing techniques that superimposes static partitioning over a dynamic partitioning scheme in order to improve the search performance in high-dimensional spaces. A comprehensive set of experiments shows that, in realistic scenarios, the proposed solutions are usually much more efficient and more scalable than the multi-dimensional access methods based on monolithic partitioning.