Download now Free registration required
The quest for processing range queries of high-dimensional data has resulted in a number of innovative indexing mechanisms. Most of the early methods index data according to their geometric relationships. While they have met with certain success, these methods, unfortunately, either lack efficiency, particularly at higher dimensionality, or are too complex to implement. These drawbacks have made them less desirable in large-scale applications involving high-dimensional spatial data. For practical purposes, a good indexing method must be efficient and scaled well with both dimensionality and the size of the data set, and it should be straightforward to implement.
- Format: PDF
- Size: 612.2 KB